Lattice Simplices with a Fixed Positive Number of Interior Lattice Points: A Nearly Optimal Volume Bound
From MaRDI portal
Publication:5115687
DOI10.1093/imrn/rny130zbMath1455.52010arXiv1710.08646OpenAlexW3038801735WikidataQ129771456 ScholiaQ129771456MaRDI QIDQ5115687
Jan Krümpelmann, Benjamin Nill, Gennadiy Averkov
Publication date: 17 August 2020
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.08646
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Polynomial optimization (90C23)
Related Items
Complexity of linear relaxations in integer programming ⋮ Equality case in Van der Corput's inequality and collisions in multiple lattice tilings