Adjacency method for extreme Delaunay polytopes

Simple item page
dc.creatorDutour, Mathieu
dc.date2004-01-02
dc.date.accessioned2026-07-07T05:04:19Z
dc.date.available2026-07-07T05:04:19Z
dc.descriptionThe {\em hypermetric cone} is defined as the cone of semimetrics satisfying the {\em hypermetric inequalities}. Every {\em Delaunay polytope} corresponds to a ray of this polyhedral cone. The Delaunay polytopes, which correspond to extreme rays are called {\em extreme}. We use this polyhedral cone and the {\em closest vector problem} to present a new technique that allow to find, from a given extreme Delaunay polytope, some new ones. Then, we show some examples of applications of this technique in low-dimensions.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0401004
dc.identifierhttp://arxiv.org/abs/math/0401004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69761
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.titleAdjacency method for extreme Delaunay polytopes
dc.typetext

Files

Collections

arXiv