A descent-excedance correspondence in colored permutation groups

Hiranya Kishore Dey; Sivaramakrishnan Sivasubramanian; Umesh Shankar

arxiv: 2410.23206 · v1 · submitted 2024-10-30 · 🧮 math.CO

A descent-excedance correspondence in colored permutation groups

Hiranya Kishore Dey , Umesh Shankar , Sivaramakrishnan Sivasubramanian This is my paper

Pith reviewed 2026-05-23 18:43 UTC · model grok-4.3

classification 🧮 math.CO

keywords descentsexcedancescolored permutationsequidistributiontype BCarlitz identitylinear orders

0 comments

The pith

In colored permutation groups, summed descent and excedance counts match after a simple change to the first letter.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that descent and excedance enumerators over permutations with a fixed first letter become identical after a simple change of that first letter. This identity, known in the symmetric group, is extended to type B permutations and more generally to colored permutation groups. The extension uses definitions of descents and excedances based on linear orders on the colored set. For even numbers of colors and a chosen order, the results generalize those for type B. A type B version of Conger's refinement to the Carlitz identity is also derived.

Core claim

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. This is generalized to type B and other colored permutation groups by defining descents and excedances through linear orders. With respect to a particular order, when the number of colors is even, a result generalizing the type B results is obtained. A type B counterpart of Conger's result which refines the Carlitz identity is also presented.

What carries the argument

The descent-excedance correspondence obtained by changing the first letter of the permutation, extended via linear orders on colored elements.

If this is right

The equidistribution extends to all colored permutation groups for any number of colors.
A particular linear order yields the type B generalization precisely when the number of colors is even.
The approach produces a type B analog of the refined Carlitz identity due to Conger.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

This linear order method for defining statistics may apply to other families of permutations or Coxeter groups.
Similar first-letter shift correspondences could exist for additional permutation statistics beyond descents and excedances.

Load-bearing premise

The linear-order definitions of descents and excedances remain combinatorially natural and preserve the equidistribution when extended from the symmetric group to colored permutation groups with arbitrary numbers of colors.

What would settle it

A counterexample in a small colored permutation group, such as with 2 colors and n=3, where the summed descent and excedance enumerators do not match after the first letter change would falsify the claim.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper's core is a fixed-first-letter equidistribution between descents and excedances that extends cleanly to colored groups via linear orders, but only for even colors, plus a type B Carlitz refinement.

read the letter

The main thing here is the observation that descent and excedance counts, when summed over permutations with a fixed first letter, match after a simple relabeling of that letter. They then carry this to colored permutation groups by defining the statistics through linear orders on the colored letters. For even numbers of colors this gives a generalization of the type B case, and they also produce a type B version of Conger's refinement of the Carlitz identity. That fixed-first-letter step and the linear-order setup for the colored case are the actual new pieces; the rest organizes and extends known equidistributions in a straightforward way. The constructions look direct and the claims stay within what the abstract states, so there is no overreach on odd color counts. The stress-test worry about odd colors does not land because the paper explicitly restricts the general result to even colors and does not claim uniformity beyond that. Without the full proofs it is impossible to check whether the linear-order bijections are the most natural ones or if they introduce any hidden choices, but nothing in the abstract suggests circularity or post-hoc fitting. This is a specialized combinatorics paper aimed at people who already work on permutation statistics and colored groups. A reader looking for explicit identities and refinements will get usable new statements. It is solid enough on its own terms to deserve referee time rather than a desk reject.

Referee Report

1 major / 2 minor

Summary. The paper shows that in the symmetric group, the descent and excedance enumerators summed over permutations with a fixed first letter coincide after a simple relabeling of that letter. It generalizes the correspondence to type B and other colored permutation groups by defining descents and excedances via linear orders on the underlying set. With respect to a particular linear order, the equidistribution holds when the number of colors is even, yielding a generalization of known type B results; the paper also supplies a type B analogue of Conger's refinement of the Carlitz identity.

Significance. If the derivations hold, the work supplies a uniform linear-order framework that recovers and extends classical descent-excedance equidistribution from S_n to wreath products and colored groups, at least in the even-color case. The explicit type B refinement of the Carlitz identity is a concrete, falsifiable contribution that can be checked against existing enumerative data.

major comments (1)

[Abstract] The central claim restricts the equidistribution result to even numbers of colors under a specific linear order; because the manuscript does not assert the result for odd colors, the stress-test concern that equidistribution may fail for odd color counts does not apply to the stated theorems.

minor comments (2)

[Abstract] The abstract states that descents and excedances are defined 'through linear orders' but does not indicate in which section the precise orders are introduced or how they are shown to be combinatorially natural.
It would be useful to include a short table or example comparing the new linear-order definitions with the classical descent/excedance definitions on S_n and on the hyperoctahedral group.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive recommendation of minor revision. We address the single major comment below.

read point-by-point responses

Referee: [Abstract] The central claim restricts the equidistribution result to even numbers of colors under a specific linear order; because the manuscript does not assert the result for odd colors, the stress-test concern that equidistribution may fail for odd color counts does not apply to the stated theorems.

Authors: We agree with the referee's assessment. Our theorems are explicitly restricted to the even-color case with respect to the chosen linear order, and we make no claim regarding odd numbers of colors. The restriction arises naturally from the properties of the linear order used to define descents and excedances in the colored setting. revision: no

Circularity Check

0 steps flagged

No circularity; combinatorial generalizations are self-contained

full rationale

The paper defines descents and excedances via explicit linear orders on colored permutations and proves equidistribution statements directly for the symmetric group, type B, and colored groups. No equations reduce to fitted inputs renamed as predictions, no self-definitional loops, and no load-bearing self-citations are quoted or required. The even-color specialization is presented as a choice of order, not a forced outcome from prior author results. The derivation chain remains independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard combinatorial definitions of descents, excedances, and colored permutation groups; no free parameters, no invented entities, and only background axioms from group theory and poset theory are invoked.

axioms (2)

domain assumption Descents and excedances are well-defined via linear orders on the underlying set for any number of colors.
The abstract states that the authors are led to defining these statistics through linear orders to obtain the generalizations.
standard math The symmetric-group equidistribution of descents and excedances is already established in the literature.
The paper begins from this known fact before extending it.

pith-pipeline@v0.9.0 · 5632 in / 1415 out tokens · 52250 ms · 2026-05-23T18:43:36.034846+00:00 · methodology

A descent-excedance correspondence in colored permutation groups

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)