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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:47, 5 March 2024

scientific article
Language Label Description Also known as
English
The solution of a conjecture of Stanley and Wilf for all layered patterns
scientific article

    Statements

    The solution of a conjecture of Stanley and Wilf for all layered patterns (English)
    0 references
    0 references
    31 August 1999
    0 references
    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).
    0 references
    number of permutations
    0 references
    pattern
    0 references

    Identifiers