pith. machine review for the scientific record. sign in

arxiv: 2602.16184 · v2 · submitted 2026-02-18 · 🧮 math.AC · math.AG· math.CO· math.RA

Recognition: 2 theorem links

· Lean Theorem

Restricted Chip-Firing: Toric Toppling Ideals, Picard Groups, and Cellular Resolutions

Rahul Karki
Authors on Pith no claims yet

Pith reviewed 2026-05-15 21:33 UTC · model grok-4.3

classification 🧮 math.AC math.AGmath.COmath.RA
keywords chip-firingtoppling idealstoric idealspargraphsPicard groupscellular resolutionsG-parking functionsCohen-Macaulay
0
0 comments X

The pith

Toppling ideals of pargraphs include the defining ideals of rational normal curves, binomial edge ideals of complete graphs, and toric ideals of certain Fano polytopes.

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

The paper establishes that generalizing graphs to pargraphs lets the restricted chip-firing game produce toppling ideals that coincide with several classical families of toric ideals. By constructing explicit Gröbner bases and minimal cellular resolutions for a distinguished initial ideal, and by proving the Cohen-Macaulay property, the work supplies algebraic tools that were previously unavailable for these combinatorial objects. It also gives conditions under which the Picard group of a pargraph is free. Readers care because the same framework recovers disparate examples from algebraic geometry and graph theory under one set of definitions and proofs.

Core claim

Several well-known families of toric ideals arise as toppling ideals of pargraphs. These include ideals defining rational normal curves, binomial edge ideals of complete graphs, and toric ideals of certain Fano polytopes. Sufficient conditions ensure the toppling ideal is toric; a Gröbner basis is constructed for it; a minimal cellular free resolution is given for the G-parking function ideal; the ideals are Cohen-Macaulay; and the Picard group is free under further sufficient conditions.

What carries the argument

The toppling ideal of a pargraph, the ideal generated by the monomial relations coming from allowed chip-firing moves on this generalized graph structure.

If this is right

  • The toppling ideal of a pargraph is toric whenever the stated sufficient conditions hold.
  • A Gröbner basis for the toppling ideal can be written down explicitly from the pargraph data.
  • The G-parking function ideal admits a minimal cellular free resolution.
  • The toppling ideals are Cohen-Macaulay rings.
  • The Picard group of a pargraph is free when the additional conditions are met.

Where Pith is reading between the lines

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

  • Chip-firing moves on pargraphs may give new combinatorial recipes for computing the syzygies of these toric ideals.
  • The same construction could be tested on additional families of polytopes whose toric ideals are not yet known to arise from graphs.
  • Cellular resolutions obtained this way might extend to other monomial ideals coming from combinatorial games.

Load-bearing premise

The definition of a pargraph is broad enough to include the graphs and polytopes that generate the listed toric ideals while still preserving the algebraic relations needed for the toppling ideal to be toric.

What would settle it

An explicit computation for a small pargraph whose toppling ideal should match the ideal of a rational normal curve, showing that the two ideals differ in generators or in degree, would disprove the recovery claim.

Figures

Figures reproduced from arXiv: 2602.16184 by Rahul Karki.

Figure 1
Figure 1. Figure 1: The pargraph (G, Π) with Π = {{2, 5}, {j} | j ∈ {1, 3, 4, 6, 7}}. graph. In particular, IΠ = ⟨x u − x v | u, v ∈ N n and u − v ∈ LΠ⟩. Many of the algebraic and geometric properties of the ideal IΠ are encoded in the quotient group Z n/LΠ, which we refer to as the Picard group of the pargraph. These definitions extend the classical graph-theoretic notions of the Picard group and toppling ideal to pargraphs.… view at source ↗
read the original abstract

