Generating functions of permutations with respect to their alternating runs

preprint2020arXivOpen access

Abstract

We present a short, direct proof of the fact that the generating function of all permutations of a fixed length n≥4n\geq 4 is divisible by (1+z)m(1+z)^m, where m=⌊(n−2)/2⌋m=\lfloor (n-2)/2 \rfloor.

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.