Counting occurrences of 132 in an even permutation
arXiv:math/0211205
Abstract
We study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in .
12 pages, 2 figures