The discrete Shephard conjecture for volume polynomials of two lattice polytopes
The discrete Shephard conjecture for volume polynomials of two lattice polytopes
Let be a degree form, where are non-negative integers satisfying
for all and . The discrete Shephard conjecture. There exist lattice polytopes such that
This is the discrete counterpart of Shephard's characterization of volume polynomials for pairs of convex bodies, whose coefficients satisfy log-concavity inequalities. The statement is confirmed for by the theorem cited in the source, while the general case remains open.
Sources & referencesView supporting material
Primary source
Ivan Soprunov and Jenya Soprunova, “The volume polynomial of lattice polygons”, arXiv:2401.06111 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.