We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume m in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number of which is finite for fixed m. Following this algorithm, we enumerate all irreducible triples of normalized mixed volume up to 4 that are inclusion-maximal. This produces a classification of generic trivariate sparse polynomial systems with up to 4 solutions in the complex torus, up to monomial changes of variables. By a recent result of Esterov, this leads to a description of all generic trivariate sparse polynomial systems that are solvable by radicals.

The mixed discriminant of a family of point configurations can be considered as a generalization of the A-discriminant of one Laurent polynomial to a family of Laurent polynomials. Generalizing the concept of defectivity, a family of point configurations is called defective if the mixed discriminant is trivial. Using a recent criterion by Furukawa and Ito we give a necessary condition for defectivity of a family in the case that all point configurations are full-dimensional. This implies the conjecture by Cattani, Cueto, Dickenstein, Di Rocco, and Sturmfels that a family of n full-dimensional configurations in Z n is defective if and only if the mixed volume of the convex hulls of its elements is 1.

It has been shown by Soprunov that the normalized mixed volume (minus one) of an n-tuple of n-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined n-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 ≥ 4, showing that all but finitely many n-tuples of mixed degree at most one admit a common lattice projection onto the unimodular simplex ∆ n−1 . Furthermore, we give a complete solution in dimension n = 3. In the course of this we show that our finiteness result does not extend to dimension n = 3, as we describe infinite families of triples of mixed degree one not admitting a common lattice projection onto the unimodular triangle ∆ 2 .

No abstract

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum P 1 + • • • + P d of d-dimensional lattice polytopes is bounded from above by a function of order O(m 2 d ), where m is the mixed volume of the tuple (P 1 , . . . , P d ). This is a consequence of the well-known Aleksandrov-Fenchel inequality. Esterov also posed the problem of determining a sharper bound. We show how additional relations between mixed volumes can be employed to improve the bound to O(m d ), which is asymptotically sharp. We furthermore prove a sharp exact upper bound in dimensions 2 and 3. Our results generalize to tuples of arbitrary convex bodies with volume at least one.