A Note on Lattice Packings via Lattice Refinements

References

• [Aggarwal et al. 15] D. Aggarwal, D. Dadush and Noah Stephens-Davidowitz. “Solving the Closest Vector Problem in 2n Time the Discrete Gaussian Strikes Again!” arXiv:1504.01995, 2015.
   Google Scholar
• [Ball 92] K. Ball. “A Lower Bound for the Optimal Density of Lattice Packings.” Int. Math. Res. Not. 1992:10 (1992), 217–221.
   Google Scholar
• [Banaszczyk 90] W. Banaszczyk. “On the Lattice Packing–Covering Ratio of Finite-Dimensional Normed Spaces.” Colloq. Math. 59:1 (1990), 31–33.
   Google Scholar
• [Betke and Henk 00] U. Betke and M. Henk. “Densest Lattice Packings of 3-polytopes.” Comput. Geom. 16:3 (2000), 157–186.
   Web of Science ®Google Scholar
• [Bourgain 87] J. Bourgain. “On Lattice Packing of Convex Symmetric Sets in .” In Lecture Notes in Mathematics Vol. 1267, edited by J. Lindenstrauss and Vitali D. Milman, pp. 5–12. Springer Berlin Heidelberg, 1987.
   Google Scholar
• [Butler 72] G.J. Butler. “Simultaneous Packing and Covering in Euclidean Space.” Proc. London Math. Soc. 25:3 (1972), 721–735.
   Google Scholar
• [Carothers 05] N.L. Carothers. A Short Course on Banach Space Theory. Cambridge, UK: Cambridge University Press, 2005.
   Google Scholar
• [Cassels 97] J.W.S. Cassels. An Introduction to the Geometry of Numbers. Corrected reprint of the 1971 edition. Berlin, Germany: Springer, 1997.
   Google Scholar
• [Cheng 15] Sh. Cheng. “Improvement on Asymptotic Density of Packing Families Derived From Multiplicative Lattices.” Finite Fields Appl. 36 (2015), 133–150.
   Web of Science ®Google Scholar
• [Clarkson 36] J.A. Clarkson. “Uniformly Convex Spaces.” Trans. Am. Math. Soc. 40:3 (1936), 396–414.
   Google Scholar
• [Cohn 02] H. Cohn. “New Upper Bounds on Sphere Packings. II.” Geom. Topol. 6 (2002), 329–353.
   Web of Science ®Google Scholar
• [Cohn and Elkies 03] H. Cohn and N.D. Elkies. “New Upper Bounds on Sphere Packings I.” Ann. Math. (2) 157 (2003), 689–714.
   Web of Science ®Google Scholar
• [Cohn and Kumar 09] H. Cohn and A. Kumar. “Optimality and Uniqueness of the Leech Lattice Among Lattices.” Ann. Math. (2) 170:3 (2009), 1003–1050.
   Web of Science ®Google Scholar
• [Cohn and Zhao 14] H. Cohn and Y. Zhao. “Sphere Packing Bounds via Spherical Codes.” Duke Math. J. 163:10 (2014), 1965–2002.
   Web of Science ®Google Scholar
• [Cohn et al. 16] H. Cohn, A. Kumar, S.D. Miller, D. Radchenko and M.S. Viazovska. “The Sphere Packing Problem in Dimension 24.” arXiv:1603.06518.
   Google Scholar
• [Conway and Sloane 82] J.H. Conway and N.J.A. Sloane. “Fast Quantizing and Decoding Algorithms for Lattice Quantizers and Codes.” IEEE Trans. Inform. Theory 28:2 (1982), 227–232.
   Web of Science ®Google Scholar
• [Conway and Sloane 99] J.H. Conway and N.J.A. Sloane. Sphere Packings, Lattices and Groups. Third edition. New York: Springer, 1999.
   Google Scholar
• [Dadush 15] D. Dadush. “Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings.” SOCG. 2015. to appear.
   Google Scholar
• [Davenport 52] H. Davenport. “The Covering of Space by Spheres.” Rend. Circ. Mat. Palermo (2) 1 (1952), 92–107.
   Google Scholar
• [de Laat et al. 14] D. de Laat, F.M. de Oliveira Filho, and F. Vallentin. “Upper Bounds for Packings of Spheres of Several Radii.” Forum Math. Sigma 2:e23 (2014), 42.
   Google Scholar
• [de Laat and Vallentin 15] D. de Laat and F. Vallentin. “A Semidefinite Programming Hierarchy for Packing Problems in Discrete Geometry.” Math. Prog. Ser. B 151:2 (2015), 529–553.
   Web of Science ®Google Scholar
• [Dutour Sikirić et al. 07] M. Dutour Sikirić, A. Schürmann, and F. Vallentin. “Classification of Eight-dimensional Perfect Forms.” Electron. Res. Announc. Am. Math. Soc. 13 (2007), 21–32 ( electronic).
   Google Scholar
• [Dutour Sikirić et al. 08] M. Dutour Sikirić, A. Schürmann, and F. Vallentin. “A Generalization of Voronoi’s Reduction Theory and Its Application.” Duke Math. J. 142 (2008), 127–164.
   Web of Science ®Google Scholar
• [Elkies 91] N.D. Elkies, A.M. Odlyzko, and J.A. Rush. “On the Packing Densities of Superballs and Other Bodies.” Invent. Math. 105:3 (1991), 613–639.
   Web of Science ®Google Scholar
• [Fejes Tóth et al. 15] G. Fejes Tóth, F. Fodor, and V. Vígh. “The Packing Density of the n-dimensional Cross-polytope.” Discrete Comput. Geom. 54:1 (2015), 182–194.
   Web of Science ®Google Scholar
