A Toeplitz property of ballot permutations and odd order permutations

From MaRDI portal
Publication:782929

DOI10.37236/9298zbMATH Open1454.05010arXiv2001.07143OpenAlexW3037624437MaRDI QIDQ782929FDOQ782929


Authors: David G. L. Wang, Jerry J. R. Zhang Edit this on Wikidata


Publication date: 29 July 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 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.


Full work available at URL: https://arxiv.org/abs/2001.07143

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


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)