arXiv · 2401.06111
The volume polynomial of lattice polygons
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.
Explore related subjects
Keep this discovery
Ivan Soprunov, Jenya Soprunova. 2024-01-11. The volume polynomial of lattice polygons. https://arxiv.org/abs/2401.06111
Cite the original work for its findings. Save a collection to share your selection of sources.