It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open problem. Given a 0/+-1 matrix M, we define a closed set of permutations called the profile class of M. These sets are generalizations of sets considered by Atkinson, Murphy, and Ruskuc. We show that the profile class of M is partially well-ordered if and only if a related graph is a forest. Related to the antichains we construct to prove one of the directions of this result, we construct exotic fundamental antichains, which lack the periodicity exhibited by all previously known fundamental antichains of permutations.
We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly concern ourselves with the problem of whether permutation classes can be composed from their proper subclasses. We provide examples of classes which can be composed from two proper subclasses, classes which can be composed from three but not from two proper subclasses and classes which cannot be composed from any finite number of proper subclasses.
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 …
A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate than non-deflatable ones. Some theorems which guarantee non-deflatability are proved and examples of both deflatable and non-deflatable principal classes are given.
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.
This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded submatrices) and we discuss how canonical such a description by submatrix-avoidance can be. We provide numerous examples of permutation and polyomino classes which may be defined and studied from the submatrix-avoidance point of view, and conclude with various directions for future research on this topic.
We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing a long sum of 21s.
We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.
A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid classes by establishing a bijective relationship with certain necklaces. We use this method to complete the enumeration of cyclic permutations in the length 3 vector grid classes. In addition, we define an analog of Wilf-equivalence between these sets. We conclude by discussing cyclic permutations in alternating grid classes.
We complete the proof of the fact that all principal permutation classes generated by a pattern longer than two have a nonrational generating function.
A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X \wr Y of two permutation classes X and Y is also closed, and we investigate classes Y with the property that, for any finitely based class X, the wreath product X \wr Y is also finitely based.
There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation classes, we provide sufficient conditions for this upper bound to be achieved. In particular, our results apply to all merges of principal permutation classes. We end by demonstrating how our techniques can be used to reprove a result of Bóna.
A monotone grid class is a permutation class (i.e., a downset of permutations under the containment order) defined by local monotonicity conditions. We give a simplified proof of a result of Murphy and Vatter that monotone grid classes of forests are partially well-ordered.
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
We consider permutation classes having two basis elements of size three and one further basis element. We completely classify the possible enumeration sequences of such classes and demonstrate that there are far fewer of them than might be expected in principle.
When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length $n$ patterns in the separable permutations is equal to the number of partitions of $n-1$.
We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding is regular. This algorithm is implemented in the accompanying Maple package INSENC, which can automatically compute the rational generating functions for such classes.
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue of all such sets of forbidden permutations having three or fewer elements is provided together with bounds on the degrees of the associated enumerating polynomials.
We establish that there is an algebraic number $ξ\approx 2.30522$ such that while there are uncountably many growth rates of permutation classes arbitrarily close to $ξ,$ there are only countably many less than $ξ$. Central to the proof are various structural notions regarding generalized grid classes and a new property of permutation classes called concentration. The classification of growth rates up to $ξ$ is completed in a subsequent paper.
We prove that there are permutation classes (hereditary properties of permutations) of every growth rate (Stanley-Wilf limit) at least λ\approx 2.48187, the unique real root of x^5-2x^4-2x^2-2x-1, thereby establishing a conjecture of Albert and Linton.
This paper enumerates all juxtaposition classes of the form "Av($abc$) next to Av($xy$)", where $abc$ is a permutation of length three and $xy$ is a permutation of length two. We use Dyck paths decorated by sequences of points to represent elements from such a juxtaposition class. Context-free grammars are then used to enumerate these decorated Dyck paths.
We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also allows us to compute the diameter of the commutation graph for any permutation, from which the results for the longest permutation and for fully commutative permutations are recovered.
We explore a new type of replacement of patterns in permutations, suggested by James Propp, that does not preserve the length of permutations. In particular, we focus on replacements between 123 and a pattern of two integer elements. We apply these replacements in the classical sense; that is, the elements being replaced need not be adjacent in position or value. Given each replacement, the set of all permutations is partitioned into equivalence classes consisting of permutations reachable from one another through a series of bi-directional replacements. We break the eighteen replacements of i…
We study the structure and enumeration of the final two 2x4 permutation classes, completing a research program that has spanned almost two decades. For both classes, careful structural analysis produces a complicated functional equation. One of these equations is solved with the guess-and-check paradigm, while the other is solved with kernel method-like techniques and Gröbner basis calculations.
We characterise those classes of permutations having the property that for every tableau shape either every permutation of that shape or no permutation of that shape belongs to the class. The characterisation is in terms of the dominance order for partitions (and their conjugates) and shows that for any such class there is a constant k such that no permutation in the class can contain both an increasing and a decreasing sequence of length k.
Given a permutation pattern p and an equivalence relation on permutations, we study the corresponding equivalence classes all of whose members avoid p. Four relations are studied: Conjugacy, order isomorphism, Knuth-equivalence and toric equivalence. Each of these produces a known class of permutations or a known counting sequence. For example, involutions correspond to conjugacy, and permutations whose insertion tableau is hook-shaped with 2 in the first row correspond to Knuth-equivalence. These permutations are equinumerous with certain congruence classes of graph endomorphisms. In the case…
For a hereditary permutation class $\mathcal{C}$, we say that two permutations $π$ and $σ$ of $\mathcal{C}$ are Wilf-equivalent in $\mathcal{C}$, if $\mathcal{C}$ has the same number of permutations avoiding $π$ as those avoiding $σ$. We say that a permutation class $\mathcal{C}$ exhibits a Wilf collapse if the number of permutations of size $n$ in $\mathcal{C}$ is asymptotically larger than the number of Wilf-equivalence classes formed by these permutations. In this paper, we show that Wilf collapse is a surprisingly common phenomenon. Among other results, we show that Wilf collapse occurs in…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an enumeration. The algorithm is successful on different inputs than other algorithms and can succeed with any polynomial permutation class. We apply it to every non-polynomial permutation class avoiding a set of length four patterns. The structures found by the algorithm can sometimes allow an enumeration of the permutation class with respect to permutation statistics…
We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234,2341} and {1243,2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted source graphs, we determine their algebraic generating functions. Our approach is similar to that of "adding a slice", used previously to enumerate various classes of polyominoes and other combinatorial structures. To solve the relevant functional equations, we make extensive use of the kernel method.
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by rational generating functions.
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 prove that such classes are specified by finite sets of forbidden permutations, are partially well ordered, and have rational generating functions. Furthermore, we show that these properties are inherited by the subclasses (under permutation involvement) of such classes, and establish the basic lattice theoretic properties of the collection of all such sub…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of their respective classes of objects. We prove that these notions are equivalent in the sense that a permutation class is geometrically griddable if and only if the corresponding class of inversion graphs has bounded lettericity.
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations of length n which can be obtained by a finite number of block sorting operations (e.g., reversals, block transpositions, cut-and-paste moves).
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to their diagrams on the grid $[n]^d$ in which there is exactly one point per hyperplane $x_i=j$ for $i\in[d]$ and $j\in[n]$. We first investigate exhaustively all small pattern avoiding classes. We provide some bijection to enumerate some of these classes and we propose some conjectures for others. We then give a generalization of well-studied Baxter permutation…
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 $κ\approx2.20557$ (a specific algebraic integer at which infinite antichains begin to appear). Using language- and order-theoretic methods, we prove that the substitution closures of geometric grid classes are partially well-ordered, finitely based, and that all their subclasses have algebraic generating functions. We …
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 grid class has a growth rate which is given by the square of the largest root of the matching polynomial of a related graph. As a consequence, we characterise the set of growth rates of geometric grid classes in terms of the spectral radii of trees, explore the influence of "cycle parity" on the growth rate, compare the growth rates of geometric grid classes ag…
This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is achieved considering both pattern avoidance and pattern containment constraints in permutations.The obtained specification yields a system of equations satisfied by the generating function of C, this system being always positiveand algebraic. It also yields a uniform random sampler of permutations in C. The method presentedis fully algorithmic.
We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a bijection that allows us to determine some notable features of these permutations, such as the distribution of the statistics "number of ascents", "number of left-to-right maxima", "first element", and "position of the maximum element"
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one can be obtained from the other by a sequence of pattern-replacing moves of prescribed form; however, we limit our focus to patterns where two elements are transposed, subject to the constraint that a third element of a suitable type be in a suitable position. For various instances of the problem, we compute the number of equivalence classes, determine how man…
The maximally clustered permutations are characterized by avoiding the classical permutation patterns 3421, 4312, and 4321. This class contains the freely-braided permutations and the fully-commutative permutations. In this work, we show that the generating functions for certain fully-commutative pattern classes can be transformed to give generating functions for the corresponding freely-braided and maximally clustered pattern classes. Moreover, this transformation of generating functions is rational. As a result, we obtain enumerative formulas for the pattern classes mentioned above as well a…
In the antecedent paper to this it was established that there is an algebraic number $ξ\approx 2.30522$ such that while there are uncountably many growth rates of permutation classes arbitrarily close to $ξ$, there are only countably many less than $ξ$. Here we provide a complete characterization of the growth rates less than $ξ$. In particular, this classification establishes that $ξ$ is the least accumulation point from above of growth rates and that all growth rates less than or equal to $ξ$ are achieved by finitely based classes. A significant part of this classification is achieved via a …
Bevan established that the growth rate of a monotone grid class of permutations is equal to the square of the spectral radius of a related bipartite graph. We give an elementary and self-contained proof of a generalization of this result using only Stirling's Formula, the method of Lagrange multipliers, and the singular value decomposition of matrices.
While the theory of labelled well-quasi-order has received significant attention in the graph setting, it has not yet been considered in the context of permutation patterns. We initiate this study here, and show how labelled well quasi order provides a lens through which to view and extend previous well-quasi-order results in the permutation patterns literature. Connections to the graph setting are emphasised throughout. In particular, we establish that a permutation class is labelled well-quasi-ordered if and only if its corresponding graph class is also labelled well-quasi-ordered.
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permutations leads to the first truly structural enumeration of this class as a whole. The extension of this method to a wider collection of classes namely grid classes of infinite paths is discussed.
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 function of any class whose matrix has dimensions $m \times 1$ for some $m$, and of acyclic and unicyclic classes of gridded permutations. We show that almost all large permutations in a grid class have the same shape, and determine this limit shape. We prove that the growth rate of a grid class is given by the square of the spectral radius of an associated…
Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets and multisets, based on geometric grid classes and the product operation. Our approach produces many new instances of Schur-positive sets, and provides a broad framework that explains the existence of known such sets that until now were sporadic cases.
We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux that preserves the cyclic descent set. Cyclic Schur-positive sets of permutations are always Schur-positive, but the converse does not hold, as exemplified by inverse descent classes, Knuth classes and conjugacy classes. In this paper we show that certain classes of permutations invariant under either horizontal or vertical rotation are cyclic Schur-positive. T…
Super-strong (elsewhere referred to as strong) Wilf equivalence is a type of Wilf equivalence on words that was introduced by Kitaev et al. in 2009. We provide a necessary and sufficient condition for two permutations in $n$ letters to be super-strongly Wilf equivalent, using distances between letters within a permutation. Furthermore, we give a characterization of such equivalence classes via two-colored binary trees. This allows us to prove, in the case of super-strong Wilf equivalence, the conjecture stated in (Kitaev et al., 2009) that the cardinality of each Wilf equivalence class is a po…
We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.
For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i and j, we give enumerative formulas for the cardinality of the set of permutations sigma in S_n with maj(sigma) congruent to i mod k and maj(sigma^(-1)) congruent to j mod m. When m divides n-1 and k divides n, we show that for all i,j, this cardinality equals (n!)/(km).
We prove that for any fixed $n$, and for most permutation patterns $q$, the number $\textup{Av}_{n,\ell}(q)$ of $q$-avoiding permutations of length $n$ that consist of $\ell$ skew blocks is a monotone decreasing function of $\ell$. We then show that this implies that for most patterns $q$, the generating function $\sum_{n\geq 0} \textup{Av}_n(q)z^n$ of the sequence $\textup{Av}_n(q)$ of the numbers of $q$-avoiding permutations is not rational. Placing our results in a broader context, we show that for rational power series $F(z)$ and $G(z)$ with nonnegative real coefficients, the relation $F(z…
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schröder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray…
