Descent sets of cyclic permutations in types B and D
Kevin Liu

TL;DR
This paper extends Elizalde's bijection for cyclic permutations to signed permutations in types B and D, establishing descent-preserving maps and analyzing their statistical properties.
Contribution
It constructs a descent-preserving bijection for cyclic signed permutations in types B and D, generalizing previous results and enabling asymptotic analysis.
Findings
Established a descent-preserving bijection for signed permutations in types B and D.
Proved asymptotic normality of descent and flag major index statistics.
Connected the new bijection to Elizalde's original symmetric group bijection.
Abstract
Elizalde constructed a bijection from the cyclic permutations to the symmetric group satisfying . We give a corresponding result on the signed symmetric group by constructing a function from the cyclic signed permutations to satisfying . Moreover, letting be the subgroup consisting of signed permutations with an even number of sign changes, we show that the restriction of to the cyclic signed permutations in or its complement is a bijection. Our function reduces to Elizalde's original bijection under the natural identification of the symmetric groups as subgroups of the signed symmetric groups. One application…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Genome Rearrangement Algorithms · Finite Group Theory Research
