A descent-excedance correspondence in colored permutation groups
Combinatorics
2026-04-10 v1
Abstract
It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change of the first letter. We generalize this to type B and other colored permutation groups. We are led to defining descents and excedances through linear orders. With respect to a particular order, when the number of colors is even, we get a result that generalizes the type B results. Lastly, we get a type B counterpart of Conger's result which refines the well known Carlitz identity.
Keywords
Cite
@article{arxiv.2410.23206,
title = {A descent-excedance correspondence in colored permutation groups},
author = {Hiranya Kishore Dey and Umesh Shankar and Sivaramakrishnan Sivasubramanian},
journal= {arXiv preprint arXiv:2410.23206},
year = {2026}
}
Comments
14 pages