A Toeplitz property of ballot permutations and odd order permutations (Q782929)

Summary: 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 \textit{O. Bernardi} et al. [Sémin. Lothar. Comb. 63, B63e, 13 p. (2010; Zbl 1234.05036)]. \textit{S. Spiro} [Discrete Math. 343, No. 6, Article ID 111869, 14 p. (2020; Zbl 1437.05015)] 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 of descents, and a Toeplitz property for odd order permutations with any fixed cyclic weight. This allows us to refine Spiro's conjecture by tracking the neighbors of the largest letter in permutations.