3,472 research outputs found
Growth rates for subclasses of Av(321)
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does not change growth rates
Grid classes and the Fibonacci dichotomy for restricted permutations
We introduce and characterise grid classes, which are natural generalisations
of other well-studied permutation classes. This characterisation allows us to
give a new, short proof of the Fibonacci dichotomy: the number of permutations
of length n in a permutation class is either at least as large as the nth
Fibonacci number or is eventually polynomial
Permutation classes
This is a survey on permutation classes for the upcoming book Handbook of
Enumerative Combinatorics
Inflations of geometric grid classes of permutations
All three authors were partially supported by EPSRC via the grant EP/J006440/1.Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of permutation classes of growth rate less than κ ≈ 2.20557 (a specific algebraic integer at which infinite antichains first appear). Using language- and order-theoretic methods, we prove that the substitution closures of geometric grid classes are well partially ordered, finitely based, and that all their subclasses have algebraic generating functions. We go on to show that the inflation of a geometric grid class by a strongly rational class is well partially ordered, and that all its subclasses have rational generating functions. This latter fact allows us to conclude that every permutation class with growth rate less than κ has a rational generating function. This bound is tight as there are permutation classes with growth rate κ which have nonrational generating functions.PostprintPeer reviewe
The enumeration of permutations avoiding 2143 and 4231
We enumerate the pattern class Av(2143, 4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes
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
On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia
We construct a sequence of finite automata that accept subclasses of the
class of 4231-avoiding permutations. We thereby show that the Wilf-Stanley
limit for the class of 4231-avoiding permutations is bounded below by 9.35.
This bound shows that this class has the largest such limit among all classes
of permutations avoiding a single permutation of length 4 and refutes the
conjecture that the Wilf-Stanley limit of a class of permutations avoiding a
single permutation of length k cannot exceed (k-1)^2.Comment: Submitted to Advances in Applied Mathematic
- …