On the Number of p4-Tilings by an n-Omino

DOI10.1142/S0218195919400016zbMath1457.68274OpenAlexW2969912649MaRDI QIDQ5234038

Kazuyuki Amano, Yoshinobu Haruyama

Publication date: 9 September 2019

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195919400016

zbMATH Keywords

polyominoisohedral tilingplane tilingword factorization

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Polyominoes and polyiamonds as fundamental domains of isohedral tilings with rotational symmetry
• On the tiling by translation problem
• On translating one polyomino to tile the plane
• Reverse search for enumeration
• A method to generate polyominoes and polyiamonds for tilings with rotational symmetry
• A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
• An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
• The eighty-one types of isohedral tilings in the plane
• The on-line encyclopedia of integer sequences
• Uniqueness Theorems for Periodic Functions
• An Optimal Algorithm for Detecting Pseudo-squares
• An algorithm for deciding if a polyomino tiles the plane

This page was built for publication: On the Number of p4-Tilings by an n-Omino