Permutation class

In the study of permutations and permutation patterns, a permutation class is a set $$C$$ of permutations for which every pattern within a permutation in $$C$$ is also in $$C$$. In other words, a permutation class is a hereditary property of permutations, or a downset in the permutation pattern order. A permutation class may also be known as a pattern class, closed class, or simply class of permutations.

Every permutation class can be defined by the minimal permutations which do not lie inside it, its basis. A principal permutation class is a class whose basis consists of only a single permutation. Thus, for instance, the stack-sortable permutations form a principal permutation class, defined by the forbidden pattern 231. However, some other permutation classes have bases with more than one pattern or even with infinitely many patterns.

A permutation class that does not include all permutations is called proper. In the late 1980s, Richard Stanley and Herbert Wilf conjectured that for every proper permutation class $$C$$, there is some constant $$K$$ such that the number $$|C_n|$$ of length-$$n$$ permutations in the class is upper bounded by $$K^n$$. This was known as the Stanley–Wilf conjecture until it was proved by Adam Marcus and Gábor Tardos. However although the limit
 * $$\lim_{n\to\infty} |C_n|^{1/n}$$

(a tight bound on the base of the exponential growth rate) exists for all principal permutation classes, it is open whether it exists for all other permutation classes.

Two permutation classes are called Wilf equivalent if, for every $$n$$, both have the same number of permutations of length $$n$$. Wilf equivalence is an equivalence relation and its equivalence classes are called Wilf classes. They are the combinatorial classes of permutation classes. The counting functions and Wilf equivalences among many specific permutation classes are known.