Javascript must be enabled to continue!

The Seven Dimensional Perfect Delaunay Polytopes and Delaunay Simplices

AbstractFor a lattice L of ℝn, a sphere S(c, r) of center c and radius r is called empty if for any v ∈ L we have. Then the set S(c, r) ∩ L is the vertex set of a Delaunay polytope P = conv(S(c, r) ∩ L). A Delaunay polytope is called perfect if any aõne transformation ø such that ø(P) is a Delaunay polytope is necessarily an isometry of the space composed with an homothety.Perfect Delaunay polytopes are remarkable structures that exist only if n = 1 or n ≥ 6, and they have shown up recently in covering maxima studies. Here we give a general algorithm for their enumeration that relies on the Erdahl cone. We apply this algorithm in dimension seven, which allows us to find that there are only two perfect Delaunay polytopes: 321, which is a Delaunay polytope in the root lattice E7, and the Erdahl Rybnikov polytope.We then use this classification in order to get the list of all types of Delaunay simplices in dimension seven and found that there are eleven types.

Canadian Mathematical Society

Mathieu Dutour Sikirić

Canadian Journal of Mathematics

2016

Title: The Seven Dimensional Perfect Delaunay Polytopes and Delaunay Simplices

Description:

AbstractFor a lattice L of ℝn, a sphere S(c, r) of center c and radius r is called empty if for any v ∈ L we have.

Then the set S(c, r) ∩ L is the vertex set of a Delaunay polytope P = conv(S(c, r) ∩ L).

A Delaunay polytope is called perfect if any aõne transformation ø such that ø(P) is a Delaunay polytope is necessarily an isometry of the space composed with an homothety.

Perfect Delaunay polytopes are remarkable structures that exist only if n = 1 or n ≥ 6, and they have shown up recently in covering maxima studies.

Here we give a general algorithm for their enumeration that relies on the Erdahl cone.

We apply this algorithm in dimension seven, which allows us to find that there are only two perfect Delaunay polytopes: 321, which is a Delaunay polytope in the root lattice E7, and the Erdahl Rybnikov polytope.

We then use this classification in order to get the list of all types of Delaunay simplices in dimension seven and found that there are eleven types.

Back

In the 1920s, B. N. Delaunay proved that the dual graph of the Voronoi diagram of a discrete set of points in a Euclidean space gives rise to a collection of simplices, whose circu...

Abstract Chiral Polytopes

Abstract polytopes are partially ordered sets that satisfy some key aspects of the face lattices of convex polytopes. They are chiral if they have maximal symmetry by combinatorial...

On hyperbolic Coxeter n-polytopes with n + 2 facets

Abstract A convex polytope admits a Coxeter decomposition if it is tiled by finitely many Coxeter polytopes such that any two tiles having a common facet are symmetr...

Factorization structures, cones, and polytopes

Abstract Factorization structures occur in toric differential and discrete geometry and can be viewed in multiple ways, e.g., as objects determining substantial classes of expli...

Quiver combinatorics and triangulations of cyclic polytopes

Motivated by higher homological algebra, we associate quivers to triangulations of even-dimensional cyclic polytopes and prove two results showing what information about the triang...

On the bond polytope

Abstract While the maximum cut problem and its corresponding polytope has received a lot of attention inliterature, comparably little is known about the natural clos...

Triangulations of cyclic polytopes

We give a new description of the combinatorics of triangulations of even-dimensional cyclic polytopes, and of their bistellar flips. We show that the tropical exchange relation gov...

Branes and polytopes

Abstract We investigate the hierarchies of half-supersymmetric branes in maximal supergravity theories. By studying the action of the Weyl gr...

Email:
Password:

Email:

The Seven Dimensional Perfect Delaunay Polytopes and Delaunay Simplices

Related Results