An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations (Q1999742): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Forbidden patterns and shift systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic permutations realized by signed shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Permutations Realized By a Shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations and \(\beta \)-shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cyclic structure of unimodal permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting permutations with given cycle structure and descent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cycle enumerator of unimodal permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797922 / rank
 
Normal rank

Latest revision as of 17:59, 19 July 2024

scientific article
Language Label Description Also known as
English
An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
scientific article

    Statements

    An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations (English)
    0 references
    0 references
    27 June 2019
    0 references
    pattern avoidance
    0 references
    cyclic permutation
    0 references

    Identifiers