pith. sign in

arxiv: 2508.21318 · v2 · submitted 2025-08-29 · 🧮 math.CO · cs.DM

Signed counting of partition matrices

Shane Chern , Shishuo Fu This is my paper

Pith reviewed 2026-05-18 21:04 UTC · model grok-4.3

classification 🧮 math.CO cs.DM
keywords partition matricesinversion sequencessigned countinginv statisticimproper partition matricesMotzkin pathsequinumerositybijection
0
0 comments X

The pith

Signed counting of partition matrices by inversion parity equals the size of a subclass of inversion sequences.

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

The paper proves that summing over all partition matrices with a sign given by the parity of the inv statistic produces exactly the number of objects in a particular subclass of inversion sequences. This signed equality serves as a unification between the two families. Along the way the authors define improper partition matrices and prove that one subset of them is equinumerous with Motzkin paths, supplying both a generating-function proof and an explicit bijection. A sympathetic reader would care because the result supplies a new counting model for the inversion-sequence subclass and a concrete combinatorial bridge to Motzkin paths. If the claim holds, the signed sum immediately gives the cardinality of the subclass without enumerating the sequences directly.

Core claim

We prove that the signed counting (with respect to the parity of the inv statistic) of partition matrices equals the cardinality of a subclass of inversion sequences. In the course of establishing this result, we introduce an interesting class of partition matrices called improper partition matrices. We further show that a subset of improper partition matrices is equinumerous with the set of Motzkin paths. Such an equidistribution is established both analytically and bijectively.

What carries the argument

The inv statistic on partition matrices, whose parity supplies the sign in the alternating sum that equals the size of the target subclass of inversion sequences.

If this is right

  • The cardinality of the specified subclass of inversion sequences is given by the signed count of partition matrices.
  • A subset of improper partition matrices is counted by Motzkin paths.
  • Both generating-function identities and explicit bijections exist for the Motzkin-path equinumerosity.
  • Partition matrices now possess an alternative enumeration route through inversion sequences.

Where Pith is reading between the lines

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

  • The signed-counting technique may extend to other inversion-like statistics on the same matrices.
  • The improper-partition-matrix model could supply bijective proofs for additional Motzkin-path identities.
  • Generating functions obtained for these objects may refine known recursions for related lattice paths.

Load-bearing premise

The standard definitions of partition matrices, the inv statistic on them, and the subclass of inversion sequences admit a signed enumeration that can be shown equal by combinatorial or algebraic means.

What would settle it

Direct enumeration for small n: if the alternating sum over all partition matrices of size n, weighted by (-1) to the power of inv, differs from the number of qualifying inversion sequences of the same size, the claimed equality is false.

Figures

Figures reproduced from arXiv: 2508.21318 by Shane Chern, Shishuo Fu.

Figure 1
Figure 1. Figure 1: The construction of B∗ in Case (2) (3) wPath(B)(D − 1, D) = 2 and Pre(D − 1, D) ∈ {(D − 2, D − 1),(D − 2, D)}. Note that this case can only happen when D ≥ 3. Also, # diag Path(B) (↘) = blk(B) − 1 = 0 so that the first step on Path(B) must be an east step. Hence, we may define a nonempty set S := {i : 1 ≤ i ≤ D − 2 and both (i, i),(i, i + 1) are on Path(B)}, which at least contains 1. Let s := max S. Since… view at source ↗
Figure 2
Figure 2. Figure 2: The construction of B∗ in Case (3) (1’) # diag Path(B∗) (↘) = 0. This case corresponds to the previous Case (1). Note that Pre(D, D) = (D − 1, D). Now we preserve the weighted path Path(B∗ ) with the only exception that the weight at (D − 1, D) is in￾creased by 2. The new weighted path is Path(B). (2’) # diag Path(B∗) (↘) = 1 and the only southeast step on the diagonal starts at (D −1, D −1). This case cor… view at source ↗
read the original abstract

