Abstract

We study the generating function for the number of even (or odd) permutations on n letters containing exactly r0 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.