License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.5
URN: urn:nbn:de:0030-drops-82498
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8249/
Go to the corresponding LIPIcs Volume Portal


Amano, Kazuyuki ; Haruyama, Yoshinobu

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

pdf-format:
LIPIcs-ISAAC-2017-5.pdf (2 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{amano_et_al:LIPIcs:2017:8249,
  author =	{Kazuyuki Amano and Yoshinobu Haruyama},
  title =	{{On the Number of p4-Tilings by an n-Omino}},
  booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
  pages =	{5:1--5:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-054-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{92},
  editor =	{Yoshio Okamoto and Takeshi Tokuyama},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8249},
  URN =		{urn:nbn:de:0030-drops-82498},
  doi =		{10.4230/LIPIcs.ISAAC.2017.5},
  annote =	{Keywords: polyomino, plane tiling, isohedral tiling, word factorization}
}

Keywords: polyomino, plane tiling, isohedral tiling, word factorization
Seminar: 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Issue Date: 2017
Date of publication: 04.12.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI