Lattice of Integer Flows and Poset of Strongly Connected Orientations

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages

Scientific paper

We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic to the poset of strongly connected orientations of subgraphs of $G$. This confirms a recent conjecture of Caporaso and Viviani {Torelli Theorem For Graphs and Tropical Curves, Duke Math. J. 153(1) (2010), 129-171}. We also prove an analogue theorem for the lattice of integer cuts.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lattice of Integer Flows and Poset of Strongly Connected Orientations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lattice of Integer Flows and Poset of Strongly Connected Orientations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattice of Integer Flows and Poset of Strongly Connected Orientations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-597690

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.