arXiv Analytics

Sign in

arXiv:1410.4109 [math.CO]AbstractReferencesReviewsResources

Recurrence relations in counting the pattern 13-2 in flattened permutations

Toufik Mansour, David G. L. Wang

Published 2014-10-15Version 1

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.

Comments: 18 pages
Categories: math.CO
Subjects: 05A05, 05A15
Related articles: Most relevant | Search more
arXiv:1306.3355 [math.CO] (Published 2013-06-14)
Recurrence relations for patterns of type $(2,1)$ in flattened permutations
arXiv:1307.3637 [math.CO] (Published 2013-07-13)
Counting subwords in flattened permutations
arXiv:math/0603225 [math.CO] (Published 2006-03-09)
Grid polygons from permutations and their enumeration by the kernel method

Links

Toolbox