Klivans's uniqueness conjecture for sandpile torsor structures on plane graphs
Let be a plane graph, meaning a planar graph equipped with a plane ribbon structure. A sandpile torsor structure assigns a free transitive action of the sandpile group to the spanning trees , independently of a choice of sink vertex. Klivans's conjecture. For plane graphs, there is only one sandpile torsor structure. The conjecture is motivated by the equivalence of the Bernardi and rotor-routing algorithms on plane graphs; in this paper, the authors make the notion precise through consistency and prove that there are exactly four consistent algorithms, all having the same structure as rotor-routing, thereby resolving the conjecture.
References
Status
- Solved: Samir Ganguly and Colin McDonough. Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs (Forum of Mathematics, Sigma, 2024) https://www.cambridge.org/core/journals/forum-of-mathematics-sigma/article/rotorrouting-induces-the-only-consistent-sandpile-torsor-structure-on-plane-graphs/A8C65D5FD9642D264B6C6F48E6820DD9
Source: Ankan Ganguly and Alex McDonough, “Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs”, arXiv:2203.15079 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.