Restricted 1-3-2 permutations and generalized patterns

DOI10.1007/s00026-002-8031-2zbMath1009.05002arXivmath/0110039OpenAlexW2057349364MaRDI QIDQ1865117

Toufik Mansour

Publication date: 25 March 2003

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

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

zbMATH Keywords

Chebyshev polynomialsrestricted permutationsgeneralized patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Related Items (9)

Introduction to partially ordered patterns ⋮ The equidistribution of some length-three vincular patterns on \(S_n(132)\) ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ Simple permutations and algebraic generating functions ⋮ The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Modular Catalan numbers ⋮ Counting pattern avoiding permutations by number of movable letters ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials

This page was built for publication: Restricted 1-3-2 permutations and generalized patterns