相关论文: Voronoi-Dickson Hypothesis on Perfect Forms and L-…
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…
We consider Voronoi's reduction theory of positive definite quadratic forms which is based on Delone subdivision. We extend it to forms and Delone subdivisions having a prescribed symmetry group. Even more general, the theory is developed…
G.F. Voronoi (1868-1908) wrote two memoirs in which he describes two reduction theories for lattices, well-suited for sphere packing and covering problems. In his first memoir a characterization of locally most economic packings is given,…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
The Voronoi cone decompositions has been attracting our attention in the compactification problem of the moduli scheme of abelian varieties. The objects to add as the boundary of the moduli scheme are stable quasi-abelian schemes, reduced…
Iso-edge domains are a variant of the iso-Delaunay decomposition introduced by Voronoi. They were introduced by Baranovskii & Ryshkov in order to solve the covering problem in dimension $5$. In this work we revisit this decomposition and…
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…
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…
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…
Voronoi defined two polyhedral partitions of the cone of se\mi\de\fi\nite forms into L-type domains and into perfect domains. Up to equivalence, there is only one domain that is simultaneously perfect and L-type. Voronoi called this domain…
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…
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}…
For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the…
We compare two rational polyhedral admissible decompositions of the cone of positive definite quadratic forms: the perfect cone decomposition and the 2nd Voronoi decomposition. We determine which cones belong to both the decompositions,…
We present an adaptation of Voronoi theory for imaginary quadratic number fields of class number greater than 1. This includes a characterisation of extreme Hermitian forms which is analogous to the classic characterisation of extreme…
In this paper we report on the full classification of Dirichlet-Voronoi polyhedra and Delaunay subdivisions of five-dimensional translational lattices. We obtain a complete list of $110244$ affine types (L-types) of Delaunay subdivisions…
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…
One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one can enumerate all rigid positive semidefinite quadratic…
In 1908, Voronoi introduced an algorithm that solves the lattice packing problem in any dimension in finite time. Voronoi showed that any lattice with optimal packing density must be a so-called perfect lattice, and his algorithm enumerates…
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…