Restricted 1-3-2 permutations and generalized patterns

DOI10.1007/S00026-002-8031-2MaRDI QIDQ1865117zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number of permutations on $n$ letters avoiding $1-3-2$ (or containing $1-3-2$ exactly once) and an arbitrary generalized pattern $au$ on $k$ letters, or containing $au$ exactly once. In several cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind, and generating function of Motzkin numbers.

Recommendations

• Permutations restricted by two distinct patterns of length three
• scientific article; zbMATH DE number 2192093
• Pattern-restricted permutations composed of 3-cycles
• Simple permutations and pattern restricted permutations
• On permutation pattern classes with two restrictions only
• Compositions of pattern restricted sets of permutations
• Enumeration of restricted permutation triples
• Refined restricted permutations avoiding subsets of patterns of length three
• Permutations with restricted patterns and Dyck paths
• scientific article; zbMATH DE number 3627190

Cited in

(26)

• Simple permutations and algebraic generating functions
• scientific article; zbMATH DE number 2192093 (Why is no real title available?)
• Refining enumeration schemes to count according to permutation statistics
• Counting occurrences of 132 in a permutation
• Some permutations with forbidden subsequences and their inversion number
• The 1-box pattern on pattern-avoiding permutations
• Continued fractions and generalized patterns
• Permutation patterns and continued fractions
• Restricted 123-avoiding Baxter permutations and the Padovan numbers
• Generalized Schröder permutations
• The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
• Generalized pattern avoidance with additional restrictions
• Words restricted by 3-letter generalized multipermutation patterns
• Introduction to partially ordered patterns
• Permutations, cycles and the pattern 2--13
• Modular Catalan numbers
• Continued fractions, statistics, and generalized patterns.
• Restricted 132-alternating permutations and Chebyshev polynomials
• Generalized pattern avoidance
• Pattern popularity in multiply restricted permutations
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• Counting pattern avoiding permutations by number of movable letters
• Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
• Generating trees for permutations avoiding generalized patterns
• Generalized pattern avoidance

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

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