Abstract
A two-distance set in Edis a point setXin thed-dimensional Euclidean space such that the distances between distinct points inXassume only two different non-zero values. Based on results from classical distance geometry, we develop an algorithm to classify, for a givend, all maximal (largest possible) two-distance sets in Ed. Using this algorithm we have completed the full classification for alld⩽7, and we have found one set in E8whose maximality follows from Blokhuis' upper bound on sizes ofs-distance sets. While in the dimensionsd⩽6 our classifications confirm the maximality of previously known sets, the results in E7and E8are new. Their counterpart in dimensiond⩾10 is a set of unit vectors with only two values of inner products in the Lorentz space Rd, 1. The maximality of this set again follows from a bound due to Blokhuis.
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.
