Sphere Packings, Lattices, Codes, and Greed

John H. Conway
Additional contact information
John H. Conway: Princeton University, Department of Mathematics

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 45-56 from Springer

Abstract: 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.

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9078-6_7

Ordering information: This item can be ordered from
http://www.springer.com/9783034890786

DOI: 10.1007/978-3-0348-9078-6_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().