Square decomposition of a rectangle

DOI10.1007/PL00009899MaRDI QIDQ1897480zbMATH OpenOpenAlexFDO

Authors Jan Fricke

Publication date 13 March 1996

Published in Mathematische Semesterberichte (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009899

zbMATH Keywords

decompositionpackingrectanglesquare packingssquares

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Combinatorial aspects of tessellation and tiling problems (05B45)

Review text

The author studies the minimum number of \(1\times 1\)-squares needed in a decomposition of an \(m\times n\)-rectangle in squares with integer side lengths from a given set \(A\cup \{1\}\), i.e. the uncovered area in an optimal packing of the rectangle by aligned squares with side lengths in \(A\). He determines these numbers exactly for decompositions in \(1\times 1\)-, \(2\times 2\)- and \(3\times 3\)-squares \((A= \{2, 3\})\) and gives bounds for other small \(A\).

Recommendations

• Rectangular dissections of a square
• Decompositions of a rectangle into non-congruent rectangles of equal area
• scientific article; zbMATH DE number 6258433
• ON DECOMPOSITIONS OF A RECTANGLE INTO TWO QUADRILATERALS
• Rectangles as sums of squares

Cited in

(4)

• Rectangles as sums of squares
• Rectangular dissections of a square
• scientific article; zbMATH DE number 4016916 (Why is no real title available?)
• scientific article; zbMATH DE number 6258433 (Why is no real title available?)

This page was built for publication: Square decomposition of a rectangle

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