How to compute the rank of a Delaunay polytope
Combinatorics
2007-05-23 v1
Abstract
Roughly 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 using the hypermetrics related to 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.
Cite
@article{arxiv.math/0512193,
title = {How to compute the rank of a Delaunay polytope},
author = {Mathieu Dutour Sikiric and Viatcheslav Grishukhin},
journal= {arXiv preprint arXiv:math/0512193},
year = {2007}
}
Comments
13 pages