Tiling Rectangles with Gaps by Ribbon Right Trominoes  

作　　者：Premalatha Junius Viorel Nitica 

机构地区：[1]Department of Mathematics, West Chester University, West Chester, PA, USA

出　　处：《Open Journal of Discrete Mathematics》2017年第2期87-102,共16页离散数学期刊（英文）

摘　　要：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 sides of the rectangle are of length at least 5, then the gap number is less than or equal to 3. We also show that for the family of rectangles that have nontrivial minimal number of gaps, with probability 1, the only obstructions to tiling appear from coloring invariants. This is in contrast to what happens for simply connected regions. For that class of regions Conway and Lagarias found a tiling invariant that does not follow from coloring.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 sides of the rectangle are of length at least 5, then the gap number is less than or equal to 3. We also show that for the family of rectangles that have nontrivial minimal number of gaps, with probability 1, the only obstructions to tiling appear from coloring invariants. This is in contrast to what happens for simply connected regions. For that class of regions Conway and Lagarias found a tiling invariant that does not follow from coloring.

关 键 词：TILING RECTANGLES RIBBON Tromino RECTANGLE with GAPS Gap Number COLORING Invariants 

分 类 号：O1[理学—数学]