Generating functions of permutations with respect to their alternating runs

Abstract

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

4 pages