A note on tiling with integer-sided rectangles (Q1914014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on tiling with integer-sided rectangles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on tiling with integer-sided rectangles |
scientific article |
Statements
A note on tiling with integer-sided rectangles (English)
0 references
9 July 1996
0 references
In [Am. Math. Mon. 94, 601-617 (1987; Zbl 0691.05011)], \textit{S. Wagon} gives 14 proofs of the fact that if a rectangle \(R\) is tiled with rectangles, each having at least one side of integral length, then \(R\) has a side of integral length. In the present paper the author provides an algorithm for deciding when a rectilinear polygon (that is, a polygon with sides parallel to the axes) can be tiled with rectangles, each having an integer side.
0 references
tiling
0 references
rectangle
0 references
algorithm
0 references
rectilinear polygon
0 references
0.8616032004356384
0 references
0.8185319900512695
0 references
0.815667986869812
0 references
0.8150193691253662
0 references
