- N. N. Andreev. "An Extremal Property of the Icosahedron." East J. Approx. 2 (1996), 459–462.
- N. N. Andreev. "Location of Points on a Sphere with Minimal Energy." Proc. Steklov Inst. Math. 219 (1997), 20–24.
- V. V. Arestov and A. G. Babenko. "On the Delsarte Scheme for Estimating Contact Numbers." Proc. Steklov Inst. Math. 219 (1997), 36–65.
- E. Bannai and N. J. A. Sloane. "Uniqueness of Certain Spherical Codes." Canad. J. Math. 33:2 (1981), 437–449.
- H. Cohn and A. Kumar. "Universally Optimal Distribution of Points on Spheres." J. Amer. Math. Soc. 20 (2007), 99–148.
- P. Delsarte, J. Goethals, and J. Seidel. "Spherical Codes and Designs." Geometriae Dedicata 6 (1977), 363–388.
- A. V. Kolushov and V. A. Yudin. "On the Korkin–Zolotarev Construction." Discrete Math. Appl. 4:2 (1994), 143–146.
- A. V. Kolushov and V. A. Yudin. "Extremal Dispositions of Points on the Sphere." Anal. Math. 23:1 (1997), 25–34.
- V. I. Levenshtein. "On Bounds for Packings in n-Dimensional Euclidean Space." Soviet Math. Dokl. 20 (1979), 417–421.
- A. M. Odlyzko and N. J. A. Sloane. "New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions." J. Combin. Theory Ser. A 26 (1979), 210–214.
- PARI/GP, version 2.1.7, Bordeaux. Available online (http://pari.math.u-bordeaux.fr/), 2005. http://pari.math.u-bordeaux.fr/
- A. Sali. "On the Rigidity of Spherical t-Designs That Are Orbits of Finite Reflection Groups." Des. Codes Cryptogr. 4 (1994), 157–170.
- N. J. A. Sloane, with the collaboration of R. H. Hardin, W. D. Smith, and others. "Tables of Spherical Codes." Available online (http://www.research.att.com/~njas/packings/), 2000. http://www.research.att.com/~njas/packings/
- N. J. A. Sloane, R. H. Hardin, and P. Cara. "Spherical Designs in Four Dimensions." In Proceedings of the 2003 IEEE Information Theory Workshop, pp. 253–258. Washington, DC: IEEE Press, 2003.
- D. V. Widder. The Laplace Transform. Princeton: Princeton University Press, 1941.
- V. A. Yudin. "Minimum Potential Energy of a Point System of Charges." Discrete Math. Appl. 3:1 (1993), 75–81.
The D4 Root System Is Not Universally Optimal
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.