Tiling a unit square with 8 squares

Details Tiling a unit square with 8 squares Tiling a unit square with 8 squares

2011-01-15

arxiv.org/abs/1101.2934v2

Mathematics

Metric Geometry

8 pages; revised (shorter) proof

Scientific paper

Put n nonoverlapping squares inside the unit square. Let f(n) and g(n) denote the maximum values of the sum of the edge lengths of the n small squares, where in the case of f(n) the maximum is taken over all arbitrary packings of the unit square, and in the case of g(n) it is taken over all tilings of the unit square (i.e., the total area of the n small squares is 1). Benton and Tyler asked for which values of n we have f(n)=g(n). We show that f(8)>g(8). More precisely, we show that g(8)=13/5; it is known that f(8) is at least 8/3.

Affiliated with

Also associated with

No associations

Rating

Tiling a unit square with 8 squares 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 Tiling a unit square with 8 squares, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tiling a unit square with 8 squares will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-227830