Polyominoes which tile rectangles (Q757389)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4191670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyominoes which tile rectangles |
scientific article; zbMATH DE number 4191670 |
Statements
Polyominoes which tile rectangles (English)
0 references
1989
0 references
\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.
0 references
order of polyominoes
0 references
0.8516731858253479
0 references
0.8469083905220032
0 references
0.8434430956840515
0 references
