Auspicious Tatami Mat Arrangements

Alejandro Erickson, Department of Computer Science, University of Victoria, Canada.
Frank Ruskey, Department of Computer Science, University of Victoria, Canada.
Mark Schurch, Department of Mathematics and Statistics, University of Victoria, Canada.
Jennifer Woodcock, Department of Computer Science, University of Victoria, Canada.

Abstract:

The main purpose of this paper is to introduce the idea of tatami tilings, and to present to the reader some of the many interesting questions that arise when studying them. Roughly speaking what we are considering are tilings of rectilinear regions with dimer and monomer pieces, with the constraint that no four corners of the pieces meet. A typical problem is to minimize the number of monomers in a tiling, or to count the number of tilings in a particular shape. We determine the underlying structure of tatami tilings of rectangles and use this to prove that the number of tatami tilings of an n by n square with n monomers is n2n-1. We also prove that for fixed height, that the number of tatami tilings of a rectangle is a rational function and outline an algorithm that produces the coefficients of the two polynomials of the numerator and the denominator.



Back to list of publications.