pith. sign in

arxiv: 2605.20253 · v1 · pith:AWUX65J4new · submitted 2026-05-18 · 🧮 math.GM

Distributions of Inversions and Descents over Integer Compositions

E. G. Santos This is my paper

Pith reviewed 2026-05-21 08:14 UTC · model grok-4.3

classification 🧮 math.GM
keywords integer compositionsinversionsdescentspermutation statisticsgenerating functionsbijectionsmajor indexdescent number
0
0 comments X

The pith

The inversion and descent distributions over k-compositions of n are given by the joint (maj, inv) and (inv, des) distributions over permutations of k via a bijection.

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

The paper derives generating functions counting k-compositions of n by their inversion numbers and by their descent numbers. It applies a known bijection that sends each composition to a permutation paired with an integer partition. This reduces the composition statistics to classical permutation statistics, specifically linking inversions on compositions to the joint major index and inversion number on permutations and linking descents on compositions to the joint inversion and descent numbers on permutations. A reader would care because the reduction supplies explicit generating functions and connects enumeration problems on compositions to well-understood results on the symmetric group.

Core claim

We derive a generating function for the number of integer compositions of n into k parts with a given number of inversions, and obtain similar results for k-compositions of n with a given number of descents. Our approach relies on a known bijection that associates each integer composition σ with a pair (π,λ), where π is a permutation and λ is an integer partition. We show that the distribution of inversions and the distribution of descents over k-compositions are related, respectively, to the distribution of (maj,inv) and to the distribution of (inv,des) over permutations of {1,2,…,k}.

What carries the argument

The known bijection associating each integer composition σ with a pair (π, λ), where π is a permutation of [k] and λ is an integer partition, which carries the inversion and descent counts from compositions to the corresponding permutation statistics.

If this is right

  • Generating functions are obtained for the number of k-compositions of n with any fixed inversion count.
  • Generating functions are obtained for the number of k-compositions of n with any fixed descent count.
  • The inversion distribution on compositions equals the joint (maj, inv) distribution on permutations of k.
  • The descent distribution on compositions equals the joint (inv, des) distribution on permutations of k.

Where Pith is reading between the lines

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

  • The same bijection may be used to derive generating functions for the total number of inversions summed over all k-compositions of n.
  • The connection suggests that average inversion numbers in random compositions can be read off from known permutation averages.
  • Similar reductions might apply to other statistics such as major index on compositions or to compositions with restricted part sizes.

Load-bearing premise

The results rest on the existence of a bijection from compositions to permutation-partition pairs that correctly aligns the inversion and descent counts.

What would settle it

For k=3 and n=5, enumerate all 3-compositions, count their inversions, and check whether the resulting counts equal the coefficients in the generating function obtained by summing q^{maj(π)+inv(π)} over all permutations π of [3].

Figures

Figures reproduced from arXiv: 2605.20253 by E. G. Santos.

