Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T19:57:10.338Z Has data issue: false hasContentIssue false

Uniqueness of Certain Spherical Codes

Published online by Cambridge University Press:  20 November 2018

Eiichi Bannai
Affiliation:
Ohio State University, Columbus, Ohio
N. J. A. Sloane
Affiliation:
Bell Laboratories, Murray Hill, New Jersey
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we show that there is essentially only one way of arranging 240 (resp. 196560) nonoverlapping unit spheres in R 8 (resp. R 24) so that they all touch another unit sphere, and only one way of arranging 56 (resp. 4600) spheres in R 8 (resp. R 24) so that they all touch two further, touching spheres. The following tight spherical t-designs are unique: the 5-design in Ω7, the 7-designs in Ω8 and Ω23, and the 11-design in Ω24. It was shown in [20] that the maximum number of nonoverlapping unit spheres in R 8 (resp. R 24) that can touch another unit sphere is 240 (resp. 196560). Arrangements of spheres meeting these bounds can be obtained from the E8 and Leech lattices, respectively. The present paper shows that these are the only arrangements meeting these bounds.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1981