We study certain groups and ideals arising from the chip-firing game on a generalisation of graphs called pargraphs. Several well-known families of toric ideals arise as toppling ideals of pargraphs. These include ideals defining rational normal curves, binomial edge ideals of complete graphs, and toric ideals of certain Fano polytopes. We provide sufficient conditions under which the toppling ideal of a pargraph to be toric. In addition, we construct a Gr\"obner basis for the toppling ideal, a minimal cellular free resolution for a distinguished initial ideal known as the $G$-parking function ideal, and establish Cohen-Macaulay property for these ideals. We also study the Picard group of a pargraph and provide sufficient conditions ensuring its freeness.

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

2 major / 2 minor

Summary. The paper introduces pargraphs as a generalization of graphs and studies the toppling ideals arising from restricted chip-firing games on them. It claims that several classical families of toric ideals arise exactly as toppling ideals of suitable pargraphs, including the ideals defining rational normal curves (via 2x2 minors of catalecticant matrices), binomial edge ideals of complete graphs, and toric ideals of certain Fano polytopes. The authors give sufficient conditions for a toppling ideal to be toric, construct a Gröbner basis, provide a minimal cellular free resolution of the associated G-parking function ideal, prove the Cohen-Macaulay property, and establish sufficient conditions for the Picard group of a pargraph to be free.

Significance. If the exact identifications with classical toric ideals hold, the work supplies a combinatorial chip-firing framework that unifies and potentially computes presentations, Gröbner bases, and resolutions for well-studied objects in toric algebra. The cellular resolution and Cohen-Macaulay results add homological structure, while the Picard-group analysis extends the algebraic invariants of the underlying combinatorial objects. The constructions are explicit and the sufficient conditions are stated clearly, which would be strengths if the generator-matching claims are verified.

major comments (2)
  1. [§4] §4 (rational normal curve case): the claim that the toppling ideal equals the ideal of 2×2 minors of the catalecticant matrix is load-bearing for the abstract's strongest statement, yet the toricity sufficient conditions alone do not guarantee generator-for-generator equality; an explicit check that the pargraph Laplacian and firing rules reproduce precisely those quadratic binomials is required.
  2. [§5] §5 (complete-graph case): the assertion that the toppling ideal of the pargraph for K_n coincides with the binomial edge ideal likewise depends on the precise definition of the restricted firing rules matching the known quadratic generators; the toricity criterion does not automatically deliver this identification.
minor comments (2)
  1. [§2] The notation for the pargraph Laplacian and the precise firing rules should be collected in a single preliminary subsection with a running example to improve readability.
  2. [Introduction] A brief comparison of pargraphs with existing generalizations (e.g., signed graphs or hypergraphs) would clarify the novelty of the construction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting the need for explicit generator verifications in the identifications with classical toric ideals. We address each major comment below.

read point-by-point responses

  1. Referee: [§4] §4 (rational normal curve case): the claim that the toppling ideal equals the ideal of 2×2 minors of the catalecticant matrix is load-bearing for the abstract's strongest statement, yet the toricity sufficient conditions alone do not guarantee generator-for-generator equality; an explicit check that the pargraph Laplacian and firing rules reproduce precisely those quadratic binomials is required.

    Authors: We agree that the general toricity criterion alone is insufficient to establish the precise generator equality. The construction in §4 defines a specific pargraph whose restricted firing rules are intended to produce exactly the quadratic binomials from the catalecticant matrix. In the revised manuscript we have added an explicit generator-matching argument: we enumerate the minimal generators arising from the Laplacian and firing sequences on this pargraph and directly verify that they coincide with the 2×2 minors, including a small explicit example for low degree to illustrate the correspondence. revision: yes

  2. Referee: [§5] §5 (complete-graph case): the assertion that the toppling ideal of the pargraph for K_n coincides with the binomial edge ideal likewise depends on the precise definition of the restricted firing rules matching the known quadratic generators; the toricity criterion does not automatically deliver this identification.

    Authors: We concur that the identification requires a direct check of the generators rather than relying solely on the toricity conditions. The pargraph for K_n is constructed so that its restricted firing rules generate precisely the quadratic binomials of the binomial edge ideal. In the revision we have inserted a dedicated paragraph that lists the generators produced by the firing rules and shows their one-to-one correspondence with the known generators of the binomial edge ideal of K_n, thereby confirming the equality. revision: yes

