How to compute the rank of a Delaunay polytope

Simple item page
dc.creatorSikiric, Mathieu Dutour
dc.creatorGrishukhin, Viatcheslav
dc.date2005-12-09
dc.date.accessioned2026-07-07T06:54:59Z
dc.date.available2026-07-07T06:54:59Z
dc.descriptionRoughly speaking, the rank of a Delaunay polytope (first introduced in \cite{DGL92}) is its number of degrees of freedom. In \cite{DL}, a method for computing the rank of a Delaunay polytope $P$ using the hypermetrics related to $P$ is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics is given. This method is applied to classical Delaunay polytopes. Then, we give an example of a Delaunay polytope, which does not have any affine basis.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0512193
dc.identifierhttp://arxiv.org/abs/math/0512193
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106143
dc.subjectCombinatorics
dc.titleHow to compute the rank of a Delaunay polytope
dc.typetext

Files

Collections

arXiv