Restricted 132-avoiding permutations (Q5933473): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutation classes equinumerous to the smooth class / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of a conjecture of Stanley and Wilf for all layered patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subsequences and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations with restricted patterns and Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations with forbidden subsequences and a generalized Schröder number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations, continued fractions, and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered restrictions and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation patterns and continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and forbidden subsequences / rank
 
Normal rank

Latest revision as of 17:17, 3 June 2024

scientific article; zbMATH DE number 1599092
Language Label Description Also known as
English
Restricted 132-avoiding permutations
scientific article; zbMATH DE number 1599092

    Statements

    Restricted 132-avoiding permutations (English)
    0 references
    0 references
    0 references
    8 April 2002
    0 references
    For any positive integer \(n\), let \(S_n\) be the set of all permutations on \(n\) letters. Further let \(S_n(\alpha)\) denote the set of all \(\alpha\)-avoiding permutations in \(S_n\). In this paper the authors consider the generating function for \(|S_n(132)|\).
    0 references
    0 references
    0 references
    permutations
    0 references
    generating function
    0 references
    0 references
    0 references