Circularity Check

0 steps flagged

No circularity; explicit constructions and sufficient conditions suffice

full rationale

The paper defines pargraphs and associated toppling ideals, then supplies sufficient conditions under which these ideals are toric. It further constructs explicit Groebner bases, cellular resolutions, and Picard groups for these objects. The strongest claim—that certain classical toric ideals (rational normal curves, binomial edge ideals, Fano polytopes) arise as toppling ideals—is supported by direct identification via the definitions and constructions rather than by any self-referential equation, fitted parameter renamed as prediction, or load-bearing self-citation. No step reduces to its own input by construction; the derivation chain remains self-contained against external algebraic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claims rest on the algebraic properties of the newly defined pargraphs and on standard facts from commutative algebra; no free parameters appear, and the only invented entity is the pargraph itself.

axioms (2)
  • standard math Standard properties of toric ideals and Gröbner bases hold for the toppling ideals constructed from pargraphs.
    Invoked when claiming that the toppling ideal is toric and admits a Gröbner basis.
  • domain assumption The chip-firing process on a pargraph produces a monomial ideal whose initial ideal is the G-parking function ideal.
    Required for the construction of the minimal cellular resolution.
invented entities (1)
  • pargraph no independent evidence
    purpose: Generalization of graphs that supports a restricted chip-firing game whose toppling ideal recovers known toric ideals.
    Central new object introduced in the paper; no independent evidence outside the constructions is provided.