Figure 1
Figure 1. Figure 1: (a) Young diagram of shape λ = (4, 4, 2, 1) filled with the hook lengths of each cell. (b) Example of standard Young tableau of shape λ = (4, 4, 2, 1). We recall some standard definitions related to permutation statistics that can be applied in the study of compositions as well. Let α = (α1, α2, . . . , αk) be k-tuple of positive integers, with repetitions allowed. An inversion of α is a pair of indices (i… view at source ↗
read the original abstract

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of descents. Our approach relies on a known bijection that associates each integer composition $\sigma$ with a pair $(\pi,\lambda)$, where $\pi$ is a permutation and $\lambda$ is an integer partition. We show that the distribution of inversions and the distribution of descents over $k$-compositions are related, respectively, to the distribution of (maj,inv) and to the distribution of (inv,des) over permutations of $\{1,2,\ldots,k\}$, where maj, inv, and des denote the classical permutation statistics major index, inversion number, and descent number, respectively.

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.

Referee Report

1 major / 2 minor

Summary. The paper derives generating functions for the number of k-compositions of n with a given number of inversions, and similarly for descents, by invoking a known bijection that maps each composition σ to a pair (π, λ) with π a permutation in S_k and λ a partition. It claims that the inversion distribution on compositions corresponds to the joint (maj, inv) distribution on S_k, and the descent distribution corresponds to the joint (inv, des) distribution on S_k.

Significance. If the statistic-preservation properties of the cited bijection are rigorously verified for the inversion and descent statistics, the results would provide explicit generating-function connections between composition statistics and classical permutation statistics, allowing reuse of known permutation enumerations for composition counts. This could be of interest in combinatorial enumeration, though the approach depends entirely on the external bijection rather than introducing new combinatorial objects.

major comments (1)
  1. [§3] §3: The central claim equates the inversion generating function on k-compositions to a sum involving the joint (maj, inv) distribution on S_k. This equality holds only if the invoked bijection σ ↔ (π, λ) maps inv(σ) exactly to maj(π) plus a term depending only on λ. The manuscript cites the bijection but provides no explicit verification or re-derivation of this statistic correspondence; without it the claimed generating-function identity is not established.
minor comments (2)
  1. The abstract and introduction should explicitly name the reference for the cited bijection (including the precise statement of how inversions and descents are preserved or transformed).
  2. Notation for the generating functions (e.g., variables tracking n, k, and the statistic) should be introduced once and used consistently throughout.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying the need for greater explicitness regarding the bijection. We address the major comment below.

read point-by-point responses

  1. Referee: [§3] §3: The central claim equates the inversion generating function on k-compositions to a sum involving the joint (maj, inv) distribution on S_k. This equality holds only if the invoked bijection σ ↔ (π, λ) maps inv(σ) exactly to maj(π) plus a term depending only on λ. The manuscript cites the bijection but provides no explicit verification or re-derivation of this statistic correspondence; without it the claimed generating-function identity is not established.

    Authors: We agree that the manuscript would benefit from an explicit verification of the statistic correspondence. Although the bijection is standard in the literature, the current text does not re-derive how inv(σ) corresponds to maj(π) plus a λ-dependent term. In the revised version we will add a short subsection (or appendix) that explicitly computes this mapping for the inversion statistic and, for completeness, the analogous mapping for the descent statistic under the same bijection. This will make the generating-function identities self-contained. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation rests on external known bijection

full rationale

The paper's central derivation maps k-compositions to pairs (permutation, partition) via a known external bijection and then relates inversion and descent distributions to classical permutation statistics (maj,inv) and (inv,des). This mapping is invoked as pre-existing rather than constructed from the paper's own equations, fitted parameters, or self-citations. No load-bearing step reduces by definition to its inputs, renames a fitted quantity as a prediction, or relies on a uniqueness theorem imported from the authors' prior work. The approach is therefore self-contained against external benchmarks, with the bijection serving as independent support.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The derivation depends on the existence of a standard bijection between compositions and permutation-partition pairs, which is treated as given from prior literature; no free parameters or new entities are introduced.

axioms (1)
  • domain assumption A known bijection exists that maps each k-composition to a pair consisting of a permutation of [k] and an integer partition.
    Explicitly invoked in the abstract as the foundation of the approach.

pith-pipeline@v0.9.0 · 5678 in / 1249 out tokens · 49192 ms · 2026-05-21T08:14:34.468469+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Archibald, A

    M. Archibald, A. Blecher, A. Knopfmacher, and M. E. Mays, Inversions and parity in compositions of integers,J. Integer Seq.23(2020), article 20.4.1

    work page 2020

  2. [2]

    Carlitz, The expansion of certain products,Proc

    L. Carlitz, The expansion of certain products,Proc. Amer. Math. Soc.7(1956), 558– 564. 12

    work page 1956

  3. [3]

    Foata and M.-P

    D. Foata and M.-P. Sch¨ utzenberger, Major index and inversion number of permutations, Math. Nachr.83(1978), 143–159

    work page 1978

  4. [4]

    J. S. Frame, G. de B. Robinson, and R. M. Thrall, The hook graphs ofS n,Canad. J. Math.6(1954), 316–324

    work page 1954

  5. [5]

    I. M. Gessel, Generating functions and enumeration of sequences, M.I.T. doctoral thesis, 1977,https://people.brandeis.edu/ ~gessel/homepage/papers/thesis.pdf

    work page 1977

  6. [6]

    Heubach, A

    S. Heubach, A. Knopfmacher, M. E. Mays, and A. Munagi, Inversions of compositions of integers,Quaest. Math.34(2011), 187–202

    work page 2011

  7. [7]

    Heubach and T

    S. Heubach and T. Mansour,Combinatorics of Compositions and Words, 2010

    work page 2010

  8. [8]

    Knopfmacher, M

    A. Knopfmacher, M. E. Mays, and S. Wagner, Compositions with a fixed number of inversions,Aequationes Math.93(2019), 601–617

    work page 2019

  9. [9]

    D. E. Knuth,The Art of Computer Programming: Sorting and Searching, Volume 3, 2nd Edition, 1998

    work page 1998

  10. [10]

    I. G. MacDonald,Symmetric Functions and Hall Polynomials, 2nd Edition, 1995

    work page 1995

  11. [11]

    P. A. MacMahon, The indices of permutations and the derivation there-from of functions of a single variable associated with the permutations of any assemblage of objects,Amer. J. Math35(1913), 281–322

    work page 1913

  12. [12]

    Published electronically athttps://oeis.org

    OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, 2026. Published electronically athttps://oeis.org

    work page 2026

  13. [13]

    D. P. Roselle, Coefficients associated with the expansion of certain products,Proc. Amer. Math. Soc.45(1974), 144–150

    work page 1974

  14. [14]

    R. P. Stanley, Binomial posets, M¨ obius inversion, and permutation enumeration,J. Combin. Theory Ser. A20(1976), 336–356

    work page 1976

  15. [15]

    R. P. Stanley,Enumerative Combinatorics, Volume 2, 2nd Edition, 2023. 2020Mathematics Subject Classification: Primary 05A15; Secondary 05A05, 05A17. Keywords:inversion, descent, integer composition. (Concerned with sequences A189052 , A189073, A189074, A238343, A238344.) Received XXXXXX XX 20XX; revised versions received XXXXXX XX 20XX; XXXXXX XX 20XX. Pu...

    work page 2023