Math-5178 · mathematics · Combinatorics

Math-5178

A fixed Laplacian quotient and hereditary firing staircases

Status Partially solved · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedPartially solvedOpen

Statement

Definitions and mathematical statement

For a finite loopless graph $G$, an acyclic orientation has no directed cycle. The equivalence generated by turning a source into a sink corresponds to a special chip-firing class of divisors. The graphic arrangement has hyperplanes $x_u=x_v$ for edges $uv$, and chambers indexed by acyclic orientations; passing to ${\mathbb{R}}^{V(G)}/{\mathbb{Z}}^{V(G)}$ gives the toric graphic arrangement. Matt Macauley's source question asks for a comparable geometric interpretation of chip-firing equivalence for larger divisor classes. It does not specify which larger classes or what geometric equivalence is required.

The recorded comments propose multi-toppling/hereditary chip-firing (Andrea Sportiello), ask whether multi-toppling is abelian (James Propp), assert that the abelian property holds precisely in the hereditary case of firing clusters and subclusters (Sportiello), and refer to Spencer Backman [6] (Lionel Levine). The PDF introduction explicitly says these are recorder summaries, not necessarily verbatim quotations; no universal abelian iff theorem is inferred without its firing conventions.

The supplied aid's partial construction fixes a connected finite loopless multigraph with a sink $s$. Let $V^\circ=V\setminus\{s\}$, let $L$ be its reduced Laplacian, and let $\mathcal H$ be a hereditary cover of $V^\circ$: its members are nonempty subsets, it is closed under taking nonempty subsets, and their union is $V^\circ$. For $U\in\mathcal H$ define $c_U(v)$, for $v\in U$, as the number of edges from $v$ to $V\setminus U$, including sink edges and multiplicity. A nonnegative integer configuration $a$ may fire $U$ when \[ a_v\ge c_U(v)\quad(v\in U), \qquad a\longmapsto a-L\mathbf1_U. \] It is stable when no such cluster is legal. Define the monomial ideal, over any coefficient field, \[ J_{\mathcal H}=\left(\prod_{v\in U}x_v^{c_U(v)}:U\in\mathcal H\right). \] The aid reports that the standard monomials $x^a\notin J_{\mathcal H}$ are exactly stable configurations. They form a bounded staircase, since all singletons are allowed and impose coordinate bounds. It also reports \[ \operatorname{span}_{{\mathbb{Z}}}\{L\mathbf1_U:U\in\mathcal H\} =L{\mathbb{Z}}^{V^\circ}. \] Thus the finite algebraic quotient ${\mathbb{Z}}^{V^\circ}/L{\mathbb{Z}}^{V^\circ}$ is independent of the hereditary rule, while the stable staircase and the recurrent representative section attributed to Backman retain that rule. Stable configurations are not thereby asserted to be unique in each class. Equality of firing lattices concerns algebraic equivalence and is not, by itself, a statement of legal reachability between arbitrary nonnegative configurations; the recurrent dynamics and hypotheses must be specified.

For the ordinary cycle $C_m$, $m\ge3$, the aid gives a degree-zero completion. Write \[ \operatorname{Pic}^0(C_m)=\operatorname{Div}^0(C_m)/\operatorname{im}\Delta, \qquad D_O(v)=\operatorname{indeg}_O(v)-1. \] Since the cycle has equally many edges and vertices, $D_O$ has degree zero. The reported map from source-to-sink classes of acyclic orientations $O$ to $[D_O]$ is a bijection onto all nonzero classes of $\operatorname{Pic}^0(C_m)\simeq{\mathbb{Z}}/m{\mathbb{Z}}$. Adjoining the one missing identity class completes this cycle case. This does not supply a toric-arrangement analogue for every larger divisor class on every graph, so it remains a partial answer to the original geometric question.

Short English statement

The source asks to extend the toric-arrangement picture of source-to-sink equivalence beyond orientation divisors. The supplied aid separates a fixed Laplacian quotient from rule-dependent stable configurations and reports a one-class completion for cycles, while retaining the unresolved geometric and firing-rule conventions.

Sources

  • Local UnsolvedMath registry, permanent ID $20000972$, source code catalogue entry; aim-combinatorics-notes.json, notes[96], tag problem.
  • AIM, Generalizations of chip-firing and the critical group, Problem 7, following the workshop of 8--12 July 2013, source reference [1]: https://aimath.org/pastworkshops/chipfiringproblems.pdf. Statement status exact. The supplied verification preserves the introduction's warning that comments are recorder summaries, not necessarily verbatim quotations. No PDF was accessed for this draft.
  • Matt Macauley, main question; Andrea Sportiello, multi-toppling and hereditary comments; James Propp, abelian-property question; Lionel Levine, reference to Spencer Backman [6]. The full bibliographic entry for [6] is not supplied.
  • Research attempt 1: partial_result, status partially_solved, classification PARTIAL-PROGRESS, rigor label proved, novelty confidence low. Created and updated 14 August 2026. This machine-generated aid is not peer reviewed; independently verify before citation.
  • Ulam AI / UnsolvedMath Contributors; CC BY 4.0.

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.