Koszul Algebras and Flow Lattices
Zsuzsanna Dancso, Anthony Licata
Abstract
We provide a homological algebraic realization of the lattices
of integer cuts and integer flows of graphs. To a finite
2-edge-connected graph with a spanning tree T, we
associate a finite dimensional Koszul algebra .
Under the construction, planar dual graphs with dual spanning
trees are associated Koszul dual algebras. The Grothendieck
group of the category of finitely-generated
-modules is isomorphic to the Euclidean lattice
, and we describe the sublattices of
integer cuts and integer flows on in terms of the
representation theory of . The grading on
gives rise to -analogs of the lattices of
integer cuts and flows; these -lattices depend
non-trivially on the choice of spanning tree. We give a
-analog of the matrix-tree theorem, and prove that the
-flow lattice of is isomorphic to the
-flow lattice of if and only if there is
a cycle preserving bijection from the edges of to
the edges of taking the spanning tree to
the spanning tree . This gives a -analog of a
classical theorem of Caporaso–Viviani and Su–Wagner.