pith-pipeline@v0.9.0 · 5432 in / 1590 out tokens · 19404 ms · 2026-05-15T21:33:58.968213+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Gra¸ ca Duffner and Fernando C

    M. Gra¸ ca Duffner and Fernando C. Silva,On the Interlacing Inequali- ties for Invariant Factors, Linear Algebra and its Applications, Vol486 (2015), pp. 443–448

    work page 2015

  2. [2]

    Ezra Miller and Bernd Sturmfels,Combinatorial Commutative Algebra, Springer (2005)

    work page 2005

  3. [3]

    Matthew Baker and Serguei Norine,Riemann–Roch and Abel–Jacobi Theory on a Finite Graph, Advances in Mathematics, Vol215(2007), pp. 766–788

    work page 2007

  4. [4]

    Matthew Baker,Specialization of Linear Systems From Curves to Graphs, Algebra & Number Theory, Vol2(2008), pp. 613–653

    work page 2008

  5. [5]

    Scott Corry and David Perkinson,Divisors and Sandpiles, American Mathematical Society, Vol114(2018)

    work page 2018

  6. [6]

    Klivans,Mathematics of Chip-Firing, Discrete Mathematics and its Applications, CRC Press (2018)

    Caroline J. Klivans,Mathematics of Chip-Firing, Discrete Mathematics and its Applications, CRC Press (2018)

    work page 2018

  7. [7]

    J¨ urgen Herzog and Takayuki Hibi,Monomial Ideals, Springer (2011)

    work page 2011

  8. [8]

    Rahul Karki and Madhusudan Manjunath,Rational Normal Curves, Chip Firing and Free Resolutions, arXiv, math.AC, url=https://arxiv.org/abs/2301.09104

    work page arXiv

  9. [9]

    Morris Newman,The Smith Normal Form, Linear Algebra and its Appli- cations, Vol254(1997), pp. 367–381. 19

    work page 1997

  10. [10]

    Anton Dochtermann and Raman Sanyal,Laplacian Ideals, Arrange- ments, and Resolutions, Journal of Algebraic Combinatorics, Vol 40(2014), pp. 805–822

    work page 2014

  11. [11]

    Richard P Stanley,An Introduction to Hyperplane Arrangements, Geo- metric Combinatorics, IAS/Park City Mathematics Series,, Vol13(2007), pp. 389–496

    work page 2007

  12. [12]

    Matthew Baker and Farbod Shokrieh,Chip-Firing Games, Potential Theory on Graphs, and Spanning Trees, Journal of Combinatorial Theory, Series A, Vol120(2013), pp. 164–182

    work page 2013

  13. [14]

    Richard P Stanley,Smith Normal Form in Combinatorics, Journal of Combinatorial Theory, Series A, Vol144(2016), pp. 476–495

    work page 2016

  14. [15]

    J¨ urgen Herzog, Takayuki Hibi and Hidefumi Ohsugi,Binomial ideals, Springer, Vol279(2018)

    work page 2018

  15. [16]

    Bernd Sturmfels,Gr¨ obner Bases and Convex Polytopes, American Mathematical Society, Vol8(1996)

    work page 1996

  16. [17]

    317– 333

    J¨ urgen Herzog, Takayuki Hibi, Freyja Hreinsd´ ottir, Thomas Kahle and Johannes Rauh,Binomial Edge Ideals and Conditional Independence Statements, Advances in Applied Mathematics, Vol45(2010), pp. 317– 333

    work page 2010

  17. [18]

    Zachary Greif and Jason McCullough,Green-Lazarsfeld Condition for Toric Edge Ideals of Bipartite Graphs, Journal of Algebra, Vol562(2020), pp. 1–27

    work page 2020

  18. [19]

    Ignacio Garc´ ıa-Marco and Christos Tatakis,On Robustness and Re- lated Properties on Toric Ideals, Journal of Algebraic Combinatorics, Vol 57(2023), pp. 21–52

    work page 2023

  19. [20]

    Ayah Almousa, Anton Dochtermann and Ben Smith,Root polytopes, Tropical Types, and Toric Edge Ideals, Algebraic Combinatorics, Vol 8(2025), pp. 59–99. 20

    work page 2025

  20. [21]

    2853–2874

    Madhusudan Manjunath, Frank-Olaf Schreyer and John Wilmes,Min- imal Free Resolutions of theG-Parking Function Ideal and the Top- pling Ideal, Transactions of the American Mathematical Society, Vol 367(2015), pp. 2853–2874

    work page 2015

  21. [22]

    Robert Cori, Dominique Rossin and Bruno Salvy,Polynomial Ideals for Sandpiles and Their Gr¨ obner Bases, Theoretical Computer Science, Vol 276(2002), pp. 1–15

    work page 2002

  22. [23]

    David Perkinson, Jacob Perlman and John Wilmes,Primer for the Alge- braic Geometry of Sandpiles, Tropical and Non-Archimedean Geometry, Vol605(2013), pp. 211–256

    work page 2013

  23. [24]

    Madhusudan Manjunath and Bernd Sturmfels,Monomials, Binomials and Riemann–Roch, Journal of Algebraic Combinatorics, Vol37(2013), pp. 737–756

    work page 2013

  24. [25]

    Jaiung Jun, Youngsu Kim and Matthew Pisano,On Picard Groups and Jacobians of Directed Graphs, Linear Algebra and its Applications, Vol 711(2025), pp. 180–211

    work page 2025

  25. [26]

    Carlos A Alfaro and Ralihe R Villagr´ an,The Structure of Sandpile Groups of Outerplanar Graphs, Applied Mathematics and Computation, Vol395(2021), pp. 125861

    work page 2021

  26. [27]

    Takenori Kataoka,Fitting Ideals of Jacobian Groups of Graphs, Alge- braic Combinatorics, Vol7(2024), pp. 597–625. Author’s address: School of Advanced Engineering, UPES Dehradun, India 248007. Email id:rahuls.karki@ddn.upes.ac.in, rahulkarki877@gmail.com. 21

    work page 2024