English

Auspicious tatami mat arrangements

Combinatorics 2015-03-19 v1

Abstract

An \emph{auspicious tatami mat arrangement} is a tiling of a rectilinear region with two types of tiles, 1×21 \times 2 tiles (dimers) and 1×11 \times 1 tiles (monomers). The tiles must cover the region and satisfy the constraint that no four corners of the tiles meet; such tilings are called \emph{tatami tilings}. The main focus of this paper is when the rectilinear region is a rectangle. We provide a structural characterization of rectangular tatami tilings and use it to prove that the tiling is completely determined by the tiles that are on its border. We prove that the number of tatami tilings of an n×nn \times n square with nn monomers is n2n1n2^{n-1}. We also show that, for fixed-height, the generating function for the number of tatami tilings of a rectangle is a rational function, and outline an algorithm that produces the generating function.

Keywords

Cite

@article{arxiv.1103.3309,
  title  = {Auspicious tatami mat arrangements},
  author = {Alejandro Erickson and Frank Ruskey and Mark Schurch and Jennifer Woodcock},
  journal= {arXiv preprint arXiv:1103.3309},
  year   = {2015}
}

Comments

23 pages, expands on conference proceedings in A. Erickson, F. Ruskey, M. Schurch and J. Woodcock, Auspicious Tatami Mat Arrangements, The 16th Annual International Computing and Combinatorics Conference (COCOON 2010), July 19-21, Nha Trang, Vietnam. LNCS 6196 (2010) 288-297. A list of tatami related discoveries is available at http://alejandroerickson.com/joomla/tatami-blog/collected-resources

R2 v1 2026-06-21T17:40:37.744Z