Generalized break divisors and triangulations of Lawrence polytopes
Combinatorics
2025-05-16 v1
Abstract
Let be a connected graph of genus . The Picard group of degree , , is the set of equivalence classes of divisors on of degree , where two divisors are equivalent if one can be reached from the other through a sequence of chip-firing moves. We construct sets of representatives of the equivalence classes in by defining a function on the spanning trees of from a triangulation of the Lawrence polytope of the cographic matroid . Additionally, such sets of representatives correspond to stability conditions on the nodal curve dual to the graph . We show that that are constructed from regular triangulations of Lawrence polytope correspond to classical stability conditions, which are induced by generic real-valued divisors on .
Cite
@article{arxiv.2505.09719,
title = {Generalized break divisors and triangulations of Lawrence polytopes},
author = {Natasha Crepeau},
journal= {arXiv preprint arXiv:2505.09719},
year = {2025}
}