The seven dimensional perfect Delaunay polytopes and Delaunay simplices

From MaRDI portal
Publication:5371122

DOI10.4153/CJM-2016-013-7zbMATH Open1381.11054arXiv1505.03687OpenAlexW2962921885MaRDI QIDQ5371122FDOQ5371122


Authors: Mathieu Dutour Sikirić Edit this on Wikidata


Publication date: 24 October 2017

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Abstract: For a lattice L of Rn, a sphere S(c,r) of center c and radius r is called {em empty} if for any vinL we have VertvcVertgeqr. Then the set S(c,r)capL is the vertex set of a {em Delaunay polytope} P=conv(S(c,r)capL). A Delaunay polytope is called {em perfect} if any affine transformation phi such that phi(P) is a Delaunay polytope is necessarily an isometry of the space composed with an homothety. Perfect Delaunay polytopes are remarkable structure that exist only if n=1 or ngeq6 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 7 which allow us to find that there are only two perfect Delaunay polytopes: 321 which is a Delaunay polytope in the root lattice mathsfE7 and the Erdahl Rybnikov polytope. We then use this classification in order to get the list of all types Delaunay simplices in dimension 7 and found 11 types.


Full work available at URL: https://arxiv.org/abs/1505.03687




Recommendations





Cited In (11)





This page was built for publication: The seven dimensional perfect Delaunay polytopes and Delaunay simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371122)