TOPICS
Search

Space Division by Spheres


SphereIntersections

The maximal number of regions into which three-dimensional space can be divided by n spheres, for n>=1, is

 N=1/3n(n^2-3n+8),

giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ... (Yaglom and Yaglom 1987, pp. 105-106).

The maximum is attained when every pair of spheres intersects in a circle, every triple intersects in two points, and no four have a common point. With no spheres, there is one region.

More generally, for n>=1 and d>=2, the maximal number of regions determined by n hyperspheres in d-dimensional Euclidean space is

 N_d(n)=2sum_(k=0)^d(n-1; k).

In particular, N_d(n)=2^n for 1<=n<=d+1 (F. M. Jackson, pers. comm., Feb. 24, 2006). The upper bound follows by counting the regions cut on each successive hypersphere. An arrangement attaining it is obtained by stereographic projection of n great hyperspheres in general position on the unit hypersphere in (d+1)-dimensional Euclidean space.


See also

Plane Division by Circles, Space Division by Planes, Sphere-Sphere Intersection

Explore with Wolfram|Alpha

References

Sloane, N. J. A. Sequence A046127 in "The On-Line Encyclopedia of Integer Sequences."Yaglom, A. M. and Yaglom, I. M. Challenging Mathematical Problems with Elementary Solutions, Vol. 1. New York: Dover, pp. 102-106, 1987.

Referenced on Wolfram|Alpha

Space Division by Spheres

Cite this as:

Weisstein, Eric W. "Space Division by Spheres." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SpaceDivisionbySpheres.html

Subject classifications