Lattice Reduced and Complete Convex Bodies

TL;DR

This paper investigates lattice reduced and complete convex bodies, establishing their structural properties, bounds on vertices, and directions of lattice width, with implications for integer programming and lattice theory.

Contribution

It introduces the concepts of lattice reduced and complete bodies, proves their structural properties, and provides construction methods, advancing understanding in lattice geometry and integer programming.

Findings

Lattice reduced bodies are polytopes with at most 2^{d+1}-2 vertices.

Lattice width is attained by at least Ω(log d) independent directions.

Structural properties of lattice complete bodies are similarly characterized.

Abstract

The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the flatness constant in integer programming, as well as other problems related to lattice width. We show that any simplex that realizes the flatness constant must be lattice reduced and prove structural properties of general lattice reduced convex bodies: they are polytopes with at most $2^{d+1}-2$ vertices and their lattice width is attained by at least $\Omega(\log d)$ independent directions. Strongly related to lattice reduced bodies are the ``lattice complete bodies'', which are convex bodies $C$ for which there exists no $C^\prime\supsetneq C$ such that $C^\prime$ has the same lattice diameter as $C$. Similar structural results are obtained for lattice complete bodies. Moreover, various construction methods for lattice reduced and complete convex bodies are presented.