International Journal of Mathematics and Mathematical Sciences
Volume 2004 (2004), Issue 25-28, Pages 1329-1341
doi:10.1155/S0161171204304114
Counting occurrences of 132 in an even permutation
Toufik Mansour
Department of Mathematics, Chalmers University of Technology, Göteborg 41296, Sweden
Abstract
We study the generating function for the number of even (or odd) permutations on n letters containing exactly r≥0 occurrences of a 132 pattern. It is shown that finding this function for a given r amounts to a routine check of all permutations in 𝔖2r.