We prove that the signed counting (with respect to the parity of the ``$\operatorname{inv}$'' statistic) of partition matrices equals the cardinality of a subclass of inversion sequences. In the course of establishing this result, we introduce an interesting class of partition matrices called improper partition matrices. We further show that a subset of improper partition matrices is equinumerous with the set of Motzkin paths. Such an equidistribution is established both analytically and bijectively.

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

0 major / 2 minor

Summary. The paper proves that the signed counting (with respect to the parity of the inv statistic) of partition matrices equals the cardinality of a subclass of inversion sequences. It introduces improper partition matrices and shows that a subset of them is equinumerous with Motzkin paths, established both via generating-function identities and an explicit bijection.

Significance. If the results hold, this supplies a new signed enumeration connecting partition matrices to inversion sequences. The auxiliary result on improper partition matrices equinumerous with Motzkin paths is strengthened by independent verification through both generating functions and a bijection. These explicit combinatorial arguments and dual proofs are clear strengths in enumerative combinatorics.

minor comments (2)
  1. The precise definition of the subclass of inversion sequences is not previewed in the abstract, which would help readers immediately grasp the main claim.
  2. Consider adding a small illustrative example or diagram early in the section defining improper partition matrices to clarify their relation to standard partition matrices.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and for recommending minor revision. The referee's summary correctly identifies the main results: the signed enumeration of partition matrices via the inv statistic matching a subclass of inversion sequences, and the equinumerosity of a subset of improper partition matrices with Motzkin paths, established by both generating functions and an explicit bijection.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained via explicit bijections and generating functions

full rationale

The paper's central claim is a direct combinatorial proof equating signed inv-parity counts on partition matrices to the cardinality of a specified subclass of inversion sequences. Auxiliary results on improper partition matrices and their equinumerosity to Motzkin paths are established independently by both analytic generating-function identities and explicit bijections, none of which reduce to self-definitional inputs, fitted parameters renamed as predictions, or load-bearing self-citations. The derivation chain relies on standard definitions and external combinatorial techniques without circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The result rests on standard combinatorial definitions and the new definition of improper partition matrices; no free parameters or external data fitting are indicated.

axioms (1)
  • domain assumption Standard definitions of partition matrices, inv statistic, inversion sequences, and Motzkin paths hold as background objects in enumerative combinatorics.
    Invoked implicitly to define the objects being counted and compared.
invented entities (1)
  • improper partition matrices no independent evidence
    purpose: A new subclass introduced to establish equidistribution with Motzkin paths.
    Defined in the course of the proof to enable the second equidistribution result.

pith-pipeline@v0.9.0 · 5586 in / 1119 out tokens · 45441 ms · 2026-05-18T21:04:39.979459+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

