A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We give a new semi-combinatorial proof for the equality of the number of ballot permutations of length $n$ and the number of odd order permutations of length $n$, which was originally proven by Bernardi, Duplantier and Nadeau. Spiro conjectures that the descent number of ballot permutations and certain cyclic weights of odd order permutations of the same length are equi-distributed. We present a bijection to establish a Toeplitz property for ballot permutations with any fixed number ofdoi:10.37236/9298 fatcat:3simzhsekbckrg5na3kaifm5vu