arXiv (All)
open access
Permutation classes need not have proper growth rates
By the Marcus-Tardos Theorem (formerly the Stanley-Wilf Conjecture), every permutation class other than the class of all permutations has a finite upper growth rate, meaning that the $n$th root of the number of permutations of length $n$ in the class has a finite limit superior. It has long been con
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On a conjecture concerning two-stack sortable permutations#1413356
- Conjugating full cycles by adjacent transpositions: diameter and sorting time#925898
- Correcting Burst Errors with Applications to DNA-Based Data Storage#1326951
- Distribution of the inversion statistic on run-sorted permutations#1076330
- Descent generating polynomials for ($n-3$)- and ($n-4$)-stack-sortable (pattern-avoiding) permutations#1082938
Record · ID 1423161
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive