论文信息 - A Short Solution of the Kissing Number Problem in Dimension Three - 字舞流文

A Short Solution of the Kissing Number Problem in Dimension Three

In this note, we give a short solution of the kissing number problem in dimension three.

Alexey Glazyrin

[1] J. Seidel,et al. Spherical codes and designs , 1977 .

[2] Florian Pfender,et al. Improved Delsarte bounds for spherical codes in small dimensions , 2005, J. Comb. Theory, Ser. A.

[3] K. Böröczky. The Newton-Gregory Problem Revisited , 2003 .

[4] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[5] J. Seidel,et al. SPHERICAL CODES AND DESIGNS , 1991 .

[6] Kurt M. Anstreicher. The Thirteen Spheres: A New Proof , 2004, Discret. Comput. Geom..

[7] O. Musin. The kissing number in four dimensions , 2003, math/0309430.

[8] Hiroshi Maehara. The problem of thirteen spheres - a proof for undergraduates , 2007, Eur. J. Comb..

[9] John Leech,et al. The Problem of the Thirteen Spheres , 1956, The Mathematical Gazette.

[10] B. L. Waerden,et al. Das Problem der dreizehn Kugeln , 1952 .

[11] P. Delsarte. AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[12] N. J. A. Sloane,et al. New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions , 1979, J. Comb. Theory, Ser. A.

[13] Oleg R. Musin. The Kissing Problem in Three Dimensions , 2006, Discret. Comput. Geom..

[14] Martin Aigner,et al. The problem of the thirteen spheres , 1998 .