Counting occurrences of 132 in an even permutation
Combinatorics
2007-05-23 v1
Abstract
We study the generating function for the number of even (or odd) permutations on n letters containing exactly occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in .
Keywords
Cite
@article{arxiv.math/0211205,
title = {Counting occurrences of 132 in an even permutation},
author = {T. Mansour},
journal= {arXiv preprint arXiv:math/0211205},
year = {2007}
}
Comments
12 pages, 2 figures