5
$\begingroup$

We have a sphere of radius $r$ in a $d$-dimensional space. What is the maximum amount of points that I can fit inside the sphere such as the distance between any pair of points is at least $r$? And strictly bigger than $r$?

I believe this is equivalent to packing d-dimensional spheres of radius r/2 inside a sphere of radius r.

If you have an idea on the order of the answer I would also appreciate it.

Thanks!

Related questions:

  • This question says that the number is 12 for d=3, what about for a general d?

  • As opposed to this question, I'm only concerned for points at distance $r$, not any arbitrary distance.

$\endgroup$
1
  • 1
    $\begingroup$ SPLAG has, among other goodies, extensive tables of what is known about kissing numbers in various dimensions. $\endgroup$ Nov 16, 2016 at 12:53

1 Answer 1

4
$\begingroup$

In general, I believe you are seeking the kissing number. In $d=2$, $6$ circles can touch a central $7$th, so $7$ points at pairwise distance $\ge r$ can be packed:


Kissing2D
In $d=3$, the kissing number is $12$, so you could surround one sphere with $12$, leading to $13$ (not $12$ as you say) points in the sphere each pair separated by at least $r$.

In dimension $d=4$, you would place the sphere centers at the vertices of the $24$-cell, and a $25$-th sphere in the center.


24-cell
In $d=24$, you could pack $196560+1$ points.

$\endgroup$
1
  • 1
    $\begingroup$ +1 in $d=8$ we have a similar very nice packing coming from the $E_8$ (aka Gosset) lattice: 240 neighbors at distance $1$ from the origin (as well as other points). $\endgroup$ Nov 16, 2016 at 12:44

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .