Related papers: Inflations of geometric grid classes of permutatio…
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
We enumerate three specific permutation classes defined by two forbidden patterns of length four. The techniques involve inflations of geometric grid 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…
We find the generating function for the class of all permutations that avoid the patterns 3124 and 4312 by showing that it is an inflation of the union of two geometric grid classes.
Geometric grid classes of permutations have proven to be key in investigations of classical permutation pattern classes. By considering the representation of gridded permutations as words in a trace monoid, we prove that every geometric…
We establish that there is an algebraic number $\xi\approx 2.30522$ such that while there are uncountably many growth rates of permutation classes arbitrarily close to $\xi,$ there are only countably many less than $\xi$. Central to the…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Pin sequences play an important role in the structural study of permutation classes. In this paper, we study the permutation classes that comprise all the finite subpermutations contained in an infinite pin sequence. We prove that these…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on…
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…
We prove that all subclasses of the separable permutations not containing Av(231) or a symmetry of this class have rational generating functions. Our principal tools are partial well-order, atomicity, and the theory of strongly rational…
Monotone grid classes of permutations have proven very effective in helping to determine structural and enumerative properties of classical permutation pattern classes. Associated with grid class $\mathrm{Grid}(M)$ is a graph, $G(M)$, known…
We prove that any class of permutations defined by avoiding a partially ordered pattern (POP) with height at most two has a regular insertion encoding and thus has a rational generating function. Then, we use Combinatorial Exploration to…
In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…
We study the geometry of a class of group extensions, containing permutational wreath products, which we call "permutational extensions". We construct for all natural number k a torsion group with growth function asymptotically…
We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…
Infinite antichains of permutations have long been used to construct interesting permutation classes and counterexamples. We prove the existence and detail the construction of infinite antichains with arbitrarily large growth rates. As a…