Counting occurences of 132 in a permutation

2001/05/09 by Toufik Mansour, Mansour, Toufik, Alek Vainshtein +1
Mathematics · #05A05 #05A15 #05C90 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05 #msc:05A15 #msc:05C90

paper · pdf · doi:10.48550/arxiv.math/0105073

9 pages, 2 figures

arxiv created 2001/08/02 · arxiv updated 2009/11/30

Abstract

We study the generating function for the number of permutations on n letters containing exactly r\gs0 occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S_2r.

Related

• Counting occurrences of 132 in an even permutation
• Restricted 132-avoiding permutations
• Counting occurrences of 3412 in an involution
• The Number of Permutations With A Prescribed Number of 132 and 123 Patterns
• Restricted 132-alternating permutations and Chebyshev polynomials