Counting occurences of 132 in a permutation
Combinatorics
2007-05-23 v2
Abstract
We study the generating function for the number of permutations on n letters containing exactly occurences 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/0105073,
title = {Counting occurences of 132 in a permutation},
author = {Toufik Mansour and Alek Vainshtein},
journal= {arXiv preprint arXiv:math/0105073},
year = {2007}
}
Comments
9 pages, 2 figures