PreprintarXiv licencearXiv
Integer decomposition property of three-dimensional smooth polytopes: a shorter proof
Abstract
Oda's smoothness conjecture asserts that every smooth lattice polytope has the integer decomposition property. The three-dimensional case of this conjecture was recently proven by AI. Here we give a much shorter proof of this result.
Related
- 0/1 integer programming over polytopes of Chvátal rank one is as hard as lattice problems
- Skolem-Mahler-Lech in rings of positive characteristic: a shorter proof and a multi-dimensional generalization
- Accelerated Benders decomposition for bi-objective mixed integer programming
- Decomposition of Sparse Integer Programs via Nonlinear Edge Encodings and Column-and-Row Generation
- Compact Hyperbolic Coxeter Six-dimensional Polytopes With Ten Facets
BibTeX
@misc{curtis2026integer,
title = {{Integer decomposition property of three-dimensional smooth polytopes: a shorter proof}},
author = {Juliana Curtis and Gaku Liu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17270},
eprint = {2610.17270},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17270},
}
RIS
TY - UNPB
TI - Integer decomposition property of three-dimensional smooth polytopes: a shorter proof
AU - Juliana Curtis
AU - Gaku Liu
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.17270
UR - https://arxiv.org/abs/2610.17270
AB - Oda's smoothness conjecture asserts that every smooth lattice polytope has the integer decomposition property. The three-dimensional case of this conjecture was recently proven by AI. Here we give a much shorter proof of this result.
ER -