arXiv math/01081772001-08math.MG

The hypermetric cone on seven vertices

Mathieu Dutour, Michel Deza

备注：: 8 pages, 4 tables

英文摘要：

The hypermetric cone $HYP_n$ is the set of vectors $(d_{ij})_{1\leq i< j\leq n}$ satisfying the inequalities $\sum_{1\leq i<j\leq n} b_ib_jd_{ij}\leq 0 with b_i\in\Z and \sum_{i=1}^{n}b_i=1$. A Delaunay polytope of a lattice is called extremal if the only affine bijective transformations of it into a Delaunay polytope, are the homotheties; there is a correspondance between such Delaunay polytopes and extreme rays of $HYP_n$. We show that unique Delaunay polytopes of root lattice $A_1$ and $E_6$ are the only extreme Delaunay polytopes of dimension at most 6. We describe also the skeletons and adjacency properties of $HYP_7$ and of its dual.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The hypermetric cone on $8$ vertices and some generalizations

The lists of facets -- $298,592$ in $86$ orbits -- and of extreme rays -- $242,695,427$ in $9,003$ orbits -- of the hypermetric cone $HYP_8$ are computed. The first generalization considered is the hypermetric polytope $HYPP_n$ for which we give general algorithms and a description for $n\le 8$. Then we shortly consider generalizations to simplices of volume higher than $1$, hypermetric on graphs and infinite dimensional hypermetrics.

2015-03-16math.MG

Cones of weighted quasi-metrics, weighted quasi-hypermetrics and of oriented cuts

We show that the cone of weighted n-point quasi-metrics WQMet_n, the cone of weighted quasi-hypermetrics WHyp_n and the cone of oriented cuts OCut_n are projec- tions along an extreme ray of the metric cone Metn+1, of the hypermetric cone Hypn+1 and of the cut cone Cut_{n+1}, respectively. This projection is such that if one knows all faces of an original cone then one knows all faces of the projected cone.

2012-01-05math.MG

The decomposition of the hypermetric cone into L-domains

The hypermetric cone $\HYP_{n+1}$ is the parameter space of basic Delaunay polytopes in n-dimensional lattice. The cone $\HYP_{n+1}$ is polyhedral; one way of seeing this is that modulo image by the covariance map $\HYP_{n+1}$ is a finite union of L-domains, i.e., of parameter space of full Delaunay tessellations. In this paper, we study this partition of the hypermetric cone into L-domains. In particular, it is proved that the cone $\HYP_{n+1}$ of hypermetrics on n+1 points contains exactly {1/2}n! principal L-domains. We give a detailed description of the decomposition of $\HYP_{n+1}$ for n=…

2008-08-11math.COmath.MG

The isometries of the cut, metric and hypermetric cones

We show that the symmetry groups of the cut cone Cut(n) and the metric cone Met(n) both consist of the isometries induced by the permutations on {1,...,n}; that is, Is(Cut(n))=Is(Met(n))=Sym(n) for n>4. For n=4 we have Is(Cut(4))=Is(Met(4))=Sym(3)xSym(4). This is then extended to cones containing the cuts as extreme rays and for which the triangle inequalities are facet-inducing. For instance, Is(Hyp(n))=Sym(n) for n>4, where Hyp(n) denotes the hypermetric cone.

2003-06-02math.GRmath.MG

Adjacency method for extreme Delaunay polytopes

The {\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.

2004-01-02math.COmath.MG

The six-dimensional Delaunay polytopes

Given a lattice $L$, a full dimensional polytope $P$ is called a {\em Delaunay polytope} if the set of its vertices is $S\cap L$ with $S$ being an {\em empty sphere} of the lattice. Extending our previous work \cite{DD-hyp} on the {\em hypermetric cone} $HYP_7$, we classify the six-dimensional Delaunay polytopes according to their {\em combinatorial type}. The list of 6241 combinatorial types is obtained by a study of the set of faces of the polyhedral cone $HYP_7$.

2002-12-27math.COmath.MG

更多相关论文收起更多论文

The seven dimensional perfect Delaunay polytopes and Delaunay simplices

For a lattice $L$ of $R^n$, a sphere $S(c,r)$ of center $c$ and radius $r$ is called {\em empty} if for any $v\in L$ we have $\Vert v - c\Vert \geq r$. Then the set $S(c,r)\cap L$ is the vertex set of a {\em Delaunay polytope} $P=conv(S(c,r)\cap L)$. A Delaunay polytope is called {\em perfect} if any affine transformation $ϕ$ such that $ϕ(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 $n\geq 6$ and they have shown up recently in covering maxima studies. Here we give a…

2016-01-07math.MG