Journal of Combinatorial Theory, Series A  2730

journal of combinatorial theory, Series A 77, 181192 (1997) article no. TA972730

Packing with Congruent Polyominoes

William Rex Marshall

20 Albion Street, Shiel Hill, Dunedin, New Zealand

Communicated by the Managing Editors

Received May 3, 1996

Golomb has covered the main previous results of tiling a with con- gruent polyominoes in the revised edition of ``Polyominoes'' (1994). This article attempts to summarise recent discoveries of many new examples of polyominoes View metadata,which pack citation rectangles. and similar papers1997 Academic at core.ac.uk Press brought to you by CORE

provided by Elsevier - Publisher Connector

A or n-omino has order k if k congruent copies of the poly- omino are necessary to tile a rectangle. The order is undefined if no tiling of a rectangle is possible. Figure 1 shows an infinite family of ``boot'' polyominoes with the known orders indicated. Tilings of the and the family of 8r+4-ominoes have been known previously. It was asked in [1] whether the ``boot'' would tile a rectangle. Figure 2 shows the minimum tiling of 192 copies for this octomino, as well as the minimum tiling of 138 copies of the dekomino, the next member of the family. (These two results have also been covered by Golomb in [5].) It is not known whether the ``boot'' 14-omino or 16-omino will tile a rectangle or even an infinite half-strip. If half-strip tilings of these two polyominoes exist at all they must have sides >100 and >95 respectively. In fact, the only remaining ``boot'' polyominoes of the family in Fig. 1 which are known to tile rectangles are the 8r+2-ominoes of unknown orders. However, a tiling of a (28r+10)_16(4r+1) rectangle with 16(14r+5) congruent copies has been discovered (see Fig. 3). Only in the first case (r=1) is it known that the packing scheme does not lead to a minimal rectangle. Because of the difficulty of checking all smaller rec- tangles the minimum packing for all r>1 is unknown. Replicating tiles, or rep-tiles, are geometric figures of rep-r if r copies (not necessarily the minimum) will construct a larger scale replica. For example, any triangle or parallelogram is rep-r whenever r is a perfect . Many other examples of rep-tiles are described in [2, 4]. 181 0097-3165Â97 25.00 Copyright  1997 by Academic Press All rights of reproduction in any form reserved.

File: 582A 273001 . By:CV . Date:24:01:97 . Time:12:40 LOP8M. V8.0. Page 01:01 Codes: 3832 Signs: 2297 . Length: 50 pic 3 pts, 212 mm 182 WILLIAM REX MARSHALL

Fig. 1. Family of polyominoes with the known orders indicated.

Fig. 2. An octomino of order 192 and a dekomino of order 138.

File: 582A 273002 . By:XX . Date:27:01:97 . Time:10:17 LOP8M. V8.0. Page 01:01 Codes: 603 Signs: 145 . Length: 45 pic 0 pts, 190 mm RECTANGLES WITH POLYOMINOES 183

Fig. 3. Family tiling of 8r+2-omino ``boots.'' (The dekomino tiling is not minimal.)

Figure 4 illustrates an interesting way in which a2+b2 right triangles tile a replica. Although this example of a rep-tile family has long been known it can be used as the basis for a long overlooked family of polyominoes that tile rectangles. Since a right triangle is obviously half a rectangle the tiling in Fig. 4 leads to a packing of 2(a2+b2) copies of right triangles. Figure 5 shows one way in which the rep-5 triangle can be modified into an infinite set of order 10 polyominoes. The simplest member of the set is the Y pen- tomino,1 which had previously been considered a sporadic example of order 10. The larger order 10 polyominoes in Fig. 5 can be considered as the union of triangular stacks of Y pentominoes. Many other examples of order 10 polyominoes can also be constructed. Simply replace the leg of unit length in the rep-5 triangle with a rota- tionally symmetric curve S and the leg of length 2 with two more con- gruent copies of S. Some more complex examples of order 10 polyominoes are shown in Fig. 6. The general method of constructing a polyomino of order 2(a2+b2), with a and b co-prime, is to replace the leg of length a, on the right triangle rep-tile, with a copies of S, and the leg of length b with b copies of S,as indicated in the typical example in Fig. 7 for the case a=2, b=3. Some other examples of low orders are shown in Fig. 8. It is necessary that a and b be relatively prime, else if d=(a, b) with d>1, a smaller rectangle can always be constructed using 2(i 2+j 2) copies, where i=aÂd and j=bÂd.

