Stanley–Wilf conjecture
The Stanley–Wilf conjecture, formulated independently by Richard P. Stanley and Herbert Wilf in the late 1980s, states that the growth rate of every proper permutation class is singly exponential. It was proved by Adam Marcus and Gábor Tardos (2004) and is no longer a conjecture. Marcus and Tardos actually proved a different conjecture, due to Zoltán Füredi and Péter Hajnal (1992), which had been shown to imply the Stanley–Wilf conjecture by (Klazar 2000).
Statement
The Stanley–Wilf conjecture states that for every permutation β, there is a constant C such that the number |Sn(β)| of permutations of length n which avoid β as a permutation pattern is at most Cn. As (Arratia 1999) observed, this is equivalent to the convergence of the limit
- [math]\displaystyle{ \lim_{n\to\infty} \sqrt[n]{|S_n(\beta)|}. }[/math]
The upper bound given by Marcus and Tardos for C is exponential in the length of β. A stronger conjecture of (Arratia 1999) had stated that one could take C to be (k − 1)2, where k denotes the length of β, but this conjecture was disproved for the permutation β = 4231 by (Albert Elder). Indeed, (Fox 2013) has shown that C is, in fact, exponential in k for almost all permutations.
Allowable growth rates
The growth rate (or Stanley–Wilf limit) of a permutation class is defined as
- [math]\displaystyle{ \limsup_{n\to\infty} \sqrt[n]{a_n}, }[/math]
where an denotes the number of permutations of length n in the class. Clearly not every positive real number can be a growth rate of a permutation class, regardless of whether it is defined by a single forbidden pattern or a set of forbidden patterns. For example, numbers strictly between 0 and 1 cannot be growth rates of permutation classes.
(Kaiser Klazar) proved that if the number of permutations in a class of length n is ever less than the nth Fibonacci number then the enumeration of the class is eventually polynomial. Therefore, numbers strictly between 1 and the golden ratio also cannot be growth rates of permutation classes. Kaiser and Klazar went on to establish every possible growth constant of a permutation class below 2; these are the largest real roots of the polynomials
- [math]\displaystyle{ x^{k+1}-2x^k+1 }[/math]
for an integer k ≥ 2. This shows that 2 is the least accumulation point of growth rates of permutation classes.
(Vatter 2011) later extended the characterization of growth rates of permutation classes up to a specific algebraic number κ≈2.20. From this characterization, it follows that κ is the least accumulation point of accumulation points of growth rates and that all growth rates up to κ are algebraic numbers. (Vatter 2019) established that there is an algebraic number ξ≈2.31 such that there are uncountably many growth rates in every neighborhood of ξ, but only countably many growth rates below it. (Pantone Vatter) characterized the (countably many) growth rates below ξ, all of which are also algebraic numbers. Their results also imply that in the set of all growth rates of permutation classes, ξ is the least accumulation point from above.
In the other direction, (Vatter 2010) proved that every real number at least 2.49 is the growth rate of a permutation class. That result was later improved by (Bevan 2018), who proved that every real number at least 2.36 is the growth rate of a permutation class.
See also
- Enumerations of specific permutation classes for the growth rates of specific permutation classes.
Notes
References
- Albert, Michael H.; Elder, Murray; Rechnitzer, Andrew; Westcott, P.; Zabrocki, Mike (2006), "On the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia", Advances in Applied Mathematics 36 (2): 96–105, doi:10.1016/j.aam.2005.05.007.
- Arratia, Richard (1999), "On the Stanley–Wilf conjecture for the number of permutations avoiding a given pattern", Electronic Journal of Combinatorics 6: N1, doi:10.37236/1477, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v6i1n1.
- "Intervals of permutation class growth rates", Combinatorica 38 (2): 279–303, 2018, doi:10.1007/s00493-016-3349-2, Bibcode: 2014arXiv1410.3679B.
- Fox, Jacob (2013), Stanley–Wilf limits are typically exponential, Bibcode: 2013arXiv1310.8378F.
- Füredi, Zoltán; Hajnal, Péter (1992), "Davenport–Schinzel theory of matrices", Discrete Mathematics 103 (3): 233–251, doi:10.1016/0012-365X(92)90316-8.
- Kaiser, Tomáš; Klazar, Martin (March 2002), "On growth rates of closed permutation classes", Electronic Journal of Combinatorics 9 (2): Research paper 10, 20, http://www.combinatorics.org/Volume_9/Abstracts/v9i2r10.html.
- Klazar, Martin (2000), "The Füredi–Hajnal conjecture implies the Stanley–Wilf conjecture", Formal Power Series and Algebraic Combinatorics (Moscow, 2000), Springer, pp. 250–255.
- Klazar, Martin (2010), "Some general results in combinatorial enumeration", Permutation patterns, London Math. Soc. Lecture Note Ser., 376, Cambridge: Cambridge Univ. Press, pp. 3–40, doi:10.1017/CBO9780511902499.002.
- Marcus, Adam; Tardos, Gábor (2004), "Excluded permutation matrices and the Stanley–Wilf conjecture", Journal of Combinatorial Theory, Series A 107 (1): 153–160, doi:10.1016/j.jcta.2004.04.002.
- Pantone, Jay; Vatter, Vincent (2020), "Growth rates of permutation classes: categorization up to the uncountability threshold", Israel Journal of Mathematics 236 (1): 1–43, doi:10.1007/s11856-020-1964-5.
- Vatter, Vincent (2019), "Growth rates of permutation classes: from countable to uncountable", Proc. London Math. Soc., Series 3 119 (4): 960–997, doi:10.1112/plms.12250.
- Vatter, Vincent (2010), "Permutation classes of every growth rate above 2.48188", Mathematika 56 (1): 182–192, doi:10.1112/S0025579309000503.
- Vatter, Vincent (2011), "Small permutation classes", Proc. London Math. Soc., Series 3 103 (5): 879–921, doi:10.1112/plms/pdr017.
External links
- How Adam Marcus and Gabor Tardos divided and conquered the Stanley–Wilf conjecture – by Doron Zeilberger.
- Weisstein, Eric W.. "Stanley–Wilf conjecture". http://mathworld.wolfram.com/Stanley-WilfConjecture.html.
 |  |
