Small permutation classes

We establish a phase transition for permutation classes (downsets of permutations under the permutation containment order): there is an algebraic number $\kappa$, approximately 2.20557, for which there are only countably many permutation classes of growth rate (Stanley-Wilf limit) less than $\kappa$ but uncountably many permutation classes of growth rate $\kappa$, answering a question of Klazar. We go on to completely characterize the possible sub-$\kappa$ growth rates of permutation classes, answering a question of Kaiser and Klazar. Central to our proofs are the concepts of generalized grid classes (introduced herein), partial well-order, and atomicity (also known as the joint embedding property)

Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)

International audienceOriginating in arithmetics and logic, the theory of ordered sets is now a field of combinatorics that is intimately linked to graph theory, universal algebra and multiple-valued logic, and that has a wide range of classical applications such as formal calculus, classification, decision aid and social choice.This international conference “Algebras, graphs and ordered set” (ALGOS) brings together specialists in the theory of graphs, relational structures and ordered sets, topics that are omnipresent in artificial intelligence and in knowledge discovery, and with concrete applications in biomedical sciences, security, social networks and e-learning systems. One of the goals of this event is to provide a common ground for mathematicians and computer scientists to meet, to present their latest results, and to discuss original applications in related scientific fields. On this basis, we hope for fruitful exchanges that can motivate multidisciplinary projects.The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) has a particular motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this reason, we have particularly welcomed submissions in areas related to Maurice’s many scientific interests:• Lattices and ordered sets• Combinatorics and graph theory• Set theory and theory of relations• Universal algebra and multiple valued logic• Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid and social choice, security, social networks, web semantics..

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Topological Groups: Yesterday, Today, Tomorrow

In 1900, David Hilbert asked whether each locally euclidean topological group admits a Lie group structure. This was the fifth of his famous 23 questions which foreshadowed much of the mathematical creativity of the twentieth century. It required half a century of effort by several generations of eminent mathematicians until it was settled in the affirmative. These efforts resulted over time in the Peter-Weyl Theorem, the Pontryagin-van Kampen Duality Theorem for locally compact abelian groups, and finally the solution of Hilbert 5 and the structure theory of locally compact groups, through the combined work of Andrew Gleason, Kenkichi Iwasawa, Deane Montgomery, and Leon Zippin. For a presentation of Hilbert 5 see the 2014 book “Hilbert’s Fifth Problem and Related Topics” by the winner of a 2006 Fields Medal and 2014 Breakthrough Prize in Mathematics, Terence Tao. It is not possible to describe briefly the richness of the topological group theory and the many directions taken since Hilbert 5. The 900 page reference book in 2013 “The Structure of Compact Groups” by Karl H. Hofmann and Sidney A. Morris, deals with one aspect of compact group theory. There are several books on profinite groups including those written by John S. Wilson (1998) and by Luis Ribes and ‎Pavel Zalesskii (2012). The 2007 book “The Lie Theory of Connected Pro-Lie Groups” by Karl Hofmann and Sidney A. Morris, demonstrates how powerful Lie Theory is in exposing the structure of infinite-dimensional Lie groups. The study of free topological groups initiated by A.A. Markov, M.I. Graev and S. Kakutani, has resulted in a wealth of interesting results, in particular those of A.V. Arkhangelʹskiĭ and many of his former students who developed this topic and its relations with topology. The book “Topological Groups and Related Structures” by Alexander Arkhangelʹskii and Mikhail Tkachenko has a diverse content including much material on free topological groups. Compactness conditions in topological groups, especially pseudocompactness as exemplified in the many papers of W.W. Comfort, has been another direction which has proved very fruitful to the present day

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

An Introduction to Set Theory and Topology

These notes are an introduction to set theory and topology. They are the result of teaching a two-semester course sequence on these topics for many years at Washington University in St. Louis. Typically the students were advanced undergraduate mathematics majors, a few beginning graduate students in mathematics, and some graduate students from other areas that included economics and engineering. The usual background for the material is an introductory undergraduate analysis course, mostly because it provides a solid introduction to Euclidean space Rn and practice with rigorous arguments — in particular, about continuity. Strictly speaking, however, the material is mostly self-contained. Examples are taken now and then from analysis, but they are not logically necessary for the development of the material. The only real prerequisite is the level of mathematical interest, maturity and patience needed to handle abstract ideas and to read and write careful proofs. A few very capable students have taken this course before introductory analysis (even, rarely, outstanding university freshmen) and invariably they have commented later on how material eased their way into analysis.https://openscholarship.wustl.edu/books/1020/thumbnail.jp