Search arXiv⌕ Search

arXiv · math/0412320

Methods in the Local Theory of Packing and Covering Lattices

Abstract

In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely many, locally optimal lattices. For the lattice packing problem there are two classical algorithms going back to Minkowski and Voronoi. For the covering and for the packing-covering problem we propose new algorithms. Here we give a brief survey about these approaches. We report on some recent computer based computations where we were able to reproduce and partially extend the known classification of locally optimal lattices. Furthermore we found new record breaking covering and packing-covering lattices. We describe several methods with examples to show that a lattice is a locally optimal solution to one of the three problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Achill Schuermann, Frank Vallentin. 2008-09-26. Methods in the Local Theory of Packing and Covering Lattices. https://arxiv.org/abs/math/0412320

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↗