Root system chip-firing I: Interval-firing
Pavel Galashin, Sam Hopkins, Thomas McConville, Alexander Postnikov

TL;DR
This paper introduces and analyzes interval-root-firing processes on root systems, proving their confluence and establishing polynomial counting formulas for stable points, with conjectures on their positivity.
Contribution
It extends chip-firing models to root systems with interval-based firing rules, proving confluence and polynomial stability counts across all parameters.
Findings
Interval-firing processes are always confluent from any initial weight.
Number of stable weights is given by polynomials in parameter k.
Conjecture: these polynomials have nonnegative integer coefficients.
Abstract
Jim Propp recently introduced a variant of chip-firing on a line where the chips are given distinct integer labels. Hopkins, McConville, and Propp showed that this process is confluent from some (but not all) initial configurations of chips. We recast their set-up in terms of root systems: labeled chip-firing can be seen as a root-firing process which allows the moves for whenever , where is the set of positive roots of a root system of Type A and is a weight of this root system. We are thus motivated to study the exact same root-firing process for an arbitrary root system. Actually, this central root-firing process is the subject of a sequel to this paper. In the present paper, we instead study the interval root-firing processes determined by …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
