Indexed metadata

Projected Brion's theorem

Matthew Dupraz, Leonid Monin

Source record

Source: arXiv

Published: Oct 28, 2026

arXiv: 2610.38674

Open original source ↗

Source abstract

We present an analogue of Brion's theorem for the projected integer-point transform. Brion's theorem writes the integer-point transform of a rational polyhedron PP as the sum of the rational functions associated to its vertex cones. The pushforward π∗π_* along a lattice projection ππ turns the transform of PP into the generating function of the numbers of lattice points in the fibres of ππ. We group the vertices of PP into contracted classes, generated by the edges whose direction ππ kills, and show that the sum of the rational functions associated to the vertex cones in a contracted class can be pushed forward along ππ, yielding a rational function decomposition of the projected integer-point transform. For a lattice polytope, the classes correspond to the connected components of the fixed locus of the associated toric variety under the action of a subtorus, and our formula resembles the localization formula for this subtorus. We use this decomposition to provide an explicit formula for the projected integer-point transform of a linear family of polytopes. We illustrate this result with families of Gelfand--Zetlin and string polytopes.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.