Compactness Theorems for Geometric Packings

Details Compactness Theorems for Geometric Packings Compactness Theorems for Geometric Packings

2000-05-05

arxiv.org/abs/math/0005054v1

J. Combin. Theory Ser. A 97 (2002), 225-238.

Mathematics

Metric Geometry

10 pages

Scientific paper

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2, 1/3, 1/4, ... can be packed without overlap into a rectangle of area pi^2/6-1. Computational investigations have been made into packing these collections into squares of side length 1+epsilon and rectangles of area pi^2/6-1+epsilon, respectively, and one can consider the apparently weaker question whether such packings are possible for every positive number epsilon. In this paper we establish a general theorem on sequences of geometrical packings that implies in particular that the ``for every epsilon'' versions of these two problems are actually equivalent to the original tiling problems.

Affiliated with

Also associated with

No associations

Rating

Compactness Theorems for Geometric Packings 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 Compactness Theorems for Geometric Packings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compactness Theorems for Geometric Packings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-441012