Asymptotic bounds for permutations containing many different patterns

DOI10.1016/j.jcta.2008.04.007zbMath1177.05012DBLPjournals/jct/Miller09OpenAlexW2094393342WikidataQ29395589 ScholiaQ29395589MaRDI QIDQ1003625

Alison Beth Miller

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.04.007

zbMATH Keywords

permutationspatternsasymptotic enumerationssuper-patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (14)

Waiting time distribution for the emergence of superpatterns ⋮ Patterns in colored circular permutations ⋮ Universal layered permutations ⋮ Prolific permutations and permuted packings: downsets containing many large patterns ⋮ Supertrees ⋮ Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ The maximal length of a \(k\)-separator permutation ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ An asymptotically tight lower bound for superpatterns with small alphabets ⋮ Containing All Permutations ⋮ Universality of random permutations ⋮ Lower bounds for superpatterns and universal sequences ⋮ Unnamed Item ⋮ Bounds on superpatterns containing all layered permutations

Cites Work

• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• An answer to a question by Wilf on packing distinct patterns in a permutation
• Permutations containing many patterns
• Dense packing of patterns in a permutation

This page was built for publication: Asymptotic bounds for permutations containing many different patterns