Recurrence relations in counting the pattern 13-2 in flattened permutations
Combinatorics
2014-10-16 v1
Abstract
We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.
Cite
@article{arxiv.1410.4109,
title = {Recurrence relations in counting the pattern 13-2 in flattened permutations},
author = {Toufik Mansour and David G. L. Wang},
journal= {arXiv preprint arXiv:1410.4109},
year = {2014}
}
Comments
18 pages