On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
From MaRDI portal
Publication:1305174
zbMath0922.05002MaRDI QIDQ1305174
Publication date: 3 October 1999
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119939
Related Items (42)
Bounded affine permutations. II: Avoidance of decreasing patterns ⋮ Locally convex words and permutations ⋮ Waiting time distribution for the emergence of superpatterns ⋮ Longest alternating subsequences of permutations ⋮ Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ New records in Stanley-Wilf limits ⋮ Excluded permutation matrices and the Stanley-Wilf conjecture ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ Supertrees ⋮ Growth rates of permutation classes: categorization up to the uncountability threshold ⋮ Using functional equations to enumerate 1324-avoiding permutations ⋮ The maximal length of a \(k\)-separator permutation ⋮ Staircases, dominoes, and the growth rate of 1324-avoiders ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ An asymptotically tight lower bound for superpatterns with small alphabets ⋮ Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns ⋮ Unnamed Item ⋮ Permutations generated by stacks and deques ⋮ Containing All Permutations ⋮ Universality of random permutations ⋮ Universal arrays ⋮ Bounded affine permutations I. Pattern avoidance and enumeration ⋮ Large deviations for permutations avoiding monotone patterns ⋮ Preferential arrangement superpatterns ⋮ Generating permutations with restricted containers ⋮ On the growth of merges and staircases of permutation classes ⋮ On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns ⋮ Finite automata and pattern avoidance in words ⋮ Avoiding consecutive patterns in permutations ⋮ Some results on superpatterns for preferential arrangements ⋮ Lower bounds for superpatterns and universal sequences ⋮ Asymptotic bounds for permutations containing many different patterns ⋮ On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture ⋮ On Stanley-Wilf limit of the pattern 1324 ⋮ Unnamed Item ⋮ A new record for \(1324\)-avoiding permutations ⋮ On the centrosymmetric permutations in a class ⋮ Shape avoiding permutations ⋮ Bounds on superpatterns containing all layered permutations
This page was built for publication: On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
