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.
Copyright © 2004 Hindawi Publishing Corporation. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.