Baker and Wang's conjecture on Bernardi and rotor-routing actions
Baker and Wang's conjecture on Bernardi and rotor-routing actions
Let be a nonplanar ribbon graph with no multiple edges and no loops. The graph has a cyclic ordering of the edges incident to each vertex, and and denote respectively the rotor-routing and Bernardi actions of the degree-zero Picard group on the set of spanning trees of .
Baker and Wang's conjecture. There exists a vertex of such that
For planar ribbon graphs, the two actions define the same torsor structure and are independent of the base vertex. This conjecture asserts that for every nonplanar ribbon graph without multiple edges or loops, the two actions differ for at least one choice of base vertex.
Sources & referencesView supporting material
Primary source
Farbod Shokrieh and Cameron Wright, “Torsor Structures on Spanning Trees”, arXiv:2103.10370 (2021).
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
Sign in to submit a solution.
No solutions have been posted yet.