The solution of a conjecture of Stanley and Wilf for all layered patterns
From MaRDI portal
Publication:1279660
DOI10.1006/JCTA.1998.2908zbMATH Open0919.05002OpenAlexW2171905396WikidataQ123366307 ScholiaQ123366307MaRDI QIDQ1279660FDOQ1279660
Authors: 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
Recommendations
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Bounds on superpatterns containing all layered permutations
- On Stanley-Wilf limit of the pattern 1324
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
- scientific article; zbMATH DE number 7058698
- Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
- Some Wilf-equivalences for vincular patterns
- Schubert polynomials, 132-patterns, and Stanley's conjecture
- Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
Cites Work
- Restricted permutations
- Asymptotic values for degrees associated with strips of Young diagrams
- Pattern matching for permutations
- Forbidden subsequences
- Wilf-equivalence for singleton classes
- 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
Cited In (22)
- Strongly sublinear algorithms for testing pattern freeness
- Counting permutations by their rigid patterns
- Restricted 132-avoiding permutations
- A new class of Wilf-equivalent permutations
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Quasirandom permutations
- Sorting with networks of data structures
- Large deviations and ratio limit theorems for pattern-avoiding permutations
- The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Asymptotic enumeration of permutations avoiding generalized patterns
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Shape-Wilf-ordering on permutations of length 3
- New records in Stanley-Wilf limits
- Finite automata and pattern avoidance in words
- Universal layered permutations
- A relation on 132-avoiding permutation patterns
- The number of inversions of permutations with fixed shape
- New Wilf-equivalence results for vincular patterns
- A simple proof for the exponential upper bound for some tenacious patterns
- On the number of permutations avoiding a given pattern
- Shape avoiding permutations
This page was built for publication: The solution of a conjecture of Stanley and Wilf for all layered patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279660)
