Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three

DOI10.1016/S0196-8858(02)00501-8zbMath1020.05008arXivmath/0112092MaRDI QIDQ1408270

Markus Fulmek

Publication date: 15 September 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (13)

Decomposing simple permutations, with enumerative consequences ⋮ Chains of maximum length in the Tamari lattice ⋮ Bijections for refined restricted permutations ⋮ On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation ⋮ On the diagram of 132-avoiding permutations ⋮ Subsequence frequency in binary words ⋮ A history and a survey of lattice path enumeration ⋮ Counting occurrences of 231 in an involution ⋮ A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations ⋮ A solution to one of Knuth's permutation problems ⋮ Almost avoiding permutations ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials ⋮ The generalized lucky ticket problem, perfect matchings, and closure relations satisfied by the Chebyshev and \(q\)-Hermite polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Counting occurrences of 132 in a permutation
• Permutation patterns and continued fractions
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Permutations with one or two 132-subsequences
• Layered restrictions and Chebyshev polynomials
• Restricted permutations and Chebyshev polynomials
• The number of permutations containing exactly one increasing subsequence of length three
• Restricted permutations, continued fractions, and Chebyshev polynomials
• Restricted permutations
• Restricted 132-avoiding permutations
• Permutations with restricted patterns and Dyck paths
• Permutations restricted by two distinct patterns of length three

This page was built for publication: Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three