We study the generating function for the number of even (or odd) permutations on n letters containing exactly r≥O 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.
|Number of pages||13|
|Journal||International Journal of Mathematics and Mathematical Sciences|
|State||Published - 2004|
ASJC Scopus subject areas
- Mathematics (miscellaneous)