Tiling a unit square with 8 squares

MaRDI QIDQ4913050zbMATH OpenFDO

Authors Iwan Praton

Publication date 3 April 2013

Full work available at URL https://arxiv.org/abs/1101.2934

zbMATH Keywords

side length sumtiling squares with squares

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Abstract: 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.

Recommendations

• On packing squares with equal squares
• Minimal tilings of a unit square
• Tiling the unit square with squares and rectangles
• Packing Squares in a Square
• Packing unit squares in squares: A survey and new results

Cited in

(3)

• Tiling a square with eight congruent polyominoes
• Minimal tilings of a unit square
• Maximal tilings with the minimal tile property

This page was built for publication: Tiling a unit square with 8 squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4913050)