Permutations with restricted patterns and Dyck paths (Q5956779): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some combinatorial properties of Schubert polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subsequences and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial aspects of continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continued fractions and Catalan problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple random walk statistics. Part I: Discrete time results / 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: Q4871770 / 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: Combinatorial theory of \(\text{T}\)-fractions and two points Padé approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and the Catalan and Schröder numbers / rank
 
Normal rank

Latest revision as of 22:14, 3 June 2024

scientific article; zbMATH DE number 1713314
Language Label Description Also known as
English
Permutations with restricted patterns and Dyck paths
scientific article; zbMATH DE number 1713314

    Statements

    Permutations with restricted patterns and Dyck paths (English)
    0 references
    10 October 2002
    0 references
    The paper exhibits a bijection between 132-avoiding permutations and Dyck paths. Through this bijection the formula for the generating function for the number of 132-avoiding permutations with given number of occurrences of the pattern \(12\dots k\), and also an asymptotic formula for this number, follow from corresponding results on Motzkin paths. A bijection is given between 123-avoiding permutations and Dyck paths, and a continued fraction expression is given for the number of 123-avoiding permutations with given number of occurrences of the pattern \((k-1)(k-2)\dots 1k\).
    0 references
    Chebyshev polynomials
    0 references
    132-avoiding permutations
    0 references
    Dyck paths
    0 references
    Motzkin paths
    0 references
    continued fraction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references