Good Triangulations of Cosmological Polytopes
Pith reviewed 2026-05-22 23:27 UTC · model grok-4.3
The pith
The h*-polynomial of a cosmological polytope is a specialization of the Tutte polynomial of the defining graph.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
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.
What carries the argument
The half-open decomposition constructed from a good triangulation of the cosmological polytope, which equates the h*-polynomial to a Tutte specialization by matching lattice-point enumerators.
If this is right
- The h*-polynomials can now be computed combinatorially from the graph for any cosmological polytope.
- All maximal simplices in good triangulations are explicitly described.
- Prior conjectures on face structure and Ehrhart polynomials are resolved.
Where Pith is reading between the lines
- The result suggests that other polytope invariants might admit similar graph-theoretic expressions.
- Techniques could generalize to polytopes associated with different classes of graphs or diagrams.
- It provides a bridge between polytope geometry and matroid theory via the Tutte polynomial.
Load-bearing premise
The half-open decomposition constructed from a good triangulation preserves the lattice-point counting data needed to equate the two polynomials.
What would settle it
Directly count the lattice points in a cosmological polytope for a small graph such as a tree or cycle to obtain its h*-polynomial and check whether it matches the predicted specialization of the Tutte polynomial; disagreement would disprove the claim.
read the original 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.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper enumerates all maximal simplices appearing in the good (unimodular) triangulations of cosmological polytopes associated to arbitrary graphs. It then supplies an explicit construction that converts any such triangulation into a half-open decomposition of the polytope and uses this decomposition to identify the h*-polynomial of the cosmological polytope with a specialization of the Tutte polynomial of the underlying graph, thereby settling several conjectures of Juhnke–Solus–Venturello and Bruckamp et al.
Significance. If the identification holds, the result supplies a concrete combinatorial bridge between the Ehrhart theory of cosmological polytopes and classical graph polynomials, yielding both a closed-form expression for the h*-polynomial and a new source of positivity and unimodality statements. The explicit enumeration of the simplices is itself a useful contribution that makes the good triangulations computationally accessible.
major comments (2)
- [§4] §4 (construction of the half-open decomposition): the argument that the half-open simplices cover precisely the same lattice points as the original polytope (with only boundary adjustments) is invoked to equate the two generating functions, yet the verification that interior lattice points are neither added nor lost under the half-open operation is not carried out in sufficient detail to confirm that the Ehrhart series is preserved. This step is load-bearing for the central h*-Tutte claim.
- [Theorem 5.3] Theorem 5.3 (main identification): the specialization of the Tutte polynomial is stated to equal the h*-polynomial, but the proof relies on the lattice-point preservation established in the preceding decomposition; without an independent check (e.g., via direct computation on a small multigraph where both sides can be enumerated by hand), the equality remains conditional on the decomposition step.
minor comments (2)
- [§4] Notation for the half-open simplices is introduced without a displayed definition of the precise boundary-removal rule; a short displayed equation would improve readability.
- [§3] The enumeration of maximal simplices is given in §3, but the correspondence between these simplices and the edges/vertices of the graph is not tabulated for a running example; adding such a table would make the construction easier to follow.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive comments on our manuscript. Below we respond point by point to the major comments and indicate the revisions we will make.
read point-by-point responses
-
Referee: [§4] §4 (construction of the half-open decomposition): the argument that the half-open simplices cover precisely the same lattice points as the original polytope (with only boundary adjustments) is invoked to equate the two generating functions, yet the verification that interior lattice points are neither added nor lost under the half-open operation is not carried out in sufficient detail to confirm that the Ehrhart series is preserved. This step is load-bearing for the central h*-Tutte claim.
Authors: We agree that the lattice-point preservation argument in §4 would benefit from greater explicitness. In the revised version we will expand the relevant paragraphs to include a direct verification that every interior lattice point of the cosmological polytope lies in precisely one half-open simplex and that no new interior points are introduced. The argument will rely on the unimodularity of the good triangulation together with the explicit description of the simplices given in §3; we will also record the boundary adjustments separately so that the equality of Ehrhart series follows immediately. revision: yes
-
Referee: [Theorem 5.3] Theorem 5.3 (main identification): the specialization of the Tutte polynomial is stated to equal the h*-polynomial, but the proof relies on the lattice-point preservation established in the preceding decomposition; without an independent check (e.g., via direct computation on a small multigraph where both sides can be enumerated by hand), the equality remains conditional on the decomposition step.
Authors: The proof of Theorem 5.3 proceeds through the half-open decomposition, so the referee’s observation is accurate. To supply an independent check we will add a short computational appendix containing explicit enumerations for two small cases (the single-edge multigraph and the 3-cycle multigraph). For each case we will list all lattice points of the cosmological polytope, compute the h*-polynomial directly, enumerate the maximal simplices, apply the specialization of the Tutte polynomial, and verify that the two polynomials coincide. This concrete verification will be independent of the general decomposition argument. revision: yes
Circularity Check
No significant circularity; independent enumeration and decomposition yield the h*-Tutte equivalence
full rationale
The paper relies on external prior results (Juhnke-Solus-Venturello for existence of good unimodular triangulations; Bruckamp et al. for partial Ehrhart data) but supplies its own enumeration of all maximal simplices and a new construction turning the triangulation into a half-open decomposition. The h*-polynomial equivalence to a Tutte specialization is then deduced directly from the lattice-point generating function of that decomposition. No equation or step reduces the claimed equality to a fitted parameter, self-defined quantity, or load-bearing self-citation; the central derivation therefore remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AbsoluteFloorClosure.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
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.
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
the h*-polynomial of a cosmological polytope is a specialization of the Tutte polynomial
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Forward citations
Cited by 1 Pith paper
-
Central limit theorems for high dimensional lattice polytopes: cosmological polytopes
Proves asymptotic expectations, variances, and quantitative CLTs for edge counts in cosmological polytopes from ER graphs via graph descriptions and discrete Malliavin-Stein method.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.