The number of ribbon tilings for strips

Abstract: First, we consider order-

n

ribbon tilings of an

M

-by-

N

rectangle

R_{M, N}

where

M

and

N

are much larger than

n

. We prove the existence of the growth rate

g a m m a_{n}

of the number of tilings and show that

g a m m a_{n} l e q (n - 1) l n 2

. Then, we study a rectangle

R_{M, N}

with fixed width

M = n

, called a strip. We derive lower and upper bounds on the growth rate

m u_{n}

for strips as

l n n - 1 + o (1) l e q m u_{n} l e q l n n

. Besides, we construct a recursive system which enables us to enumerate the order-

n

ribbon tilings of a strip for all

n l e q 8

and calculate the corresponding generating functions.

Recommendations

Cites Work

Cited In (1)

This page was built for publication: The number of ribbon tilings for strips