English

Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs

Combinatorics 2017-05-04 v1 Geometric Topology

Abstract

Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is equivalent to the h-vector of any triangulation of Q. It follows that the interior polynomials of (V,E) and its transpose (E,V) agree. When G is a complete bipartite graph, our result recovers a well known hypergeometric identity due to Saalsch\"utz. It also implies that certain extremal coefficients in the Homfly polynomial of a special alternating link can be read off of an associated Floer homology group.

Keywords

Cite

@article{arxiv.1602.04449,
  title  = {Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs},
  author = {Tamás Kálmán and Alexander Postnikov},
  journal= {arXiv preprint arXiv:1602.04449},
  year   = {2017}
}

Comments

30 pages, 5 figures

R2 v1 2026-06-22T12:49:54.126Z