Callan permutations and odd order permutations
A permutation is said to be of odd order if its cycle decomposition consists entirely of odd-length cycles, and is called a Callan permutation if every left-to-right minimum occurs at an odd position. (A left-to-right minimum of a permutation \(\pi = \pi(1)\cdots\pi(n)\) is an entry \(\pi(i)\) satisfying \(\pi(i) < \pi(j)\) for all \(j < i\).) The paper provides five independent proofs that Callan permutations and odd order permutations of \([n]\) are equinumerous, both counted by \(n!!(n-2)!!\) for odd \(n\) and \(((n-1)!!)^2\) for even \(n\) (OEIS A000246). The proofs proceed via generating functions using the exponential formula, via a recurrence relation based on the position of \(1\), via a recurrence relation based on the neighbors of \(n\), and via two explicit bijections. The final bijection yields a refinement: the set of peak values over Callan permutations is equidistributed with the set of cyclic peak values over odd order permutations.
- A bijection between well-labelled positive paths and matchings
- A decomposition of ballot permutations, pattern avoidance and Gessel walks
- A Toeplitz property of ballot permutations and odd order permutations
- Ballot permutations and odd order permutations
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- On a problem raised by P. J. Cameron
- The peak and descent statistics over ballot permutations
- The Princeton companion to mathematics.
This page was built for publication: Callan permutations and odd order permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866180)
