Polyominoes which tile rectangles
From MaRDI portal
\textit{D. A. Klarner} [J. Comb. Theory 7, No.2, 107-115 (1969; Zbl 0174.041)] defined the order n of a polyomino P as the minimum number of congruent copies of P which can be assembled to form a rectangle. For those polyominoes which will not tile any rectangle, the order is undefined. Here we show that there are infinitely many dissimilar polyomino examples for every order n which is a multiple of n.
Recommendations
Cites work
Cited in
(20)- Polyominoes of order 3 do not exist
- Characterizing tileorders
- \(q\)-enumeration of convex polyominoes
- An octomino of high order
- Tiling rectangles with polyominoes
- Tiling rectangles and half strips with congruent polyominoes
- Polyominoes tiling by a genetic algorithm
- Domino-tiling games
- Generating convex polyominoes at random
- Klarner systems and tiling boxes with polyominoes
- Tiling with arbitrary tiles
- Tiling a Manhattan Polyomino with Bars
- scientific article; zbMATH DE number 3920481 (Why is no real title available?)
- Packing polyominoes clumsily
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- A neural network approach to tiling problems
- scientific article; zbMATH DE number 2046042 (Why is no real title available?)
- Homology of polyomino tilings on flat surfaces
- Rectangular tileability and complementary tileability are undecidable
- A heptomino of order 76
This page was built for publication: Polyominoes which tile rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757389)