Enumerating Tatami Mat Arrangements of Square Grids

  • Alejandro Erickson
  • Mark Schurch
Conference paper

DOI: 10.1007/978-3-642-25011-8_18

Volume 7056 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Erickson A., Schurch M. (2011) Enumerating Tatami Mat Arrangements of Square Grids. In: Iliopoulos C.S., Smyth W.F. (eds) Combinatorial Algorithms. IWOCA 2011. Lecture Notes in Computer Science, vol 7056. Springer, Berlin, Heidelberg

Abstract

We prove that the number of monomer-dimer tilings of an n×n square grid, with m < n monomers in which no four tiles meet at any point is m2m + (m + 1)2m + 1, when m and n have the same parity. In addition, we present a new proof of the result that there are n2n − 1 such tilings with n monomers, which divides the tilings into n classes of size 2n − 1. The sum of these over all m ≤ n has the closed form 2n − 1(3n − 4) + 2 and, curiously, this is equal to the sum of the squares of all parts in all compositions of n.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alejandro Erickson
    • 1
  • Mark Schurch
    • 2
  1. 1.Department of Computer ScienceUniversity of VictoriaCanada
  2. 2.Mathematics and StatisticsUniversity of VictoriaCanada