pith. sign in

arxiv: 1907.06363 · v1 · pith:SHBYR7ILnew · submitted 2019-07-15 · 🧮 math.CO

Linked partition ideals, directed graphs and q-multi-summations

Shane Chern This is my paper

Pith reviewed 2026-05-24 21:38 UTC · model grok-4.3

classification 🧮 math.CO
keywords linked partition idealsdirected graphsq-multi-summationsAndrews-Gordon identitiesgenerating functionsq-difference systemspartition theorybinary trees
0
0 comments X

The pith

Directed graphs with an empty vertex yield a q-difference system whose factorization into q-multi-summations proves Andrews-Gordon identities for linked partition ideals.

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

The paper establishes a graph-theoretic route to generating-function identities for linked partition ideals. It begins with the ordinary generating function for directed graphs that include a distinguished empty vertex. This generating function satisfies a q-difference system that can be solved by factoring a column vector whose entries are q-multi-summations. A recurrence relation satisfied by those summations then produces explicit non-computer-assisted proofs of selected Andrews-Gordon type identities. The same construction also reveals an explicit link to binary trees.

Core claim

The generating function of directed graphs possessing an empty vertex satisfies a q-difference system. Solving the system amounts to factoring a column functional vector whose components are q-multi-summations; these summations obey a recurrence that directly supplies the desired generating-function identities for the linked partition ideals under study.

What carries the argument

The q-difference system obtained from the generating function of directed graphs with an empty vertex, solved by factorization into column vectors of q-multi-summations.

If this is right

  • Selected Andrews-Gordon type identities receive direct proofs that rely only on the recurrence for q-multi-summations.
  • The generating functions of linked partition ideals are placed in explicit correspondence with the enumeration of directed graphs containing an empty vertex.
  • Binary trees furnish a combinatorial interpretation that organises the steps of the factorization.

Where Pith is reading between the lines

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

  • The same graph-to-factorization pipeline may apply to other families of partition ideals once an appropriate empty-vertex generating function is identified.
  • The binary-tree connection could be used to produce recursive visualisations or counting arguments for the q-multi-summations themselves.
  • Because the method avoids computer search, it may be adaptable to identities whose computer-assisted proofs are already known but whose manual derivations remain open.

Load-bearing premise

The q-difference system derived from the graph generating function admits a factorization into column vectors of q-multi-summations that satisfy the recurrence required by the linked partition ideals.

What would settle it

An explicit counter-example in which the recurrence for the q-multi-summations fails to reproduce the known generating function for one of the linked partition ideals considered in the paper.

Figures

Figures reproduced from arXiv: 1907.06363 by Shane Chern.

