paper

The volume polynomial of lattice polygons

arXiv:2401.06111

Abstract

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an application, we show how to construct a pair of planar tropical curves (or a pair of divisors on a toric surface) with given intersection number and self-intersection numbers.

12 pages, 5 figures, to appear in Proceedings of AMS

The volume polynomial of lattice polygons · wovepaper