arXiv math/03051962003-05-14math.MGmath.CO

Infinite serie of extreme Delaunay polytopes

M. Dutour

备注：: 3 pages

英文摘要：

A Delaunay polytope $P$ is said to be {\em extreme} if the only (up to isometries) affine bijective transformations $f$ of $\R^n$, for which $f(P)$ is again a Delaunay polytope, are the homotheties. This notion was introduced in \cite{DGL92}; also some examples in dimension 1, 6, 7, 15, 16, 22, 23 were constructed and it was proved that in dimension less than 6 there are no extreme Delaunay polytopes, except the segment. In this note, for every $n\geq 6$ we build an extreme Delaunay polytope $ED_n$ of dimension $n$.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

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

Perfect prismatoids are lattice Delaunay polytopes

A perfect prismatoid is a convex polytope $P$ such that for every its facet $F$ the set $vert(P) \setminus vert(F)$ belongs to a supporting hyperplane $α\parallel F$. We prove that every perfect prismatoid is affinely equivalent to some $0/1$-polytope of the same dimension. (And therefore every perfect prismatoid is a lattice polytope.) Moreover, we prove that every perfect prismatoid is a lattice Delaunay polytope.

2014-05-30math.MG

Neighborly inscribed polytopes and Delaunay triangulations

We construct a large family of neighborly polytopes that can be realized with all the vertices on the boundary of any smooth strictly convex body. In particular, we show that there are superexponentially many combinatorially distinct neighborly polytopes that admit realizations inscribed on the sphere. These are the first examples of inscribable neighborly polytopes that are not cyclic polytopes, and provide the current best lower bound for the number of combinatorial types of inscribable polytopes (which coincides with the current best lower bound for the number of combinatorial types of poly…

2015-06-24cs.CGmath.COmath.MG

Perfect Delaunay Polytopes in Low Dimensions

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive quadratic functions on the n-dimensional integral lattice that can be recovered, up to a scale factor, from the representations of its minimum. We develop a structural theory of such polytopes and describe all known perfect Delaunay polytopes in dimensions one through eight. We suspect that this list is complete.

2007-02-06math.MGmath.NT

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

Perfect Delaunay Polytopes and Perfect Quadratic Functions on Lattices

A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the ellipsoid $E$ is uniquely determined by $D$, we call $D$ perfect. That is, a perfect Delaunay polytope is a lattice polytope with a circumscribing empty ellipsoid $E$, where the quadratic surface $\partial E$ both contains the vertices of $D$ and is determined by them. We have been able to construct infinite sequences of perfect Delaunay polytopes, one perfect polyt…

2006-12-30math.MGmath.NT

Universality theorems for inscribed polytopes and Delaunay triangulations

We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to Möbius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up to homotopy) it is a retract of the realization space of some inscribed neighborly (and simplicial) polytope. We also show that all algebraic extensions of $\mathbb{Q}$ are needed to coordinatize inscribed polytopes. These statements show that inscribed polytopes exhibit the Mnëv universality phenomenon. Via stereographic projections, these theorems have a dire…

2014-06-30cs.CGmath.AGmath.CO

Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes

We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex polytopes with the given boundary. We study the space of generalized convex polytopes and discover a relation with the weighted Delaunay triangulations of polyhedral surfaces. The existence of the deformation follows from the non-degeneracy of the Hessian of the total scalar curvature of a positively curved generalized convex polytope. The latter is shown to be e…

2006-09-15math.COmath.DGmath.MG

The hypermetric cone on seven vertices

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 a…

2002-04-07math.MG

Perfect Delaunay Polytopes and Perfect Inhomogeneous Forms

A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of D. An inhomogeneous quadratic form is called perfect if it is determined by such a circumscribing ''empty ellipsoid'' uniquely up to a scale factor. Perfect inhomogeneous forms are associated with perfect Delaunay polytopes in much the way that perfect homogeneous forms are associated with perfect point lattices. We have been able to construct some infinite …

2005-03-06cs.CCcs.CGmath.MG

Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics

Using the geodesic distance on the $n$-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in $\mathbb{R}^{n+1}$, so we also get the expected number of faces of a random inscribed polytope. We find that the expectati…

2017-05-08math.MGmath.PR

A New Algorithm in Geometry of Numbers

A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the previously used method. We have implemented and used our algorithm for finding perfect Delaunay polytopes in dimensions 6, 7, 8. Our findings lead to a new conjecture that sheds light on the structure of lattice Delaunay tilings.

2007-10-25math.MGmath.NT

Construction of the Voronoi Diagram and Secondary Polytope

A set S of n points in general position in R^d defines the unique Voronoi diagram of S. Its dual tessellation is the Delaunay triangulation (DT) of S. In this paper we consider the parabolic functional on the set of triangulations of S and prove that it attains its minimum at DT in all dimensions. The Delaunay triangulation of S is corresponding to a vertex of the secondary polytope of S. We proposed an algorithm for DT's construction, where the parabolic functional and the secondary polytope are used. Finally, we considered a discrete analog of the Dirichlet functional. DT is optimal for this…

2003-12-02math.MG

Explicit Construction of the Voronoi and Delaunay Cells of W(An) and W(Dn) Lattices and Their Facets

Voronoi and Delaunay (Delone) cells of the root and weight lattices of the Coxeter-Weyl groups W(an) and W(dn) are constructed. The face centered cubic (fcc) and body centered cubic (bcc)lattices are obtained in this context. Basic definitions are introduced such as parallelotope, fundamental simplex, contact polytope, root polytope, Voronoi cell, Delone cell, n-simplex, n-octahedron (cross polytope), n-cube and n-hemicube and their volumes are calculated. Voronoi cell of the root lattice is constructed as the dual of the root polytope which turns out to be the union of Delone cells. It is sho…

2018-08-23cond-mat.othermath-phmath.MG

Computational methods for cones and polytopes with symmetry

Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several methods which allow us to use symmetries for the computation of extreme rays and facets of cones. I give an algorithm for computing adjacencies using a linear programming approach. I give a complete description of the method of incidence, adjacency decomposition method and of the subcone method used for computing with symmetric cones.

2002-01-14math.COmath.MG

Even More Infinite Ball Packings from Lorentzian Root Systems

Boyd (1974) proposed a class of infinite ball packings that are generated by inversions. Later, Maxwell (1983) interpreted Boyd's construction in terms of root systems in Lorentz space. In particular, he showed that the space-like weight vectors correspond to a ball packing if and only if the associated Coxeter graph is of "level $2$." In Maxwell's work, the simple roots form a basis of the representations space of the Coxeter group. In several recent studies, the more general based root system is considered, where the simple roots are only required to be positively independent. In this paper,…

2015-09-21math.COmath.GRmath.MG