Triangulations of Cayley and Tutte polytopes

详细信息    查看全文

• 作者：Matja? Konvalinka ; Igor Pak
• 关键词：Cayley polytope ; Tutte polytope ; Volume ; Tutte polynomial ; Bijective proof ; Neighbors-first search
• 刊名：Advances in Mathematics
• 出版年：2013
• 出版时间：1 October, 2013
• 年：2013
• 卷：245
• 期：Complete
• 页码：1-33
• 全文大小：497 K

文摘

Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun¡¯s conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs. We extend this result to two one-variable deformations of Cayley polytopes (which we call -Cayley and -Gayley polytopes), and to the most general two-variable deformations, which we call Tutte polytopes. The volume of the latter is given via an evaluation of the Tutte polynomial of the complete graph.

Our approach is based on an explicit triangulation of the Cayley and Tutte polytopes. We prove that simplices in the triangulations correspond to labeled trees. The heart of the proof is a direct bijection based on the neighbors-first search graph traversal algorithm.