The adjacency-component conjecture for perfect Delaunay polytopes
The adjacency-component conjecture for perfect Delaunay polytopes
Let and be perfect Delaunay polytopes for and call them adjacent when the quadratic rank of their common vertex set is . An adjacency component is a collection of perfect Delaunay -polytopes connected by a sequence in which every two consecutive members are adjacent. Adjacency-component conjecture. For any , all perfect Delaunay -polytopes belong to the same adjacency component. The conjecture is motivated by the authors' finding that, for each , all known perfect Delaunay -polytopes lie in one adjacency component; its general status is not resolved in the provided text.
Sources & referencesView supporting material
Primary source
Mathieu Dutour and Konstantin Rybnikov, “A New Algorithm in Geometry of Numbers”, arXiv:0710.4948 (2007).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.