English

Descent sets of cyclic permutations in types B and D

Combinatorics 2025-08-05 v1

Abstract

Elizalde constructed a bijection ϕ\phi from the cyclic permutations πSn+1\pi\in S_{n+1} to the symmetric group SnS_n satisfying Des(π){1,2,,n1}=Des(ϕ(π))\operatorname{Des}(\pi)\cap \{1,2,\ldots,n-1\}=\operatorname{Des}(\phi(\pi)). We give a corresponding result on the signed symmetric group BnB_n by constructing a function Φ\Phi from the cyclic signed permutations πBn+1\pi\in B_{n+1} to BnB_n satisfying Des(π){0,1,,n1}=Des(Φ(π))\operatorname{Des}(\pi)\cap \{0,1,\ldots,n-1\}=\operatorname{Des}(\Phi(\pi)). Moreover, letting Dn+1Bn+1D_{n+1}\subseteq B_{n+1} be the subgroup consisting of signed permutations with an even number of sign changes, we show that the restriction of Φ\Phi to the cyclic signed permutations in Dn+1D_{n+1} or its complement is a bijection. Our function Φ\Phi reduces to Elizalde's original bijection ϕ\phi under the natural identification of the symmetric groups as subgroups of the signed symmetric groups. One application of our results is asymptotic normality of the descent and flag major index statistics on the cyclic signed permutations in BnB_{n} and DnD_n.

Cite

@article{arxiv.2508.02432,
  title  = {Descent sets of cyclic permutations in types B and D},
  author = {Kevin Liu},
  journal= {arXiv preprint arXiv:2508.02432},
  year   = {2025}
}
R2 v1 2026-07-01T04:33:22.505Z