Restricted 132-alternating permutations and Chebyshev polynomials

DOI10.1007/S00026-003-0182-2MaRDI QIDQ1407500zbMATH OpenOpenAlexFDO

Authors Toufik Mansour

Publication date 16 September 2003

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

generating function

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)

Abstract: A permutation is said to be emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on $k$ letters. In several interesting cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind.

Recommendations

• Restricted even permutations and Chebyshev polynomials
• Restricted permutations and Chebyshev polynomials
• Restricted 1-3-2 permutations and generalized patterns
• scientific article; zbMATH DE number 2127715
• Restricted permutations, continued fractions, and Chebyshev polynomials

Cited in

(23)

• Some statistics on restricted 132 involutions
• Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
• Restricted even permutations and Chebyshev polynomials
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• Restricted simsun permutations
• Noncrossing arc diagrams and canonical join representations
• On refinements of Wilf-equivalence for involutions
• Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
• Pattern-avoiding alternating words
• Consecutive up-down patterns in up-down permutations
• The generalized lucky ticket problem, perfect matchings, and closure relations satisfied by the Chebyshev and \(q\)-Hermite polynomials
• Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
• Restricted colored permutations and Chebyshev polynomials
• On pattern avoiding alternating permutations
• Sign-balance identities of Adin-Roichman type on 321-avoiding alternating permutations
• scientific article; zbMATH DE number 2127715 (Why is no real title available?)
• \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon
• Restricted permutations and Chebyshev polynomials
• Restricted \(123\)-involutions
• Decomposing simple permutations, with enumerative consequences
• Simple permutations and algebraic generating functions
• Layered restrictions and Chebyshev polynomials
• Pattern avoidance for alternating permutations and Young tableaux

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

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