Papers
Topics
Authors
Recent
2000 character limit reached

The mixed degree of families of lattice polytopes (1708.03250v1)

Published 10 Aug 2017 in math.CO

Abstract: The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently, Esterov and Gusev gave a complete classification result of families of $n$ lattice polytopes in $\mathbb{R}n$ whose mixed volume equals one. Here, we give a reformulation of their result involving the novel notion of a mixed degree that generalizes the degree similar to how the mixed volume generalizes the volume. We discuss and motivate this terminology, and explain why it extends a previous definition of Soprunov. We also remark how a recent combinatorial result due to Bihan solves a related problem posed by Soprunov.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.