Math 2.0

Convex and discrete geometry Lattices and geometry of numbers Conjecture

Voronoi's conjecture on parallelohedra

Builds on ParallelohedronVoronoi cellLattice (group)

Statement

Let d≥1d \ge 1 and let P⊂ℝdP \subset \R^d be a parallelohedron. Then there are a lattice Λ⊂ℝd\Lambda \subset \R^d and an affine bijection A ⁣:ℝd→ℝdA \colon \R^d \to \R^d such that A(P)A(P) is the Voronoi cell of Λ\Lambda.

Remarks

The converse holds: the Voronoi cell of every lattice is a parallelohedron. Voronoi proved the conjecture for primitive parallelohedra, those whose tiling has exactly d+1d + 1 tiles at each vertex. Delone proved it in dimensions d≤4d \le 4. Erdahl proved it for parallelohedra that are zonotopes. The general case is open.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Lattice (group) concept
  2. Parallelohedron concept
  3. Voronoi cell concept
  4. Voronoi's conjecture on parallelohedra conjecture

Further reading

  1. Web https://en.wikipedia.org/wiki/Parallelohedron
About this page
TagF03A4MKA5V
URIm2://F03A4MKA5V
Kindconjecture
WritingW0 stub
MSC52C22, 52B11, 11H06
StatusThis copy of the site has no build data. Run m2 status F03A4MKA5V.
AboutParallelohedron
UsesParallelohedron, Voronoi cell, Lattice (group)

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.