Counting fixed-height tatami tilings
Summary: A tatami tiling is an arrangement of \(1 \times 2\) dominoes (or mats) in a rectangle with \(m\) rows and \(n\) columns, subject to the constraint that no four corners meet at a point. For fixed m we present and expand upon Dean Hickerson's [``Filling rectangular rooms with tatami mats, \url{http://www.research.att.com/~njas/sequences/a068920.txt}] combinatorial decomposition of the set of tatami tilings - a decomposition that allows them to be viewed as certain classes of restricted compositions when \(n \geqslant m\). Using this decomposition we find the ordinary generating functions of both unrestricted and inequivalent tatami tilings that fit in a rectangle with \(m\) rows and \(n\) columns, for fixed \(m\) and \(n \geqslant m\). This allows us to verify a modified version of a conjecture of Knuth. Finally, we give explicit solutions for the count of tatami tilings, in the form of sums of binomial coefficients.
- On dimer coverings of rectangles of fixed width
- Monomer-dimer tatami tilings of square regions
- Enumerating tatami mat arrangements of square grids
- Auspicious tatami mat arrangements
- scientific article; zbMATH DE number 871912 (Why is no real title available?)
- Generating functions for straight polyomino tilings of narrow rectangles
- Counting Tilings by Taking Walks in a Graph
- Monomer-dimer tatami tilings of rectangular regions
- The number of ribbon tilings for strips
This page was built for publication: Counting fixed-height tatami tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380290)
