92,355 research outputs found
Small permutation classes
We establish a phase transition for permutation classes (downsets of
permutations under the permutation containment order): there is an algebraic
number , approximately 2.20557, for which there are only countably many
permutation classes of growth rate (Stanley-Wilf limit) less than but
uncountably many permutation classes of growth rate , answering a
question of Klazar. We go on to completely characterize the possible
sub- 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)
Generating Permutations with Restricted Containers
We investigate a generalization of stacks that we call
-machines. We show how this viewpoint rapidly leads to functional
equations for the classes of permutations that -machines generate,
and how these systems of functional equations can frequently be solved by
either the kernel method or, much more easily, by guessing and checking.
General results about the rationality, algebraicity, and the existence of
Wilfian formulas for some classes generated by -machines are
given. We also draw attention to some relatively small permutation classes
which, although we can generate thousands of terms of their enumerations, seem
to not have D-finite generating functions
Turbulence, amalgamation and generic automorphisms of homogeneous structures
We study topological properties of conjugacy classes in Polish groups, with
emphasis on automorphism groups of homogeneous countable structures. We first
consider the existence of dense conjugacy classes (the topological Rokhlin
property). We then characterize when an automorphism group admits a comeager
conjugacy class (answering a question of Truss) and apply this to show that the
homeomorphism group of the Cantor space has a comeager conjugacy class
(answering a question of Akin-Hurley-Kennedy). Finally, we study Polish groups
that admit comeager conjugacy classes in any dimension (in which case the
groups are said to admit ample generics). We show that Polish groups with ample
generics have the small index property (generalizing results of
Hodges-Hodkinson-Lascar-Shelah) and arbitrary homomorphisms from such groups
into separable groups are automatically continuous. Moreover, in the case of
oligomorphic permutation groups, they have uncountable cofinality and the
Bergman property. These results in particular apply to automorphism groups of
many -stable, -categorical structures and of the random
graph. In this connection, we also show that the infinite symmetric group
has a unique non-trivial separable group topology. For several
interesting groups we also establish Serre's properties (FH) and (FA)
- …