Quantized rational chip-firing

Abstract

This article introduces a quantized chip-firing model with close connections to the theory of rational lattice paths and rational parking functions. Given a graph with a sink and positive integers a,b,c with gcd(a,b)=1, a set S of vertices fires by the following rule. Each vertex in S provisionally sends c chips to the sink and a/b chips to each non-sink neighbor outside of S. The novel feature is that the total number of chips leaving from or arriving at any vertex gets rounded down to the nearest integer before being finalized. We define the notions of chip configurations being superstable, k-stable, or k-skeletal in this model. When c=1 and the graph is complete, superstable configurations correspond to rational parking functions. There is a bijection between superstable configurations and k-skeletal configurations for each k. We establish these results by building a combinatorial theory of k-skeletal rational lattice paths (both unlabeled and labeled) and translating that theory to chip configurations. There is a group structure on the set of chip configurations modulo firing and borrowing moves. We show that this group is isomorphic to the product of b-1 copies of the integers modulo a; and, for each k, each coset of chip configurations in this group contains a unique k-skeletal representative.

Figures (6)

• Figure 1: Labeled path $P=\textsc{lpath}(D)$ for $D=202$.
• Figure 2: The graph from Example \ref{['ex:stab']}. The black edges between non-sink vertices have capacity $2/5$ each. The gray, dotted edges incident with the sink vertex $0$ have capacity $1$ each.
• Figure 3: An $(8,5)$-Dyck path with levels of lattice points marked.
• Figure 4: Example illustrating Lemma \ref{['lem:special-borrow']}.
• Figure 5: The labeled paths for $22500$ and $44022$.

Theorems & Definitions (57)

• Remark 1
• Example 2
• Example 3
• Example 4
• Theorem 5
• Example 6
• Example 7
• Theorem 8
• Theorem 9
• Remark 10