How to compute the rank of a Delaunay polytope

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 $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.
13 pages

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/106143

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0512193
 http://arxiv.org/abs/math/0512193

Collections

arXiv