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

preprint2014arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.