• [Gaborit and Zémor 07] Ph. Gaborit and G. Zémor. “On the Construction of Dense Lattices with a Given Automorphisms Group.” Ann. Inst. Fourier (Grenoble) 57:4 (2007), 1051–1062.
   Web of Science ®Google Scholar
• [Gruber 07] P.M. Gruber. Convex and Discrete Geometry. Berlin, Germany: Springer, 2007.
   Google Scholar
• [Gruber and Lekkerkerker 87] P.M. Gruber and C.G. Lekkerkerker. Geometry of Numbers. Second edition. North-Holland, Amsterdam, 1987.
   Google Scholar
• [Hales et al. 15] Th. C. Hales, et al. “A Formal Proof of the Kepler Conjecture.” arXiv:1501.02155, 2015.
   Google Scholar
• [Hanrot et al. 11] G. Hanrot, X. Pujol and D. Stehlé. “Algorithms for the Shortest and Closest Lattice Vector Problems.” In Coding and Cryptology, Lecture Notes in Comput. Sci. Vol. 6639, edited by Yeow Meng Chee, Zhenbo Guo, San Ling, Fengjing Shao, Yuansheng Tang, Huaxiong Wang and Chaoping Xing, pp. 159–190. Heidelberg, Germany: Springer, 2011.
   Google Scholar
• [Henk 95] M. Henk. Finite and Infinite Packings. Habilitationsschrift: Universität Siegen, 1995.
   Google Scholar
• [Jiao et al. 09] Y. Jiao, F.H. Stillinger, and S. Torquato. “Optimal Packings of Superballs.” Phys. Rev. E 79:041309 (2009).
   Google Scholar
• [Kabatjanskiĭ and Levenšteĭn 78] G.A. Kabatjanskiĭ and V.I. Levenšteĭn. “Bounds for Packings on the Sphere and In Space.” Problemy Peredači Informacii 14:1 (1978), 3–25.
   Google Scholar
• [Litsyn and Tsfasman 87] S.N. Litsyn and M.A. Tsfasman. “Constructive High-dimensional Sphere Packings.” Duke Math. J. 54:1 (1987), 147–161.
   Web of Science ®Google Scholar
• [Marcotte and Torquato 13] E. Marcotte and S. Torquato. “Efficient Linear Programming Algorithm to Generate the Densest Lattice Sphere Packings.” Phys. Rev. E. 87:063303 (2013).
   Google Scholar
• [Micciancio 04] D. Micciancio. “Almost Perfect Lattices, The Covering Radius Problem, and Applications to Ajtai’s Connection Factor.” SIAM J. Comput. 34:1 (2004), 118–169, ( electronic).
   Web of Science ®Google Scholar
• [Nebe and Sloane] G. Nebe and N. Sloane. “A Catalogue of Lattices.” http://www.math.rwth-aachen.de/Gabriele.Nebe/LATTICES/.
   Google Scholar
• [Rogers 50] C.A. Rogers. “A Note on Coverings and Packings.” J. London Math. Soc. 25 (1950), 327–331.
   Google Scholar
• [Rogers 84] C.A. Rogers. “Lattices in Banach Spaces.” Mitt. Math. Sem. Giessen 165:III (1984), 155–167.
   Google Scholar
• [Rosenbloom and Tsfasman 90] M.Y. Rosenbloom and M.A. Tsfasman. “Multiplicatice Lattices in Global Fields.” Invent. Math. 101:1 (1990), 687–696.
   Google Scholar
• [Rush 89] J.A. Rush. “A Lower Bound on Packing Density.” Invent. Math. 98:3 (1989), 499–509.
   Web of Science ®Google Scholar
• [Schürmann 09] A. Schürmann. Computational Geometry of Positive Definite Quadratic Forms. Providence, RI: American Mathematical Society, 2009.
   Google Scholar
• [Swanepoel 09] K.J. Swanepoel. “Simultaneous Packing and Covering in Sequence Spaces.” Discrete Comput. Geom. 42:2 (2009), 335–340.
   Web of Science ®Google Scholar
• [Torquato and Jiao 09] S. Torquato and Y. Jiao. “Dense Packings of Polyhedra: Platonic and Archimedean Solids.” Phys. Rev. E 80:041104 (2009).
   Google Scholar
• [Torquato and Jiao 10] S. Torquato and Y. Jiao. “Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming.” Phys. Rev. E (3) 82:6 (2010) 14, 061302.
   Web of Science ®Google Scholar
• [Vallentin] F. Vallentin. shvec. http://www.math.uni-magdeburg.de/lattice_geometry/.
   Google Scholar
• [Venkatesh 13] A. Venkatesh. “A Note on Sphere Packings in High Dimension.” Int. Math. Res. Not. IMRN 7 (2013), 1628–1642.
   Google Scholar
• [Viazovska 16] M.S. Viazovska. “The Sphere Packing Problem in Dimension 8.” arXiv:1603.04246, 2016.
   Google Scholar
• [Zong 02] Ch. Zong. “Simultaneous Packing and Covering in the Euclidean Plane.” Monatsh. Math. 134:3 (2002), 247–255.
   Web of Science ®Google Scholar
• [Zong 03] Ch. Zong. “Simultaneous Packing and Covering in Three-dimensional Euclidean Space.” J. London Math. Soc. (2), 67:29–40, 2003.
   Google Scholar
• [Zong 08] Ch. Zong. “The Simultaneous Packing and Covering Constants in the Plane.” Adv. Math. 218:3 (2008), 653–672.
   Web of Science ®Google Scholar