A Toeplitz property of ballot permutations and odd order permutations
From MaRDI portal
(Redirected from Publication:782929)
Abstract: We give a new semi-combinatorial proof for the equality of the number of ballot permutations of length and the number of odd order permutations of length , which is due to Bernardi, Duplantier and Nadeau. Spiro conjectures that the descent number of ballot permutations and certain cyclic weight 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.
Recommendations
- Ballot permutations and odd order permutations
- A decomposition of ballot permutations, pattern avoidance and Gessel walks
- The peak and descent statistics over ballot permutations
- Refined Eulerian numbers and ballot permutations
- A complete enumeration of Ballot permutations avoiding sets of small patterns
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3263280 (Why is no real title available?)
- scientific article; zbMATH DE number 3322983 (Why is no real title available?)
- A bijection between well-labelled positive paths and matchings
- Eulerian-Catalan numbers
- On Fluctuations in Coin-Tossing
Cited in
(4)
This page was built for publication: A Toeplitz property of ballot permutations and odd order permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782929)