The gap number of the T-tetromino

DOI10.1016/J.DISC.2014.09.001MaRDI QIDQ468449zbMATHOpenAlexFDO

Authors Robert A. Hochberg

Publication date 7 November 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.6730

zbMATH Keywords

tilingBellman-Fordtetromino

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Abstract: A famous result of D. Walkup states that the only rectangles that may be tiled by the T-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 T-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 G such that if both sides of the rectangle are at least 12, then no more than G gaps will be required. We prove that G is either 5, 6, 7 or 9.

Recommendations

• Tilings of rectangles with triangular-tetrominoes
• Tilings of rectangles with T-tetrominoes
• On the number of tilings of the rectangular board with T-tetrominoes
• A coloring invariant for ribbon \(L\)-tetrominos
• Tiling Deficient Rectangles with Trominoes

Cites work

• Covering a Rectangle with T-Tetrominoes
• Klarner systems and tiling boxes with polyominoes
• On the number of tilings of the rectangular board with T-tetrominoes
• Tilings of rectangles with T-tetrominoes

Cited in

(3)

• Tile homotopy groups.
• Tilings of rectangles with triangular-tetrominoes
• T-tetrominos in arithmetic progression

This page was built for publication: The gap number of the \(T\)-tetromino

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468449)