pith. sign in

arxiv: 1708.03250 · v1 · pith:K2GIXL76new · submitted 2017-08-10 · 🧮 math.CO

The mixed degree of families of lattice polytopes

classification 🧮 math.CO
keywords degreelatticemixedvolumeresultfamiliesgeneralizesnotion
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.