Restricted colored permutations and Chebyshev polynomials
From MaRDI portal
Publication:879394
DOI10.1016/j.disc.2006.09.027zbMath1116.05002OpenAlexW2136792611MaRDI QIDQ879394
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.027
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Continued fractions; complex-analytic aspects (30B70)
Related Items (5)
Impulse parameter and a new equivalence between 123- and 132-avoiding permutations ⋮ Generalized pattern-matching conditions for \(C_k \wr S_n\) ⋮ Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups ⋮ Inversion generating functions for signed pattern avoiding permutations ⋮ Restricted signed permutations counted by the Schröder numbers
Cites Work
- Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
- Forbidden subsequences and Chebyshev polynomials
- Prefix exchanging and pattern avoidance by involutions
- Avoiding 2-letter signed patterns
- Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
- On the diagram of Schröder permutations
- Restricted permutations and Chebyshev polynomials
- Generating trees and the Catalan and Schröder numbers
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Permutations with forbidden subsequences and a generalized Schröder number
- Restricted signed permutations counted by the Schröder numbers
- Restricted 132-avoiding permutations
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
- Pattern avoidance in coloured permutations
- Permutations with restricted patterns and Dyck paths
This page was built for publication: Restricted colored permutations and Chebyshev polynomials
