Two infinite families of polyominoes that tile the plane by translation in two distinct ways

DOI10.1016/j.tcs.2010.12.034zbMath1223.68092OpenAlexW2125204297MaRDI QIDQ638553

A. Garon, Srečko Brlek, Sébastien Labbé, Alexandre Blondin Massé

Publication date: 12 September 2011

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

Full work available at URL: http://www.archipel.uqam.ca/8428/1/Blondin-Mass%C3%A9-2011b-preprint.pdf

zbMATH Keywords

tessellationFibonacci sequencepolyominoChristoffel word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50)

Related Items (6)

Small polyomino packing ⋮ Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability ⋮ Combinatorial properties of double square tiles ⋮ A generalization of the Fibonacci word fractal and the Fibonacci snowflake ⋮ Mathematical specification of hitomezashi designs ⋮ GENERATING FRACTAL PATTERNS BY USING p-CIRCLE INVERSION

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the tiling by translation problem
• On translating one polyomino to tile the plane
• A new characteristic property of the palindrome prefixes of a standard Sturmian word
• On Christoffel classes
• Combinatorics on Words
• Christoffel and Fibonacci Tiles
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• An Optimal Algorithm for Detecting Pseudo-squares
• PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS

This page was built for publication: Two infinite families of polyominoes that tile the plane by translation in two distinct ways