Abstract
The problem of determining the greatest density to which n-dimensional space can be filled by nonoverlapping unit spheres is solved only for the first three values of n (namely n = 0,1,2), and so we must impose further conditions if we are to make any progress at the moment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Birkhäser Verlag, Basel, Switzerland
About this paper
Cite this paper
Conway, J.H. (1995). Sphere Packings, Lattices, Codes, and Greed. In: Chatterji, S.D. (eds) Proceedings of the International Congress of Mathematicians. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-9078-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-0348-9078-6_7
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9897-3
Online ISBN: 978-3-0348-9078-6
eBook Packages: Springer Book Archive