Restricted colored permutations and Chebyshev polynomials

DOI10.1016/J.DISC.2006.09.027MaRDI QIDQ879394zbMATH OpenOpenAlexFDO

Authors Eric S. Egge

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

zbMATH Keywords

forbidden subsequencepattern-avoiding involutionpattern-avoiding permutationrestricted involution

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)

Recommendations

• Restricted permutations and Chebyshev polynomials
• Restricted even permutations and Chebyshev polynomials
• Restricted permutations, continued fractions, and Chebyshev polynomials
• Restricted 132-alternating permutations and Chebyshev polynomials
• Binomial Eulerian polynomials for colored permutations
• Generalized Coloring of Permutations
• Partially 2-colored permutations and the Boros-Moll polynomials
• Multicolored permutations, sequences, and tableaux
• Combinatorics of certain restricted \(n\)-color composition functions
• Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity

Cites work

• Avoiding 2-letter signed patterns
• Forbidden subsequences and Chebyshev polynomials
• Generating trees and the Catalan and Schröder numbers
• On the diagram of Schröder permutations
• Pattern avoidance in coloured permutations
• Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
• Permutations with forbidden subsequences and a generalized Schröder number
• Permutations with restricted patterns and Dyck paths
• Prefix exchanging and pattern avoidance by involutions
• Restricted 132-avoiding permutations
• Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
• Restricted permutations and Chebyshev polynomials
• Restricted permutations, continued fractions, and Chebyshev polynomials
• Restricted signed permutations counted by the Schröder numbers
• The permutations 123p₄ p_m and 321p₄ p_m are Wilf-equivalent

Cited in

(12)

• Layered restrictions and Chebyshev polynomials
• Restricted permutations and Chebyshev polynomials
• Generalized pattern-matching conditions for C_k S_n
• Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups
• Binomial Eulerian polynomials for colored permutations
• Restricted signed permutations counted by the Schröder numbers
• Restricted even permutations and Chebyshev polynomials
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Impulse parameter and a new equivalence between 123- and 132-avoiding permutations
• Inversion generating functions for signed pattern avoiding permutations
• scientific article; zbMATH DE number 6750761 (Why is no real title available?)
• Enumerating polynomial colored permutation classes

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

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