The solution of a conjecture of Stanley and Wilf for all layered patterns

DOI10.1006/jcta.1998.2908zbMath0919.05002OpenAlexW2171905396WikidataQ123366307 ScholiaQ123366307MaRDI QIDQ1279660

Miklós Bóna

Publication date: 31 August 1999

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

Full work available at URL: https://doi.org/10.1006/jcta.1998.2908

zbMATH Keywords

patternnumber of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

A simple proof for the exponential upper bound for some tenacious patterns ⋮ Excluded permutation matrices and the Stanley-Wilf conjecture ⋮ Sorting with networks of data structures ⋮ The number of inversions of permutations with fixed shape ⋮ On the number of permutations avoiding a given pattern ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations ⋮ Counting permutations by their rigid patterns ⋮ Restricted 132-avoiding permutations ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ Finite automata and pattern avoidance in words ⋮ Quasirandom permutations ⋮ Shape avoiding permutations ⋮ A new class of Wilf-equivalent permutations

Cites Work

• Pattern matching for permutations
• Forbidden subsequences
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Asymptotic values for degrees associated with strips of Young diagrams
• Wilf-equivalence for singleton classes
• Restricted permutations