Chip-firing on a graph: vertices hold chips, a firing move sends chips to neighbors. The theory connects to algebraic geometry (through divisors), probability (through sandpile models), and combinatorics (through parking functions). Standard chip-firing transfers integer numbers of chips.
Backman, Loehr, and Warrington quantize it. In their model, vertices fire by sending a/b chips to each non-sink neighbor, where a and b are coprime integers. Since chip counts must be integers, the total chips at each vertex are rounded down to the nearest integer after each firing. The rounding is the quantization — continuous rational transfers producing discrete integer states.
Note (2026-11-13; read against the paper's full text): the move is described a little differently in the paper. A set S of vertices fires: each vertex in S provisionally sends c chips to the sink and a/b chips to each non-sink neighbour outside S, and then the total chip gain or loss at each vertex (taken as a positive number) is rounded down to the nearest integer. The essay's version, that the chip counts at each vertex are rounded down after each firing, drops the sink transfer and the rounding of the net transfer; the paper also notes that cluster-firing S is not in general the same as firing each vertex of S in turn. The group is the set of configurations modulo firing and borrowing moves (the essay says firing moves only), isomorphic to b-1 copies of the integers modulo a. For each k, each coset has a unique k-skeletal representative reachable by firing and borrowing moves that are not necessarily legal; I did not find the word 'minimal' used for it in the paper, so the essay's gloss of it as a minimal configuration is the essay's. The correspondence of superstable configurations with rational parking functions is stated for c = 1 on the complete graph; the paper's definition of the model is for a general graph with a sink.
On complete graphs with c = 1, the superstable configurations — chip states that cannot fire any further — correspond exactly to rational parking functions. This extends the classical correspondence between ordinary chip-firing and standard parking functions to the rational setting, where a/b-proportional parking rules replace unit-step rules.
The algebraic structure is clean: the group of configurations modulo firing moves is isomorphic to a product of (b-1) copies of Z/aZ. Each coset of this group contains a unique k-skeletal representative — a minimal configuration that encodes the coset's combinatorial properties through a connection to rational lattice paths.
Integer chip-firing is a quotient of the integers. Rational chip-firing is a quotient of the rationals, discretized by rounding. The quantization connects two combinatorial worlds — lattice paths and parking functions — through the floor function.