2017
DOI: 10.4236/ojdm.2017.72010
|View full text |Cite
|
Sign up to set email alerts
|

Tiling Rectangles with Gaps by Ribbon Right Trominoes

Abstract: 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 w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…For some of these tile sets coloring invariants are not available [11] [12]. Some conjectures about tiling deficient regions by T n can be found in [13].…”
Section: Resultsmentioning
confidence: 99%
“…For some of these tile sets coloring invariants are not available [11] [12]. Some conjectures about tiling deficient regions by T n can be found in [13].…”
Section: Resultsmentioning
confidence: 99%