POLYOMINO TILINGS

Polyomino Tilings

Select polyominoes for a set (currently 1 or 2), for which tilings should be shown.

Then click "Show" button.

You may also see list of all polyomino sets for which data is available here.


Dominoes and X pentomino

Prime rectangles: ≥ 12.

Smallest rectangle tilings

Smallest rectangle (5x6):

Smallest square (6x6):

Rectangle tilings' solutions count (including symmetric)

Blue number (P) - strongly prime rectangle (which cannot be divided into two or more number of rectangles tileable by this set).

Green number (W) - weakly prime rectangle (which cannot be divided into two rectangles tileable by this set, but which can be divided into three or more rectangles).

Red number (C) - composite rectangle (which can be divided into two rectangles tileable by this set).

Gray number - it is unknown whether rectangle is prime or composite.

Question mark (?) - solution count is unknown.

Click on underlined numbers to view picture with one solution.

w \ h1-456789N>0
1-40
500
6077P3030P
700365365P0
80227227P18321832P4149241492P373308373308P
9001395213952P053119855311985P0
10048204820P7515075150C30369543036954P≥1≥1C≥1≥1Pall
1100477841477841C0≥1≥1C02k
1208616286162C≥2555≥2555C≥133225≥133225C≥1≥1C≥194658304≥194658304Call
1300≥10950≥10950C0≥1≥1C02k
14014087691408769C≥97664≥97664C≥15144580≥15144580C≥1≥1C≥7.41128147×10¹¹≥74112814720Call
N>0x2kall2kall2k

Smallest prime reptiles

Smallest prime reptiles (2Ix5, 5Xx3):

Reptile tilings' solutions count (including symmetric)

polyomino \ n²
I domino00004820P
X pentomino006144P2944512P≥1P

Smallest common multiples

Smallest common multiple (area 20):

Common multiples' solutions count (excluding symmetric)

area1020
solutions0≥1P

Formulas

$N(w; h)$ - number of ways to tile $w\times h$ rectangle (including symmetric solutions)

$T(w; h) = \begin{cases} 1, & N(w; h) \geq 1 \\ 0, & \text{else} \end{cases}$ - tileability function, $1$ if tiles rectangle, $0$ otherwise

$A(w; h) = \left(N(w; h)\right)^{\frac{1}{wh}}$ - average number of ways to tile cell in $w\times h$ rectangle (including symmetric solutions)

$G(T; x; y) = \sum_{w=1}^{\infty}\sum _{h=1}^{\infty}T(w; h)x^wy^h$ - bivariate generating function of $T(w; h)$

$G(A; x; y) = \sum_{w=1}^{\infty}\sum _{h=1}^{\infty}A(w; h)x^wy^h$ - bivariate generating function of $A(w; h)$

$N(2n + 1; 2m + 1) = T(2n + 1; 2m + 1) = 0 \tag{1}$

Assume domino and X pentomino tile $(2n + 1)\times(2m + 1)$ rectangle. Place numbers in rectangle's cells according to function $F(x,y)\equiv(-1)^{x+y}\pmod{3}$, where $x$ and $y$ are cells' coordinates (zero-based). On the one hand, domino and X pentomino, no matter how placed, cover sum congruent to $0\pmod{3}$. Then sum covered by all polyominoes is also congruent to $0\pmod{3}$. On the other hand, rectangle covers sum congruent to $\sum_{x=0}^{(2n+1)-1}\sum_{y=0}^{(2m+1)-1}(-1)^{x+y}\equiv1\pmod{3}$. Contradiction, as domino and X pentomino tile this rectangle and thus sum covered by all polyominoes should be equal to sum covered by rectangle. Thus only assumption we made is false - domino and X pentomino don't tile $(2n + 1)\times(2m + 1)$ rectangle. Q.E.D.

See Also

Dominoes and W pentominoDominoes and Y pentomino