کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647336 | 1342341 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The gap number of the TT-tetromino
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A famous result of D. Walkup (1965) states that the only rectangles that may be tiled by the TT-Tetromino are those in which both sides are a multiple of four. In this paper we examine the rest of the rectangles, asking how many TT-tetrominos may be placed into those rectangles without overlap, or, equivalently, what is the least number of gaps that need to be present. We introduce a new technique for exploring such tilings, enabling us to answer this question for all rectangles, up to a small additive constant. We also show that there is some number GG such that if both sides of the rectangle are at least 12, then no more than GG gaps will be required. We prove that GG is either 5, 6, 7 or 9.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 338, Issue 1, 6 January 2015, Pages 130–138
Journal: Discrete Mathematics - Volume 338, Issue 1, 6 January 2015, Pages 130–138
نویسندگان
Robert Hochberg,