Lattice of Integer Flows and the Poset of Strongly Connected Orientations for Regular Matroids
Abstract
A 2010 result of Amini provides a way to extract information about the structure of the graph from the geometry of the Voronoi polytope of the lattice of integer flows (which determines the graph up to two-isomorphism). Specifically, Amini shows that the face poset of the Voronoi polytope is isomorphic to the poset of strongly connected orientations of subgraphs. This answers a question raised by Caporaso and Viviani, and Amini also proves a dual result for integer cuts. In this paper we generalise Amini's result to regular matroids; in this context the theorem for integer cuts becomes a direct consequence of the theorem for integer flows, by making duality explicit as matroid duality.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.