MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Kalman, Tamas; Postnikov, Alexander
Thumbnail
Download1602.04449.pdf (410.0Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Let G be a connected bipartite graph with colour classes E and V and root polytope Q. Regarding the hypergraph H=(V,E) induced by G, we prove that the interior polynomial of H 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 H and its transpose H=(E,V) agree. When G is a complete bipartite graph, our result recovers a well-known hypergeometric identity due to Saalschütz. 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.
Date issued
2017-01
URI
http://hdl.handle.net/1721.1/115992
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Proceedings of the London Mathematical Society
Publisher
Oxford University Press (OUP)
Citation
Kálmán, Tamás and Alexander Postnikov. “Root Polytopes, Tutte Polynomials, and a Duality Theorem for Bipartite Graphs.” Proceedings of the London Mathematical Society 114, 3 (January 2017): 561–588 © 2017 London Mathematical Society
Version: Original manuscript
ISSN
0024-6115
1234-5678

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.