21 extracted references · 21 canonical work pages

  1. [1]

    G. E. Andrews and V. Jelínek, Onq-series identities related to interval orders,European J. Combin. 39 (2014), 178–187. 2

    work page 2014

  2. [2]

    R. E. Behrend, I. Fischer, and C. Koutschan, Diagonally symmetric alternating sign matrices, preprint, available at arXiv:2309.08446. 5

    work page arXiv

  3. [3]

    Bousquet-Mélou, A

    M. Bousquet-Mélou, A. Claesson, M. Dukes, and S. Kitaev,(2 + 2)-free posets, ascent sequences and pattern avoiding permutations,J. Combin. Theory Ser. A117 (2010), no. 7, 884–909. 1, 25

    work page 2010

  4. [4]

    D. M. Bressoud, Combinatorial analysis, in:NIST Handbook of Mathematical Functions, 617–636, U.S. Dept. Commerce, Washington, DC, 2010. 10

    work page 2010

  5. [5]

    W. Cao, E. Y. Jin, and Z. Lin, Enumeration of inversion sequences avoiding triples of relations, Discrete Appl. Math.260 (2019), 86–97. 4

    work page 2019

  6. [6]

    D. Chen, S. H. F. Yan, and R. D. P. Zhou, Equidistributed statistics on Fishburn matrices and permutations,Electron. J. Combin.26 (2019), no. 1, Paper No. 1.11, 14 pp. 1

    work page 2019

  7. [7]

    Claesson, M

    A. Claesson, M. Dukes, and M. Kubitzke, Partition and composition matrices,J. Com- bin. Theory Ser. A118 (2011), no. 5, 1624–1637. 2, 9, 11, 25

    work page 2011

  8. [8]

    P. C. Fishburn, Intransitive indifference with unequal indifference intervals,J. Mathe- matical Psychology 7 (1970), 144–149. 1

    work page 1970

  9. [9]

    P. C. Fishburn, Interval lengths for interval orders: a minimization problem,Discrete Math. 47 (1983), no. 1, 63–82. 1

    work page 1983

  10. [10]

    P. C. Fishburn, Interval Orders and Interval Graphs. A Study of Partially Ordered Sets, John Wiley & Sons, Ltd., Chichester, 1985. 1

    work page 1985

  11. [11]

    Flajolet, Combinatorial aspects of continued fractions,Discrete Math.32 (1980), no

    P. Flajolet, Combinatorial aspects of continued fractions,Discrete Math.32 (1980), no. 2, 125–161. 15

    work page 1980

  12. [12]

    Frobenius, Über die Bernoullischen Zahlen und die Eulerschen Polynome, Sitze Berichte Preuss

    G. Frobenius, Über die Bernoullischen Zahlen und die Eulerschen Polynome, Sitze Berichte Preuss. Akad. Wiss.(1910), 808–847. 9

    work page 1910

  13. [13]

    Foata and G.-N

    D. Foata and G.-N. Han, q-Series in Combinatorics; Permutation Statistics (Lecture Notes), Preliminary Edition, private notes, 2011. 3

    work page 2011

  14. [14]

    Foata and M.-P

    D. Foata and M.-P. Schützenberger, Théorie Géométrique des Polynômes Eulériens, Springer-Verlag, Berlin-New York, 1970. 9

    work page 1970

  15. [15]

    Krattenthaler, Permutations with restricted patterns and Dyck paths,Adv

    C. Krattenthaler, Permutations with restricted patterns and Dyck paths,Adv. in Appl. Math. 27 (2001), no. 2-3, 510–530. 15

    work page 2001

  16. [16]

    Levande, Fishburn diagrams, Fishburn numbers and their refined generating func- tions, J

    P. Levande, Fishburn diagrams, Fishburn numbers and their refined generating func- tions, J. Combin. Theory Ser. A120 (2013), no. 1, 194–217. 1

    work page 2013

  17. [17]

    Martinez and C

    M. Martinez and C. D. Savage, Patterns in inversion sequences II: inversion sequences avoiding triples of relations,J. Integer Seq.21 (2018), no. 2, Art. 18.2.2, 44 pp. 4, 18

    work page 2018

  18. [18]

    N. J. A. Sloane, On-Line Encyclopedia of Integer Sequences, available athttp://oeis. org. 2, 4, 12, 17

    work page

  19. [19]

    Stoimenow, Enumeration of chord diagrams and an upper bound for Vassiliev invari- ants, J

    A. Stoimenow, Enumeration of chord diagrams and an upper bound for Vassiliev invari- ants, J. Knot Theory Ramifications7 (1998), no. 1, 93–114. 2

    work page 1998

  20. [20]

    Zagier, Vassiliev invariants and a strange identity related to the Dedekind eta- function, Topology 40 (2001), no

    D. Zagier, Vassiliev invariants and a strange identity related to the Dedekind eta- function, Topology 40 (2001), no. 5, 945–960. 2

    work page 2001

  21. [21]

    Zagier, Quantum modular forms, in:Quanta of Maths, 659–675, Amer

    D. Zagier, Quantum modular forms, in:Quanta of Maths, 659–675, Amer. Math. Soc., Providence, RI, 2010. 2 28 S. CHERN AND S. FU (S. Chern)F akultät für Mathematik, Universität Wien, Oskar-Morgenstern- Platz 1, Wien 1090, Austria Email address: chenxiaohang92@gmail.com, xiaohangc92@univie.ac.at (S. Fu)College of Mathematics and Statistics, Chongqing Univers...

    work page 2010