Summary
If ℋ\( \subseteq\) ℝnis a bounded, convex body which is symmetric through each of the coordinate hyperplanes, then there exist codes which give rise, via Construction A of Leech and Sloane, to lattice-packings of ℋ whose density Δ satisfies the logarithmic Minkowski-Hlawka bound, lim\(\inf _{n \to \infty } \log _2 \sqrt[n]{\Delta } \geqq - 1\). This follows as a corollary of our main result, Theorem 9, a general way of obtaining lower bounds on the lattice-packing densities of various bodies. Unfortunately, whenn is at all large, it is computationally prohibitive (although theoretically possible) to exhibit the arrangements explicitly.
Similar content being viewed by others
References
Cassels, J.W.S.: An Introduction to the Geometry of Numbers. New York, Berlin, Heidelberg: Springer, second printing, 1971
Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. New York, Berlin, Heidelberg: Springer, 1987
Gruber, P.M., Lekkerkerker, C.G.: Geometry of Numbers. North-Holland Amsterdam: Elsevier, 1987 (This is an updated version of [7].)
Hilbert, D.: Mathematische Probleme. Arch. Math. Phys. 3rd ser.1, 44–63, 213–237 (1901)
Hlawka, E.: Zur Geometrie der Zahlen. Math. Z.49, 285–312 (1943)
Leech, J., Sloane, N.J.A. Sphere packing and error-correcting codes. Can. J. Math.23, 718–745 (1971)
Lekkerkerker, C.G.: Geometry of Numbers. Groningen: Wolters-Noordhoff, 1969
Litsin, S.N., Tsfasman, M.A.: Algebraic-geometric and number-theoretic packings of spheres (in Russian). Uspekhi Mat. Nauk40, 185–186 (1985)
Mac Williams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam: Elsevier, 2nd printing, 1978
Minkowki, H.: Geometrie der Zahlen. I. Leipzig: B.G. Teubner, 1896
Minkowski, H.: Gesammelte Abhandlungen, Chelsea, N.Y. (reprint), 1969
Rogers, C.A.: Packing and Covering. University Press. Cambridge 1964
Rogers, C.A.: Existence Theorems in the Geometry of Numbers. Ann. Math.48, 994–1002 (1947)
Rush, J.A., Sloane, N.J.A.: An improvement to the Minkowski-Hlawka bound for packing superballs. Mathematika34, 8–18 (1987)
Sloane, N.J.A.: Self-dual codes and lattices, in Relations Between Combinatorics and Other Parts of Mathematics. Proc. Symp. Pure Math.34, 273–308 (1979)
Sloane, N.J.A.: Recent bounds for codes, sphere packings and related problems obtained by linear programming and other methods.Comtemp. Math. 9, 153–185 (1982)
Terras, A.: Harmonic Analysis on Symmetric Spaces and Applications. New York, Berlin, Heidelberg: Springer Vol I, 1985 and Vol II, 1988
Author information
Authors and Affiliations
Additional information
Preprints were entitled On Hilbert's eighteenth problem: Packing.
The final drafts of this paper were written with the support of the Seggie-Brown Research Fellowship, for which the author is grateful.
Rights and permissions
About this article
Cite this article
Rush, J.A. A lower bound on packing density. Invent Math 98, 499–509 (1989). https://doi.org/10.1007/BF01393834
Issue Date:
DOI: https://doi.org/10.1007/BF01393834