Counting occurrences of 3412 in an involution
Combinatorics
2007-05-23 v1
Abstract
We study the generating function for the number of involutions on letters containing exactly occurrences of 3412. It is shown that finding this function for a given amounts to a routine check of all involutions on letters.
Cite
@article{arxiv.math/0401218,
title = {Counting occurrences of 3412 in an involution},
author = {Toufik Mansour},
journal= {arXiv preprint arXiv:math/0401218},
year = {2007}
}
Comments
12 pages, 4 figures