Good Triangulations of Cosmological Polytopes
Aenne Benjes, Kamillo Ferry, Benjamin Schröter
TL;DR
The paper addresses how cosmological polytopes $\, ext{C}_G$ associated to graphs encode wavefunction data via their lattice-point structure. It develops a geometric-combinatorial framework of good unimodular triangulations, together with a half-open decomposition that directly relates the Ehrhart $h^ extast$-polynomial to graph-theoretic invariants. A key result expresses $h^ extast(\, ext{C}_G; z)$ as a Tutte polynomial specialization, yielding a deletion-contraction recurrence, ultra log-concavity of coefficients, and a compact volume formula $ ext{vol}( ext{C}_G)=2^m T_G(2,1)$. The approach unifies and extends prior results for multitrees and multicycles, provides exact enumerations of maximal simplices via decorated graphs, and connects the cosmological polytopes' Ehrhart theory to classical graph polynomials, with substantial implications for understanding the combinatorial structure of cosmological wavefunctions.
Abstract
Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus of interest shifted towards their mathematical properties, e.g., their face structure and triangulations. Juhnke, Solus and Venturello used toric geometry to show that these polytopes have a so-called good triangulation that is unimodular. Based on these results Bruckamp et al. studied the Ehrhart theory of those polytopes and in particular the h*-polynomials of cosmological polytopes of multitrees and multicycles. In this article we complete this part of the story. We enumerate all maximal simplices in good triangulations of any cosmological polytope. Furthermore, we provide a method to turn such a triangulation into a half-open decomposition from which we deduce that the h*-polynomial of a cosmological polytope is a specialization of the Tutte polynomial of the defining graph. This settles several open questions and conjectures of Juhnke, Solus and Venturello as well as Bruckamp et al.
