Perfect Delaunay Polytopes in Low Dimensions

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.

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 …

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…

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…

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…

An Infinite Series of Perfect Quadratic Forms and Big Delaunay Simplexes in Z^n

George Voronoi (1908-09) introduced two important reduction methods for positive quadratic forms: the reduction with perfect forms, and the reduction with L-type domains. A form is perfect if can be reconstructed from all representations of its arithmetic minimum. Two forms have the same L-type if Delaunay tilings of their lattices are affinely equivalent. Delaunay (1937-38) asked about possible relative volumes of lattice Delaunay simplexes. We construct an infinite series of Delaunay simplexes of relative volume n-3, the best known as of now. This series gives rise to a new infintie series o…

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…

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…

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…

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…

Voronoi-Dickson Hypothesis on Perfect Forms and L-types

George Voronoi (1908, 1909) introduced two important reduction methods for positive quadratic forms: the reduction with perfect forms, and the reduction with L-type domains, often called domains of Delaunay type. The first method is important in studies of dense lattice packings of spheres. The second method provides the key tools for finding the least dense lattice coverings with equal spheres in lower dimensions. In his investigations Voronoi heavily relied on that in dimensions less than 6 the partition of the cone of positive quadratic forms into L-types refines the partition of this cone …

完美与几乎完美的齐次多胞形

Perfect and almost perfect homogeneous polytopes

本文在欧几里得空间中研究齐次多胞形的完美性与几乎完美性，分类了正多胞形和大部分半正多胞形，并构造了非正则齐次多胞形的例子。