Restricted permutations and Chebyshev polynomials

zbMATH Open1022.05005arXivmath/0011127MaRDI QIDQ1865534FDOQ1865534

Alek Vainshtein, Toufik Mansour

Publication date: 7 July 2003

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: We study generating functions for the number of permutations in $S{S}_n$ subject to two restrictions. One of the restrictions belongs to $S{S}_3$, while the other to $S{S}_k$. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.

Full work available at URL: https://arxiv.org/abs/math/0011127

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Restricted even permutations and Chebyshev polynomials
• Restricted colored permutations and Chebyshev polynomials
• Restricted 132-alternating permutations and Chebyshev polynomials
• Layered restrictions and Chebyshev polynomials
• Restricted permutations, continued fractions, and Chebyshev polynomials

zbMATH Keywords

generating functionsnumber of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Continued fractions; complex-analytic aspects (30B70) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Cited In (27)

• Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
• Counting water cells in bargraphs of compositions and set partitions
• Variations of the Catalan numbers from some nonassociative binary operations
• Layered restrictions and Chebyshev polynomials
• Locally convex words and permutations
• The generalized lucky ticket problem, perfect matchings, and closure relations satisfied by the Chebyshev and \(q\)-Hermite polynomials
• Enumeration formulæ for pattern restricted Stirling permutations
• Semi-perimeter and inner site-perimeter of k-ary words and bargraphs
• Dyck paths and restricted permutations
• Restricted 132-alternating permutations and Chebyshev polynomials
• Bivariate generating functions for involutions restricted by 3412
• Simple permutations and pattern restricted permutations
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
• On the diagram of 132-avoiding permutations
• A general theory of Wilf-equivalence for Catalan structures
• Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• New equivalences for pattern avoiding involutions
• Smooth partitions and Chebyshev polynomials
• Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
• Restricted even permutations and Chebyshev polynomials
• Kernel method and linear recurrence system
• Title not available (Why is that?)
• Restricted Dumont permutations, Dyck paths, and noncrossing partitions
• Patterns in Random Permutations Avoiding the Pattern 132
• Restricted colored permutations and Chebyshev polynomials
• Title not available (Why is that?)

This page was built for publication: Restricted permutations and Chebyshev polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865534)