The adjacency-component conjecture for perfect Delaunay polytopes

Let PP and P1P_1 be perfect Delaunay polytopes for Zn\mathbb{Z}^n and call them adjacent when the quadratic rank of their common vertex set is 22. An adjacency component is a collection of perfect Delaunay nn-polytopes connected by a sequence in which every two consecutive members are adjacent. Adjacency-component conjecture. For any neNn e\in\mathbb{N}, all perfect Delaunay nn-polytopes belong to the same adjacency component. The conjecture is motivated by the authors' finding that, for each n8n\leq 8, all known perfect Delaunay nn-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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.