Return to Answer

I believe what you are seeking is sometimes known as a spherical packing or a spherical code. Here is the MathWorld article on the topic. Here is Neil Sloane's webpage on the topic, including "putative optimal packings" up to $n=130$ spheres. See also integer sequence A126195 for the "Conjectured values for maximal number of solid spheres of radius 1 that can be rolled all in touch with and on the outside surface of a sphere of radius $n$."

There are bounds, but no "analytical result" of the type for which you might be hoping.

Tangential Addendum. There is an interesting variant of the sphere-packing kissing number that seems little known, and for which the bounds are wide enough to invite further work. It is called Hornich's Problem: What is the fewest number of non-overlapping closed unit balls that can radially hide a unit ball $B$, in the sense that every ray from the center of $B$ intersects at least one of the surrounding balls? In $\mathbb{R}^3$, it is known that at least 30 balls are needed, and 42 suffice. So rather different than the kissing number 12!

Described on p.117 of Research Problems in Discrete Geometry, Brass, Peter, Moser, William O. J., Pach, János, 2005. (Springer book link.)

I believe what you are seeking is sometimes known as a spherical packing or a spherical code. Here is the MathWorld article on the topic. Here is Neil Sloane's webpage on the topic, including "putative optimal packings" up to $n=130$ spheres. See also integer sequence A126195 for the "Conjectured values for maximal number of solid spheres of radius 1 that can be rolled all in touch with and on the outside surface of a sphere of radius $n$."

There are bounds, but no "analytical result" of the type for which you might be hoping.

Tangential Addendum. There is an interesting variant of the sphere-packing kissing number that seems little known, and for which the bounds are wide enough to invite further work. It is called Hornich's Problem: What is the fewest number of non-overlapping closed unit balls that can radially hide a unit ball $B$, in the sense that every ray from the center of $B$ intersects at least one of the surrounding balls? In $\mathbb{R}^3$, it is known that at least 30 balls are needed, and 42 suffice. So rather different than the kissing number 12!

Described on p.117 of Research Problems in Discrete Geometry, Brass, Peter, Moser, William O. J., Pach, János, 2005. (Springer book link.)

I believe what you are seeking is sometimes known as a spherical packing or a spherical code. Here is the MathWorld article on the topic. Here is Neil Sloane's webpage on the topic, including "putative optimal packings" up to $n=130$ spheres. See also integer sequence A126195 for the "Conjectured values for maximal number of solid spheres of radius 1 that can be rolled all in touch with and on the outside surface of a sphere of radius $n$."

There are bounds, but no "analytical result" of the type for which you might be hoping.

Tangential Addendum. There is an interesting variant of the sphere-packing kissing number that seems little known, and for which the bounds are wide enough to invite further work. It is called Hornich's Problem: What is the fewest number of non-overlapping closed unit balls that can radially hide a unit ball $B$, in the sense that every ray from the center of $B$ intersects at least one of the surrounding balls? In $\mathbb{R}^3$, it is known that at least 30 balls are needed, and 42 suffice. So rather different than the kissing number 12!

Described on p.117 of Research Problems in Discrete Geometry, Brass, Peter, Moser, William O. J., Pach, János, 2005. ISBN: 978-0-387-23815-9

I believe what you are seeking is sometimes known as a spherical packing or a spherical code. Here is the MathWorld article on the topic. Here is Neil Sloane's webpage on the topic, including "putative optimal packings" up to $n=130$ spheres. See also integer sequence A126195 for the "Conjectured values for maximal number of solid spheres of radius 1 that can be rolled all in touch with and on the outside surface of a sphere of radius $n$."

There are bounds, but no "analytical result" of the type for which you might be hoping.

Tangential Addendum. There is an interesting variant of the sphere-packing kissing number that seems little known, and for which the bounds are wide enough to invite further work. It is called Hornich's Problem: What is the fewest number of non-overlapping closed unit balls that can radially hide a unit ball $B$, in the sense that every ray from the center of $B$ intersects at least one of the surrounding balls? In $\mathbb{R}^3$, it is known that at least 30 balls are needed, and 42 suffice. So rather different than the kissing number 12!

Described on p.117 of Research Problems in Discrete Geometry, Brass, Peter, Moser, William O. J., Pach, János, 2005. (Springer book link.)

I believe what you are seeking is sometimes known as a spherical packing or a spherical code. Here is the MathWorld article on the topic. Here is Neil Sloane's webpage on the topic, including "putative optimal packings" up to $n=130$ spheres. See also integer sequence A126195 for the "Conjectured values for maximal number of solid spheres of radius 1 that can be rolled all in touch with and on the outside surface of a sphere of radius $n$."

There are bounds, but no "analytical result" of the type for which you might be hoping.

Tangential Addendum. There is an interesting variant of the sphere-packing kissing number that seems little known, and for which the bounds are wide enough to invite further work. It is called Hornich's Problem: What is the fewest number of non-overlapping closed unit balls that can radially hide a unit ball $B$, in the sense that every ray from the center of $B$ intersects at least one of the surrounding balls? In $\mathbb{R}^3$, it is known that at least 30 balls are needed, and 42 suffice. So rather different than the kissing number 12!

Described on p.117 of Research Problems in Discrete Geometry, Brass, Peter, Moser, William O. J., Pach, János, 2005. ISBN: 978-0-387-23815-9

I believe what you are seeking is sometimes known as a spherical packing or a spherical code. Here is the MathWorld article on the topic. Here is Neil Sloane's webpage on the topic, including "putative optimal packings" up to $n=130$ spheres. See also integer sequence A126195 for the "Conjectured values for maximal number of solid spheres of radius 1 that can be rolled all in touch with and on the outside surface of a sphere of radius $n$."

There are bounds, but no "analytical result" of the type for which you might be hoping.

Tangential Addendum. There is an interesting variant of the sphere-packing kissing number that seems little known, and for which the bounds are wide enough to invite further work. It is called Hornich's Problem: What is the fewest number of non-overlapping closed unit balls that can radially hide a unit ball $B$, in the sense that every ray from the center of $B$ intersects at least one of the surrounding balls? In $\mathbb{R}^3$, it is known that at least 30 balls are needed, and 42 suffice. So rather different than the kissing number 12!

Described on p.117 of Research Problems in Discrete Geometry, Brass, Peter, Moser, William O. J., Pach, János, 2005. ISBN: 978-0-387-23815-9