Counting occurrences of 132 in a permutation

DOI10.1006/aama.2001.0773zbMath1005.05001arXivmath/0105073OpenAlexW1998726440MaRDI QIDQ696855

Toufik Mansour, A. D. Vaĭnshteĭn

Publication date: 12 September 2002

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

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

zbMATH Keywords

generating functionpermutationcountingpattern

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

Unnamed Item ⋮ Decomposing simple permutations, with enumerative consequences ⋮ The shape of random pattern-avoiding permutations ⋮ On the diagram of 132-avoiding permutations ⋮ Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three ⋮ Subsequence frequency in binary words ⋮ Counting occurrences of 231 in an involution ⋮ Recurrence relations for patterns of type (2,1) in flattened permutations ⋮ Small configurations in simple permutations ⋮ On Stanley-Wilf limit of the pattern 1324 ⋮ Restricted \(k\)-ary words and functional equations ⋮ Almost avoiding permutations ⋮ Recurrence relations in counting the pattern 13-2 in flattened permutations ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

Cites Work

• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Forbidden subsequences and Chebyshev polynomials
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• Permutations with one or two 132-subsequences
• The number of permutations containing exactly one increasing subsequence of length three
• Restricted permutations, continued fractions, and Chebyshev polynomials