Combinatorial properties of double square tiles

DOI10.1016/j.tcs.2012.10.040zbMath1301.05062OpenAlexW2077987919MaRDI QIDQ391406

A. Garon, Alexandre Blondin Massé, Sébastien Labbé

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.040

zbMATH Keywords

tilingsgenerationpolyominopalindromesdouble square tile

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Related Items

Efficient operations on discrete paths ⋮ Proving a conjecture on prime double square tiles ⋮ On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino ⋮ A generalization of the Fibonacci word fractal and the Fibonacci snowflake

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallelogram tile fills the plane by translation in at most two distinct ways
• Equations on palindromes and circular words
• Two infinite families of polyominoes that tile the plane by translation in two distinct ways
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• On the tiling by translation problem
• On translating one polyomino to tile the plane
• Research Problems in Discrete Geometry
• Salient and Reentrant Points of Discrete Sets
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Developments in Language Theory
• PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS