Search arXiv⌕ Search

arXiv · math/0405441

Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8

Abstract

We show that the Leech lattice gives a sphere covering which is locally least dense among lattice coverings. We show that a similar result is false for the root lattice E8. For this we construct a less dense covering lattice whose Delone subdivision has a common refinement with the Delone subdivision of E8. The new lattice yields a sphere covering which is more than 12% less dense than the formerly best known given by the lattice A8*. Currently, the Leech lattice is the first and only known example of a locally optimal lattice covering having a non-simplicial Delone subdivision. We hereby in particular answer a question of Dickson posed in 1968. By showing that the Leech lattice is rigid our answer is even strongest possible in a sense.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Achill Schuermann, Frank Vallentin. 2004-11-10. Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8. https://doi.org/10.1155/imrn.2005.1937

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The maximum volume polytope with nine vertices inscribed in the sphere

A classical problem in convex and discrete geometry asks for the convex polyhedron of greatest volume whose vertices are chosen from the unit sphere $\mathbb{S}^2$. For a prescribed number $N$ of vertices, the problem is known only in a small number of cases, namely $4\leq N\leq 8$ and $N=12$. In the case $N=9$, Wimmer showed in his Ph.D. thesis that the volume maximizer must be combinatorially equivalent to a triaugmented triangular prism. In this note, we complete the proof by determining the volume maximizer among all inscribed polytopes which are combinatorially equivalent to a triaugmented triangular prism. Consequently, every convex polyhedron with at most nine vertices on $\mathbb{S}^2$ has volume at most $3\sqrt{2\sqrt{3}-3}$, with equality, up to rotation, precisely for the ``symmetric'' triaugmented triangular prism whose vertex coordinates we compute exactly.

math.MG↗

No Connectedness Lemma for Alexandrov spaces

Since its introduction in 2003, Wilking's Connectedness Lemma has become a powerful tool in the study of manifolds with positive sectional curvature. In recent work of the authors, this has been extended to orbifolds. The purpose of this note is to exhibit counterexamples in the class of Alexandrov spaces for the Connectedness Lemma in both its ordinary and dual formulation. This answers a 2007 question of Wilking.

math.MG↗

Multiscale Closing Index (MCI) for measuring structural similarity between 2D point sets

We introduce Multi-scale Closing Index (MCI), a new dissimilarity measure for evaluating the alignment of two 2D point sets. MCI is bounded between 0 and 1 and is based on multiscale mathematical morphology operations, with smaller values indicating greater structural agreement. The measure was motivated by the need to assess the quality of registration between point sets representing cell populations in biological images. To evaluate its behaviour under controlled conditions, we generated synthetic point clouds from Perlin-noise-based spatial structures, following established approaches for simulating biologically plausible spatial organization. We assessed MCI between those point clouds and different transformed versions, obtained by local perturbation, point removal, translation, rotation and addition of impulsive noise. Across these experiments, the dissimilarity MCI increased gradually and consistently with perturbation severity, while showing a clear discontinuity between clouds originating from the same underlying spatial structure and point clouds generated from different structures. We further compared MCI with commonly used point-set distances, including Hausdorff-based measures and Sliced Wasserstein distance. These experiments show the ability of MCI to capture structural agreement and quantify deviations between point sets, highlighting its potential as a complementary metric for evaluating two-dimensional point-set registration.

math.MG↗