3 research outputs found
Tiling problems, automata, and tiling graphs
This paper continues the investigation of tiling problems via formal languages, which was begun in papers by Merlini, Sprugnoli, and Verri. Those authors showed that certain tiling problems could be encoded by regular languages, which lead automatically to generating functions and other combinatorial information on tilings. We introduce a method of simplifying the DFA's recognizing these language, which leads to bijective proofs of certain tiling identities. We apply these ideas to some other tiling problems, including three-dimensional tilings and tilings with triangles and rhombi. We also study graph-theoretic variations of these tiling problems
Monomer-dimer tatami tilings of square regions
We prove that the number of monomer-dimer tilings of an square
grid, with monomers in which no four tiles meet at any point is
, when and have the same parity. In addition, we
present a new proof of the result that there are such tilings with
monomers, which divides the tilings into classes of size . The
sum of these tilings over all monomer counts has the closed form
and, curiously, this is equal to the sum of the squares of
all parts in all compositions of . We also describe two algorithms and a
Gray code ordering for generating the tilings with monomers,
which are both based on our new proof.Comment: Expanded conference proceedings: A. Erickson, M. Schurch, Enumerating
tatami mat arrangements of square grids, in: 22nd International Workshop on
Combinatorial Al- gorithms (IWOCA), volume 7056 of Lecture Notes in Computer
Science (LNCS), Springer Berlin / Heidelberg, 2011, p. 12 pages. More on
Tatami tilings at
http://alejandroerickson.com/joomla/tatami-blog/collected-resource
Counting With Irrational Tiles
We introduce and study the number of tilings of unit height rectangles with
irrational tiles. We prove that the class of sequences of these numbers
coincides with the class of diagonals of N-rational generating functions and a
class of certain binomial multisums. We then give asymptotic applications and
establish connections to hypergeometric functions and Catalan numbers