Tiling rectangles with polyominoes

DOI10.1007/BF03027292MaRDI QIDQ1361145zbMATH OpenOpenAlexFDO

Authors S. W. Golomb

Publication date 16 March 1998

Published in The Mathematical Intelligencer (Search for Journal in Brave)

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

zbMATH Keywords

polyominotiling

Mathematics Subject Classification ID

Development of contemporary mathematics (01A65) History of geometry (51-03) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Review text

The 18th Hilbert's problem concerns the ways in which \(n\)-dimensional Euclidean space can be ``tiled or ``packed with congruent copies of a single geometric figure. This paper is an attempt to summarize what is known about a particular special case of the tiling problem in two dimension. The only tiles considered are polyominoes , where an ``\(n\)-omino is any connected figure obtained by taking \(n\) identical unit squares, and connecting them along common edges. A typical problem in polyomino theory is to determine which polyominoes have the property that unlimited copies of a specific one will tile the entire plane or a single quadrant or an infinite strip. This paper focusses primarily on the question of which polyomino shapes have the property that some finite number of copies of the basic shape, allowing all rotations and reflections, can be assembled to form a rectangle. This problem, as other tiling problems, is not yet resolved and the author concludes: ``This is a subject which is accessible to amateurs but lies close to the very heart of mathematics and continues to provide a seemingly inexhaustible supply of intriguing and provocative questions.

Recommendations

• scientific article; zbMATH DE number 638086
• Tiling rectangles and half strips with congruent polyominoes
• scientific article; zbMATH DE number 687006

Cites work

• A heptomino of order 76
• An octomino of high order
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• Packing a rectangle with congruent N-ominoes
• Polyominoes of order 3 do not exist
• Polyominoes which tile rectangles
• Replicating Figures in the Plane
• The undecidability of the domino problem
• The Y-hexomino has order 92
• Tiling with polyominoes
• Tiling with sets of polyominoes

Cited in

(23)

• Tiling polygons with parallelograms
• Tiling a square with eight congruent polyominoes
• Tiling rectangles and half strips with congruent polyominoes
• Strip tiling and regular grammars
• A strip-like tiling algorithm
• Klarner systems and tiling boxes with polyominoes
• Tessellating polyominos in the plane
• Two problems about tiling in discrete geometry
• Tiling a Manhattan Polyomino with Bars
• Tiling the Plane with a Fixed Number of Polyominoes
• scientific article; zbMATH DE number 3920482 (Why is no real title available?)
• scientific article; zbMATH DE number 21769 (Why is no real title available?)
• Idiot-proof tiles
• scientific article; zbMATH DE number 1305109 (Why is no real title available?)
• scientific article; zbMATH DE number 638086 (Why is no real title available?)
• scientific article; zbMATH DE number 1151790 (Why is no real title available?)
• scientific article; zbMATH DE number 2046042 (Why is no real title available?)
• scientific article; zbMATH DE number 2060068 (Why is no real title available?)
• Tiling Squares with Big Holes with L-trominoes
• Tilings
• Polyomino convolutions and tiling problems
• Tiling with Squares and Packing Dominos in Polynomial Time
• Combinatorial analysis of tetris-like games

This page was built for publication: Tiling rectangles with polyominoes

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