Stability conditions and subdivisions of Lawrence polytopes
Natasha Crepeau
Source abstract
Let be a nodal curve, and be the graph dual to . A stability condition on a graph is an assignment of integers to the biconnected subsets of vertices of satisfying some desired properties. Stability conditions yield degeneracy sets, which are certain collections of biconnected subsets of , but degeneracy sets can also be described without a reference stability condition. We show that the degeneracy sets of a graph correspond to the single-element extensions of the graphic matroid . Some single-element extensions of the graphic matroid can be oriented to be single-element extensions of the oriented graphic matroid . 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 from subdivisions of the Lawrence polytope of the cographic matroid . Finally, we show that any degeneracy set of a graph that has the set of all biconnected subsets of as a lower bound in the poset of degeneracy sets corresponds to an orientable extension of .
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.