Abstract
AbstractThe purpose of this paper is to study convex bodies for which there exists no convex body of the same lattice width. Such bodies will 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 vertices and their lattice width is attained by at least independent directions. Strongly related to lattice reduced bodies are the ‘lattice complete bodies’, which are convex bodies for which there exists no such that has the same lattice diameter as . Similar structural results are obtained for lattice complete bodies. Moreover, various construction methods for lattice reduced and complete convex bodies are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
