A Toeplitz property of ballot permutations and odd order permutations

DOI10.37236/9298MaRDI QIDQ782929zbMATH OpenOpenAlexFDO

Authors David G. L. Wang, Jerry J. R. Zhang

Publication date 29 July 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

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

zbMATH Keywords

Spiro's conjecture

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Toeplitz, Cauchy, and related matrices (15B05)

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.

Review text

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.

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

• A bijection between well-labelled positive paths and matchings
• Eulerian-Catalan numbers
• 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?)
• On Fluctuations in Coin-Tossing

Cited in

(5)

• The peak and descent statistics over ballot permutations
• Refined Eulerian numbers and ballot permutations
• A decomposition of ballot permutations, pattern avoidance and Gessel walks
• Ballot permutations and odd order permutations
• Callan permutations and odd order permutations

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)