On the combinatorics of descents and inverse descents in the hyperoctahedral group
X. Gao, F.Z.K. Li, L. Wan, J.Y.X. Yang

TL;DR
This paper investigates the distribution of descents and inverse descents in signed permutations within the hyperoctahedral group, providing new combinatorial proofs for recurrence formulas and revealing distributional symmetries.
Contribution
It offers combinatorial proofs for six recurrence formulas related to descents and inverse descents in hyperoctahedral groups, including new formulas and insights into their distributional properties.
Findings
Six recurrence formulas for joint distributions are proved combinatorially.
Some formulas are new, others connect to algebraic results by Visontai, Moustakas, and Cao-Liu.
Distributions of descent pairs are equal on certain subsets but differ on fixed-point free involutions.
Abstract
The elements in the hyperoctahedral group can be treated as signed permutations with the natural order , or as colored permutations with the -order . For any , let and be the number of descents and inverse descents in under the natural order, and let and be the number of descents and inverse descents in under the -order. In this paper, by investigating signed permutation grids under both the natural order and the -order, we give combinatorial proofs for six recurrence formulas of the joint distribution of descents and inverse descents over the hyperoctahedral group , the set in involutions of denoted by…
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 · Algorithms and Data Compression
