On packing spheres into containers (about Kepler's finite sphere packing problem)

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 2 figures; v2: major revision, extended result, simplified and clarified proof

Scientific paper

In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can not have a ``simple structure'' for large $n$. By this we in particular find that there exist arbitrary small $r>0$, such that packings in a smooth, 3-dimensional convex body, with a maximum number of spheres of radius $r$, are necessarily not hexagonal close packings. This contradicts Kepler's famous statement that the cubic or hexagonal close packing ``will be the tightest possible, so that in no other arrangement more spheres could be packed into the same container''.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On packing spheres into containers (about Kepler's finite sphere packing problem) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On packing spheres into containers (about Kepler's finite sphere packing problem), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On packing spheres into containers (about Kepler's finite sphere packing problem) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-730220

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.