1 ``'' is a trademark of S. W. Golomb.

File: 582A 273003 . By:XX . Date:15:01:97 . Time:08:36 LOP8M. V8.0. Page 01:01 Codes: 2328 Signs: 1686 . Length: 45 pic 0 pts, 190 mm 184 WILLIAM REX MARSHALL

Fig. 4. Right triangle rep-tiles of a2+b2 copies.

There is no general procedure for tiling a rectangle with less than 2(a2+b2) congruent copies of tiles of this family. In fact, there is no general procedure of packing any rectangle unless the construction uses a multiple of 2(a2+b2) copies. Since a general method must apply even to those tiles in which S interlocks with itself in a complex way the general case tiling

Fig. 5. Tiling rectangles with infinitely many dissimilar polyominoes of order 10.

File: 582A 273004 . By:XX . Date:15:01:97 . Time:08:37 LOP8M. V8.0. Page 01:01 Codes: 1021 Signs: 520 . Length: 45 pic 0 pts, 190 mm RECTANGLES WITH POLYOMINOES 185

Fig. 6. Some more examples of order 10 polyominoes. corresponds to a tiling with right triangles. The tiling therefore has sides equal to multiples of the hypotenuse of the original right triangle, and can be dissected into s each of 2(aÂb+bÂa) tiles; 2s(aÂb+bÂa) must be an integer. If a and b are both odd then s is divisible by ab, and the candidate rectangle contains a multiple of 2(a2+b2) tiles. If one of a and b is even then 2s is divisible by ab. Since S interlocks with itself in the general case tiling, and a+b is odd, the number of tiles is even in total. Therefore s must be divisible by ab, so again the candidate rectangle con- tains a multiple of 2(a2+b2) tiles. There are certain special cases of polyominoes which are simple enough to tile in additional ways which do not correspond to a tiling with right tri- angles. For example, although the Y pentomino is order 10 as expected, rectangles consisting of non-multiples of 10 copies are possible. There are also degenerate cases of polyominoes which are actually order 2. This construction yields infinitely many examples of polyominoes of orders congruent to 2 (if a and b have opposite parity) and 4 (if a and b are both odd) modulo 8. Other polyominoes for all orders that are multi- ples of 4 were previously known [3, 5]. Are there examples of polyominoes for every order 8t+2 (t0)? Unfortunately, we still have not any example of a polyomino of order 8t+6, although Michael Reid has found an order 6 heptabolo [5, 7]. Two new isolated cases of polyominoes of orders 8 and 60 have been dis- covered which pack minimal rectangles that are squares with 90-degree

File: 582A 273005 . By:XX . Date:15:01:97 . Time:08:37 LOP8M. V8.0. Page 01:01 Codes: 2118 Signs: 1665 . Length: 45 pic 0 pts, 190 mm 186 WILLIAM REX MARSHALL

Fig. 7. Tiling a rectangle with 2(a2+b2) modified right triangles. rotational , as shown in Fig. 9. Is the polyomino of order 8 a genuine sporadic or the simplest member of another polyomino family? The 11-omino

is of order 50 (see Golomb [3, 5] for the tiling). Figure 10 shows a second 11-omino

File: 582A 273006 . By:XX . Date:15:01:97 . Time:08:37 LOP8M. V8.0. Page 01:01 Codes: 1264 Signs: 322 . Length: 45 pic 0 pts, 190 mm RECTANGLES WITH POLYOMINOES 187

Fig. 8. Some simple examples of polyominoes of order 2(a2+b2).

Fig. 9. Two isolated cases of polyominoes of orders 8 and 60.

File: 582A 273007 . By:XX . Date:27:01:97 . Time:10:31 LOP8M. V8.0. Page 01:01 Codes: 650 Signs: 152 . Length: 45 pic 0 pts, 190 mm 188 WILLIAM REX MARSHALL

Fig. 10. Tiling a 44_208 rectangle symmetrically with 11-ominoes. What is the minimal rectangle? tiling a 44_208 rectangle symmetrically with 832 copies. The minimum rec- tangle is still far from known. There may also be a third L-shaped 11-omino. Does

