Proper growth-rate conjecture for permutation classes
Let be a proper permutation class, meaning a class of finite permutations closed under taking patterns and satisfying , where is the class of all finite permutations. Then the limit exists and is finite.
References
- Permutation classes need not have proper growth rates — arXiv — Jay Pantone, Vincent Vatter
Source: arXiv
Progress summary
An unrefereed preprint claims to have found a counterexample showing that the exponential growth rate of every proper permutation class need not converge.
The conjecture asserts that every proper permutation class has a convergent nth-root growth rate. No proposer or original date is identified in the retrieved sources.
Known results
- Kaiser and Klazar (2003) sharply restricted class speeds below , including a classification of possible values.
- Vatter characterized growth rates below , where is the positive root of .
- Below , every growth rate is achieved by a sum-closed class, although uncountably many occur arbitrarily near .
October 2026 claimed counterexample
Jay Pantone and Vincent Vatter’s preprint Permutation classes need not have proper growth rates claims a counterexample to universal convergence and an analogous ordered-graph result. The claim is unrefereed and has no independent mathematical assessment in the retrieved evidence.
Current status (as of October 2026): Universal convergence is claimed false by an unrefereed preprint, but the counterexample remains unverified, so the problem is not independently settled.
Solutions 0
No solutions have been posted yet.