We consider tilings of deficient rectangles by the set T4 of ribbon L-tetro-minoes. A tiling exists if and only if the rectangle is a square of odd side. The missing cell has to be on the main NW-SE diagonal, in an od...
We show that the least number of cells (the gap number) one needs to take out from a rectangle with integer sides of length at least 2 in order to be tiled by ribbon right trominoes is less than or equal to 4. If the ...
The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by p...
Let Tn be the set of ribbon L-shaped n-ominoes for some n≥4 even, and let T+n be Tn with an extra 2 x 2 square. We investigate signed tilings of rectangles by Tn...