Enumerations Of Specific Permutation Classes

In the study of permutation patterns, there has been considerable interest in enumerating specific permutation classes, especially those with relatively few basis elements. This area of study has turned up unexpected instances of Wilf equivalence, where two seemingly-unrelated permutation classes have the same numbers of permutations of each length.

Classes avoiding one pattern of length 3

There are two symmetry classes and a single Wilf class for single permutations of length three.

Classes avoiding one pattern of length 4

There are seven symmetry classes and three Wilf classes for single permutations of length four.

No non-recursive formula counting 1324-avoiding permutations is known. A recursive formula was given by .
A more efficient algorithm using functional equations was given by , which was enhanced by , and then further enhanced by who give the first 50 terms of the enumeration.
have provided lower and upper bounds for the growth of this class.

Classes avoiding two patterns of length 3

There are five symmetry classes and three Wilf classes, all of which were enumerated in .

Classes avoiding one pattern of length 3 and one of length 4

There are eighteen symmetry classes and nine Wilf classes, all of which have been enumerated. For these results, see or .

Classes avoiding two patterns of length 4

There are 56 symmetry classes and 38 Wilf equivalence classes. Only 3 of these remain unenumerated, and their generating functions are conjectured not to satisfy any algebraic differential equation (ADE) by ; in particular, their conjecture would imply that these generating functions are not D-finite.

Heatmaps of each of the non-finite classes are shown on the right. The lexicographically minimal symmetry is used for each class, and the classes are ordered in lexicographical order. To create each heatmap 1,000,000 permutations of length 300 are sampled uniformly at random from the class. The color of the point $(i,j)$ represents how many permutations have value $j$ at index $i$. Higher resolution versions can be obtained o
PermPal

External links

Th

maintained by Bridget Tenner, contains details of the enumeration of many other permutation classes with relatively few basis elements.

See also

* Baxter permutation
* Riffle shuffle permutation

References

*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
*.
* .
*.
*.
*.
*.
* .
*.
*.
*.
*.
*.
*.
*{{Citation
, last1=West , first1=Julian
, title=Generating trees and forbidden subsequences
, year=1996
, journal=Discrete Mathematics
, volume=157
, issue=1–3
, pages=363–374
, mr=1417303
, doi=10.1016/S0012-365X(96)83023-8, doi-access=free
.

Enumerative combinatorics
Permutation patterns