Recurrence relations in counting the pattern 13-2 in flattened permutations
arXiv:1410.4109 · doi:10.1080/10236198.2014.977273
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.
18 pages