Paper by Erik D. Demaine

Reference:

Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, Ryuhei Uehara, and Yushi Uno, “Multifold tiles of polyominoes and convex lattice polygons”, Thai Journal of Mathematics, volume 21, number 4, December 2023, pages 957–978.

BibTeX

@Article{MultiTiling_TJM,
  AUTHOR        = {Kota Chida and Erik Demaine and Martin Demaine and David Eppstein and Adam Hesterberg and Takashi Horiyama and John Iacono and Hiro Ito and Stefan Langerman and Ryuhei Uehara and Yushi Uno},
  TITLE         = {Multifold tiles of polyominoes and convex lattice polygons},
  JOURNAL       = {Thai Journal of Mathematics},
  journalurl    = {http://thaijmath.in.cmu.ac.th/index.php/thaijmath},
  VOLUME        = 21,
  NUMBER        = 4,
  MONTH         = {December},
  YEAR          = 2023,
  PAGES         = {957--978},

  comments      = {The paper is also available from <A HREF="https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1559">the journal</A>. Described in <A HREF="https://11011110.github.io/blog/2021/09/25/multilayer-tiles.html">a blog post by David Eppstein</A>.},
  withstudent   = 1,
  papers        = {MultiTiling_TJCDCGGG2021},
}

Abstract:

A planar shape S is a k-fold tile if there is an indexed family 𝒯 of planar shapes congruent to S that is a k-fold tiling: any point in ℝ² that is not on the boundary of any shape in 𝒯 is covered by exactly k shapes in 𝒯. Since a 1-fold tile is clearly a k-fold tile for any positive integer k, the subjects of our research are nontrivial k-fold tiles, that is, plane shapes with property “not a 1-fold tile, but a k(≥ 2)-fold tile.” In this paper, we prove some interesting properties about nontrivial k-fold tiles. First, we show that, for any integer k ≥ 2, there exists a polyomino with property “not an h-fold tile for any positive integer h < k, but a k-fold tile.” We also find, for any integer k ≥ 2, polyominoes with the minimum number of cells among ones that are nontrivial k-fold tiles. Next, we prove that, for any integer k = 5 or k ≥ 7, there exists a convex unit-lattice polygon that is a nontrivial k-fold tile whose area is k, and for k = 2 and k = 3, no such convex unit-lattice polygon exists.

Comments:

The paper is also available from the journal. Described in a blog post by David Eppstein.

Availability:

The paper is available in PDF (1106k).

See information on file formats.

[Google Scholar search]

Related papers:

MultiTiling_TJCDCGGG2021 (Multifold tiles of polyominoes and convex lattice polygons)