Inflations of geometric grid classes of permutations

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.

[1]  M. Klazar.  Permutation Patterns: Some general results in combinatorial enumeration , 2010 .

[2]  Vincent Vatter.  PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188 , 2010 .

[3]  L. H. Haines.  On free monoids partially ordered by embedding , 1969 .

[4]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[5]  Robert Morris,et al.  Hereditary Properties of Ordered Graphs , 2006 .

[6]  Robert Brignall.  Wreath Products of Permutation Classes , 2007, Electron. J. Comb..

[7]  M. Atkinson,et al.  Geometric grid classes of permutations , 2011, 1108.6319.

[8]  Martin Klazar,et al.  Overview of some general results in combinatorial enumeration , 2008, 0803.4292.

[9]  Mike D. Atkinson,et al.  Simple permutations and pattern restricted permutations , 2005, Discret. Math..

[10]  Murray Elder,et al.  Problems and conjectures presented at the Third International Conference on Permutation Patterns (University of Florida, March 7-11, 2005) , 2005 .

[11]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[12]  M. Albert,et al.  Subclasses of the separable permutations , 2010, 1007.1014.

[13]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[14]  Jens Gustedt,et al.  Finiteness Theorems for Graphs and Posets Obtained by Compositions , 1998 .

[15]  C. Nash-Williams.  On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Vincent Vatter.  Small permutation classes , 2007, 0712.4006.

[17]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[18]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[19]  Robert Brignall,et al.  Simple permutations and algebraic generating functions , 2006, J. Comb. Theory A.

[20]  Vincent Vatter,et al.  Grid Classes and the Fibonacci Dichotomy for Restricted Permutations , 2006, Electron. J. Comb..

[21]  William T. Trotter,et al.  Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures , 1993, Discret. Math..

[22]  Nikola Ruskuc,et al.  Regular closed sets of permutations , 2003, Theor. Comput. Sci..

[23]  M. H. ALBERT,et al.  Growing at a Perfect Speed , 2009, Comb. Probab. Comput..

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[25]  Vaughan R. Pratt,et al.  Computing permutations with double-ended queues, parallel stacks and parallel queues , 1973, STOC.

[26]  D. Zeilberger,et al.  The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns , 1996, math/9808080.

[27]  Gábor Tardos,et al.  Excluded permutation matrices and the Stanley-Wilf conjecture , 2004, J. Comb. Theory, Ser. A.