These icons are available under the CC BY-SA 4.0 license. Please feel free to use them to classify your own content.
The vector icons can be downloaded here.
Is there a smooth lattice polytope which does not have the integer decomposition property?
Snapshots of modern mathematics from Oberwolfach
Is there a smooth lattice polytope which does not have the integer decomposition property?
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.
If you are interested in translating this Snapshot, please contact us at info@imaginary.org
Mathematical subjects
Algebra and Number Theory
Discrete Mathematics and Foundations
Geometry and Topology
License
DOI (Digital Object Identifier)
10.14760/SNAP-2025-008-EN
Download PDF
snapshots: overview
Mathematical subjects
Algebra and Number Theory
Analysis
Didactics and Education
Discrete Mathematics and Foundations
Geometry and Topology
Numerics and Scientific Computing
Probability Theory and Statistics
Connections to other fields
Chemistry and Earth Science
Computer Science
Engineering and Technology
Finance
Humanities and Social Sciences
Life Science
Physics
Reflections on Mathematics