The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660): Difference between revisions

Wilf and Stanley conjectured that the number of permutations in \(S_n\) that avoid a particular pattern, or subpermutation, \(q\) is less than \(c^n\), where \(c\) is a constant depending on \(q\). The author proves the result for patterns \(q\) of a particular special type (``layered'' patterns).