vix.ing · top · new · best · stats · spec

Is there a smooth lattice polytope which does not have the integer decomposition property?

2025/12/21 by Hofscheier, Johannes, Kasprzyk, Alexander
Computer Science · Mathematics · #13H10 #14M25 #52B20 (primary) #Advanced Combinatorial Mathematics #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #History and Overview (math.HO) #Point processes and geometric inequalities

paper · doi:10.48550/arxiv.2512.20680

openalex publication_date 2025/12/21 · openalex created_date 2025/12/24 · openalex updated_date 2026/07/28

Abstract

We introduce Tadao Oda's famous question on lattice polytopes which was originally posed at Oberwolfach in 1997 and, although simple to state, has remained unanswered. The question is motivated by a discussion of the two-dimensional case - including a proof of Pick's Theorem, which elegantly relates the area of a lattice polygon to the number of lattice points it contains in its interior and on its boundary.

Citations

Related