An asymptotically tight lower bound for superpatterns with small alphabets

DOI10.5070/c63261976zbMath1527.05007arXiv2108.05474OpenAlexW3189636368MaRDI QIDQ6179325

Zach Hunter

Publication date: 16 December 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.05474

zbMATH Keywords

permutationspatternsprobabalistic method

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Cites Work

• On a conjecture of H. Gupta
• Asymptotic bounds for permutations containing many different patterns
• A lower bound on the length of a sequence containing all permutations as subsequences
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Lower bounds for superpatterns and universal sequences
• Dense packing of patterns in a permutation
• The runsort permuton
• A result on large induced subgraphs with prescribed residues in bipartite graphs
• On permutation-generating strings and rosaries
• Containing All Permutations

This page was built for publication: An asymptotically tight lower bound for superpatterns with small alphabets