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

Authors Kazuyuki Amano, Yoshinobu Haruyama

Thumbnail PDF


  • Filesize: 1.83 MB
  • 12 pages

Document Identifiers

Author Details

Kazuyuki Amano
Yoshinobu Haruyama

Cite AsGet BibTex

Kazuyuki Amano and Yoshinobu Haruyama. On the Number of p4-Tilings by an n-Omino. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


A plane tiling by the copies of a polyomino is called isohedral if every pair of copies in the tiling has a symmetry of the tiling that maps one copy to the other. We show that, for every $n$-omino (i.e., polyomino consisting of n cells), the number of non-equivalent isohedral tilings generated by 90 degree rotations, so called p4-tilings or quarter-turn tilings, is bounded by a constant (independent of n). The proof relies on the analysis of the factorization of the boundary word of a polyomino.
  • polyomino
  • plane tiling
  • isohedral tiling
  • word factorization


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads