2000 character limit reached
Classification of lattice polytopes with small volumes
Published 1 Aug 2017 in math.CO | (1708.00413v4)
Abstract: In the frame of a classification of general square systems of polynomial equations solvable by radicals, Esterov and Gusev succeeded in classifying all spanning lattice polytopes whose normalized volumes are at most $4$. In the present paper, we complete to classify all lattice polytopes whose normalized volumes are at most $4$ based on the known classification of their $\delta$-polynomials.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.