tile any rectangle? A polyomino is odd if it admits a tiling of a rectangle with an odd num- ber of copies, and is of odd-order k if k is the smallest such odd number. The outstanding unsolved problem is whether any polyomino exists for which order=odd-order. Golomb [3] gives Reid's construction of an infinite family of odd L n-ominoes, where n is odd. Figure 11 shows an improvement on Reid's con- struction which was found by the author, and independently by Reid [7] shortly afterward. In particular, the L pentomino is not odd-order 27 as has long been thought, but is of odd-order 21. If n is prime the construction of an (n+2)_3n rectangle is minimal. If a smaller rectangle existed it would necessarily have an odd side n. There are only three ways of covering the first row of such a side, shown in (a), (b) and (c) of Fig. 12. (If n=3 only the case in (a) applies.) Case (a) is clearly eliminated as it simply tiles a 2_n subrectangle, delaying the task of how to begin tiling the rectangle with an odd number of L's. In (b) the marked cell cannot be covered without isolating a subregion of less than n squares. Case (c) leads to the two subcases in (d), when n=5, and (e), for larger n. In (d) additional pentominoes are forced into the numbered cells but the square marked by a cross cannot now be covered. Finally, the

File: 582A 273008 . By:XX . Date:15:01:97 . Time:08:39 LOP8M. V8.0. Page 01:01 Codes: 2344 Signs: 1595 . Length: 45 pic 0 pts, 190 mm RECTANGLES WITH POLYOMINOES 189

Fig. 11. Tiling a rectangle with 3n+6 Ln-ominoes.

Fig. 12. Constructions for proof that an Ln-omino (for odd n) cannot tile a rectangle with a border

File: 582A 273009 . By:XX . Date:15:01:97 . Time:08:39 LOP8M. V8.0. Page 01:01 Codes: 695 Signs: 209 . Length: 45 pic 0 pts, 190 mm 190 WILLIAM REX MARSHALL

Fig. 13. Minimal tilings of L polyominoes of odd-order k.

File: 582A 273010 . By:XX . Date:27:01:97 . Time:10:32 LOP8M. V8.0. Page 01:01 Codes: 442 Signs: 80 . Length: 45 pic 0 pts, 190 mm RECTANGLES WITH POLYOMINOES 191

Fig. 13Continued

File: 582A 273011 . By:XX . Date:27:01:97 . Time:10:32 LOP8M. V8.0. Page 01:01 Codes: 412 Signs: 50 . Length: 45 pic 0 pts, 190 mm 192 WILLIAM REX MARSHALL marked square in (e) cannot be covered without isolating an untileable subregion. It is not known whether the construction in Fig. 11 is always minimal when n is composite, although it is at least when n=9, 15 and 21. Figure 13 illustrates twelve new examples of L polyominoes of odd-order k. Most of these are of order 2 and 4, although the of odd-order 45 is order 28. Klarner [6] found a hexomino of odd-order 11, a prime number. Is there a second example of prime odd-order?

REFERENCES

1. K. A. Dahlke, S. W. Golomb, and H. Taylor, An octomino of high order, J. Combin. Theory Ser. A 70 (1995), 157158. 2. M. Gardner, Rep-tiles: Replicating figures in the plane, in ``The Unexpected Hanging and Other Mathematical Diversions,'' Simon and Schuster, New York, 1969. 3. S. W. Golomb, ``Polyominoes,'' 2nd ed., Princeton Univ. Press, Princeton, NJ, 1994. 4. S. W. Golomb, Replicating figures in the plane, Math. Gazette 48 (1964), 403412. 5. S. W. Golomb, Tiling Rectangles with Polyominoes, Math. Intelligencer 18 (2) (1996), 3847. 6. D. A. Klarner, Packing a Rectangle with Congruent N-ominoes, J. Combin. Theory 7 (1969), 107115. 7. M. Reid, personal communication to S. W. Golomb, December 28, 1994.

File: 582A 273012 . By:CV . Date:24:01:97 . Time:12:44 LOP8M. V8.0. Page 01:01 Codes: 1696 Signs: 1237 . Length: 45 pic 0 pts, 190 mm