Figure 1
Figure 1. Figure 1: The associated directed graph in Example 2.1 π1 π2 π3 ♯(π1) = 0 |π1| = 0 ♯(π2) = 1 |π2| = 1 ♯(π3) = 1 |π3| = 2 π1 = ∅ π2 = 1 π3 = 2 3. q-Multi-summations 3.1. A q-difference system and the uniqueness of solutions. Recall that in Theorem 1.1 we have shown that   G1(x) G2(x) . . . GK(x)   = W (x) [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Node H(β1, . . . , βr, . . . , βR) and its children H(β1, . . . , βr, . . . , βR) H(β1, . . . , βr + Ar, . . . , βR) H(β1 + αr,1, . . . , βr + αr,r, . . . , βR + αr,R) 1 x γr q βr Now the proofs of (3.11) and (3.18) can be illustrated by Figs. 3 and 4, respec￾tively [PITH_FULL_IMAGE:figures/full_fig_p018_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The binary tree for (3.11) H(1) H(2) H(3) H(4) H(3) 1 1 xq2 xq [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The binary tree for (3.18) H(1, 3) H(1, 6) H(2, 6) H(3, 6) H(3, 9) H(4, 9) H(5, 12) H(6, 12) H(4, 9) H(3, 9) H(4, 9) H(5, 12) H(4, 9) 1 1 1 1 1 xq3 x 2 q 6 xq2 xq 1 xq3 x 2 q 3 In fact, it is relatively easy to deduce other much more complicated identities of the same flavor as (3.11) and (3.18). For example, the next result follows from the binary tree in [PITH_FULL_IMAGE:figures/full_fig_p019_4.png] view at source ↗
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p022_5.png] view at source ↗
read the original abstract

Finding an Andrews--Gordon type generating function identity for a linked partition ideal is difficult in most cases. In this paper, we will handle this problem in the setting of graph theory. With the generating function of directed graphs with an ``empty'' vertex, we then turn our attention to a $q$-difference system. This $q$-difference system eventually yields a factorization problem of a special type of column functional vectors involving $q$-multi-summations. Finally, using a recurrence relation satisfied by certain $q$-multi-summations, we are able to provide non-computer-assisted proofs of some Andrews--Gordon type generating function identities. These proofs also have an interesting connection with binary trees.

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 manuscript develops a graph-theoretic approach to Andrews-Gordon type generating function identities for linked partition ideals. Starting from the generating function of directed graphs with an empty vertex, it derives a q-difference system that leads to a factorization problem for column functional vectors involving q-multi-summations. A recurrence relation for these summations is then used to obtain non-computer-assisted proofs of the identities, with an additional connection to binary trees.

Significance. If the derivations hold, the work provides a systematic method for proving partition identities using directed graphs and q-series techniques, potentially extending to other identities and offering insights into the structure of linked partition ideals. The emphasis on non-computer-assisted proofs and the explicit link to binary trees are notable strengths.

minor comments (2)
  1. [Abstract] Abstract: the description of the pipeline from graph generating functions to the q-difference system and factorization is high-level; explicit statements of the q-difference equations, the form of the column vectors, and the recurrence would strengthen the abstract.
  2. The connection to binary trees is mentioned but not elaborated in the provided description; a brief indication of how the trees arise from the graph model or recurrence would improve clarity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our manuscript and for recommending minor revision. We appreciate the recognition of the graph-theoretic approach to Andrews-Gordon identities and the emphasis on non-computer-assisted proofs.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation begins with the generating function of directed graphs with an empty vertex, produces a q-difference system, factors column functional vectors whose entries are q-multi-summations, and invokes a recurrence satisfied by those summations to obtain the target Andrews-Gordon identities. None of these steps is shown to reduce by definition or by self-citation to the identities themselves; the pipeline is presented as a forward construction from the graph model. No load-bearing self-citation, fitted-input-as-prediction, or ansatz-smuggling is visible in the abstract or described method, so the argument remains self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, ad-hoc axioms, or invented entities are stated. Standard combinatorial generating-function axioms and q-series recurrence relations are presupposed but not detailed.

axioms (2)
  • domain assumption The generating function of directed graphs with an empty vertex satisfies a q-difference system that factors into q-multi-summation vectors.
    Invoked in the transition from graph model to q-difference system (abstract).
  • domain assumption Certain q-multi-summations obey a recurrence relation sufficient to recover the Andrews-Gordon identities.
    Used to conclude the proofs (abstract).

pith-pipeline@v0.9.0 · 5633 in / 1314 out tokens · 17231 ms · 2026-05-24T21:38:12.306851+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

19 extracted references · 19 canonical work pages · 2 internal anchors

  1. [1]

    G. E. Andrews, An analytic proof of the Rogers–Ramanujan– Gordon identities, Amer. J. Math. 88 (1966), 844–846

    work page 1966

  2. [2]

    G. E. Andrews, Partition identities, Advances in Math. 9 (1972), 10–51

    work page 1972

  3. [3]

    G. E. Andrews, A general theory of identities of the Rogers -Ramanujan type, Bull. Amer. Math. Soc. 80 (1974), 1033–1052

    work page 1974

  4. [4]

    G. E. Andrews, Problems and prospects for basic hypergeom etric functions, Theory and ap- plication of special functions (Proc. Advanced Sem., Math. Res. Center, Univ. Wisconsin, Madison, Wis., 1975) , pp. 191–224. Math. Res. Center, Univ. Wisconsin, Publ. No. 35, Aca- demic Press, New York, 1975

    work page 1975

  5. [5]

    G. E. Andrews, The theory of partitions , Reprint of the 1976 original. Cambridge Mathemat- ical Library. Cambridge University Press, Cambridge, 1998 . xvi+255 pp

    work page 1976

  6. [6]

    Proofs and reductions of various conjectured partition identities of Kanade and Russell

    K. Bringmann, C. Jennings-Shaffer, and K. Mahlburg, Proof s and reductions of various con- jectured partition identities of Kanade and Russell, to app ear in J. Reine Angew. Math. Available at arXiv:1809.06089

    work page internal anchor Pith review Pith/arXiv arXiv

  7. [7]

    Capparelli, On some representations of twisted affine Li e algebras and combinatorial iden- tities, J

    S. Capparelli, On some representations of twisted affine Li e algebras and combinatorial iden- tities, J. Algebra 154 (1993), no. 2, 335–355

    work page 1993

  8. [8]

    Chern and Z

    S. Chern and Z. Li, Kanade–Russell conjectures and linked partition ideals, submitted. Avail- able at arXiv:1809.08655

    work page arXiv

  9. [9]

    G¨ ollnitz, Partitionen mit differenzenbedingungen, J

    H. G¨ ollnitz, Partitionen mit differenzenbedingungen, J. Reine Angew. Math. 225 (1967), 154–190

    work page 1967

  10. [10]

    Gordon, A combinatorial generalization of the Rogers –Ramanujan identities, Amer

    B. Gordon, A combinatorial generalization of the Rogers –Ramanujan identities, Amer. J. Math. 83 (1961), 393–399

    work page 1961

  11. [11]

    Gordon, Some continued fractions of the Rogers–Raman ujan type, Duke Math

    B. Gordon, Some continued fractions of the Rogers–Raman ujan type, Duke Math. J. 32 (1965), 741–748

    work page 1965

  12. [12]

    Kanade and M

    S. Kanade and M. C. Russell, IdentityFinder and some new identities of Rogers-Ramanujan type, Exp. Math. 24 (2015), no. 4, 419–423

    work page 2015

  13. [13]

    Kanade and M

    S. Kanade and M. C. Russell, Staircases to analytic sum-s ides for many new integer partition identities of Rogers–Ramanujan type, Electron. J. Combin. 26 (2019), no. 1, Paper 1.6, 33 pp

    work page 2019

  14. [14]

    Kauers and C

    M. Kauers and C. Koutschan, A Mathematica package for q-holonomic sequences and power series, Ramanujan J. 19 (2009), no. 2, 137–150

    work page 2009

  15. [15]

    Andrews-Gordon Type Series for Kanade-Russell Conjectures

    K. Kur¸ sung¨ oz, Andrews–Gordon type series for Kanade-Russell conjectures, Preprint (2018). Available at arXiv:1808.01432

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  16. [16]

    Kur¸ sung¨ oz, Andrews–Gordon type series for Cappare lli’s and G¨ ollnitz-Gordon identities, J

    K. Kur¸ sung¨ oz, Andrews–Gordon type series for Cappare lli’s and G¨ ollnitz-Gordon identities, J. Combin. Theory Ser. A 165 (2019), 117–138

    work page 2019

  17. [17]

    Ramanujan, Proof of certain identities in combinator y analysis, Proc

    S. Ramanujan, Proof of certain identities in combinator y analysis, Proc. Cambridge Philos. Soc. 19 (1919), 214–216

    work page 1919

  18. [18]

    Riese, qMultiSum—a package for proving q-hypergeometric multiple summation identities, J

    A. Riese, qMultiSum—a package for proving q-hypergeometric multiple summation identities, J. Symbolic Comput. 35 (2003), no. 3, 349–376

    work page 2003

  19. [19]

    L. J. Rogers, Third memoir on the expansion of certain infi nite products, Proc. Lond. Math. Soc. 26 (1894), 15–32. Department of Mathematics, Penn State University, Universit y Park, PA 16802, USA E-mail address : shanechern@psu.edu

    work page