Indexed metadata

Stability conditions and subdivisions of Lawrence polytopes

Natasha Crepeau

Source record

Source: arXiv

Published: Sep 30, 2026

arXiv: 2610.00591

Open original source ↗

Source abstract

Let XX be a nodal curve, and GG be the graph dual to XX. A stability condition on a graph GG is an assignment of integers to the biconnected subsets of vertices of GG satisfying some desired properties. Stability conditions yield degeneracy sets, which are certain collections of biconnected subsets of GG, but degeneracy sets can also be described without a reference stability condition. We show that the degeneracy sets of a graph GG correspond to the single-element extensions of the graphic matroid M(G)M(G). Some single-element extensions of the graphic matroid M(G)M(G) can be oriented to be single-element extensions of the oriented graphic matroid M(G)\mathcal{M}(G). Single-element extensions of oriented matroids are in bijection with subdivisions of the Lawrence polytope of the dual oriented matroid. We construct stability conditions on GG from subdivisions of the Lawrence polytope of the cographic matroid M∗(G)\mathcal{M}^\ast(G). Finally, we show that any degeneracy set D\mathcal{D} of a graph GG that has the set of all biconnected subsets of GG as a lower bound in the poset of degeneracy sets corresponds to an orientable extension of M(G)M(G).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Stability conditions and subdivisions of Lawrence polytopes — Mathematical Frontier Network