Families of lattice polytopes of mixed degree one

preprint2020arXivOpen access

Abstract

It has been shown by Soprunov that the normalized mixed volume (minus one) of an nn-tuple of nn-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined nn-tuples of mixed degree at most one to be exactly those for which this lower bound is attained with equality, and posed the problem of a classification of such tuples. We give a finiteness result regarding this problem in general dimension n≥4n \geq 4, showing that all but finitely many nn-tuples of mixed degree at most one admit a common lattice projection onto the unimodular simplex Δn−1Δ_{n-1}. Furthermore, we give a complete solution in dimension n=3n=3. In the course of this we show that our finiteness result does not extend to dimension n=3n=3, as we describe infinite families of triples of mixed degree one not admitting a common lattice projection onto the unimodular triangle Δ2Δ_2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.