Abstract
We continue the study of the lattice L n generated by cuts of the complete graph on a set V n of n vertices. The lattice L n spans an N= n 2 space of all functions defined on a set E n of all unordered pairs of the set V n . Baranovski proves that symmetric Delaunay polytopes of a lattice L are completely described by classes of the quotient 1 2 L L . We show that a class of the quotient 1 2 L n L n is uniquely determined by a subset S ⊆ V n and a class of switching equivalent sets A ⊆ E n . We describe minimal vectors of all classes of 1 2 L n L n . We completely describe L-partition of six-dimensional space into Delaunay polytopes of the lattice L 4 = √2 D 6 +.
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.
