Generating functions of permutations with respect to their alternating runs
Miklós Bóna·2020-05-27·via math.CO updates on arXiv.org
We present a short, direct proof of the fact that the generating function of all permutations of a fixed length $n\geq 4$ is divisible by $(1+z)^m$, where $m=\lfloor (n-2)/2 \rfloor$.