Tiling a (2 × n)-Board with Squares and Dominoes
نویسندگان
چکیده
The Fibonacci numbers and the Pell numbers can be interpreted as the number of tilings of a (1 × n)-board by colored squares and dominoes. We explore the tilings of (2 × n)-boards by colored squares and dominoes. We develop a recurrence relation and prove several combinatorial identities in the style of recent work by Benjamin and Quinn. We also give a bijection between these (2 × n)-tilings and a set of weighted (1 × n)-tilings.
منابع مشابه
Norman Do The Art of Tiling with Rectangles 1
Tiling pervades the art and architecture of various ancient civilizations. Toddlers grapple with tiling problems when they pack away their wooden blocks and home renovators encounter similar problems in the bathroom. However, rather than being a frivolous pastime, mathematicians have found the art of tiling to be brimming with beautiful mathematics, problems of fiendish difficulty, as well as i...
متن کاملDomino Tilings of a Checkerboard
for n ≥ 2, it can be shown that fn counts the number of ways to tile a 1 × n board with squares and dominoes. This interpretation of the Fibonacci numbers admits clever counting proofs of many Fibonacci identities. When we consider more complex combinatorial objects, we find that simply counting the number of tilings is not quite enough, and that we must consider instead weighted tilings. For e...
متن کاملThe Tilings of a (2× n)-Board and Some New Combinatorial Identities
We know that the Fibonacci numbers count the tilings of a (1×n)-board by squares and dominoes, or equivalently, the number of tilings of a (2×n)-board by dominoes. We use the tilings of a (2×n)-board by colored unit squares and dominoes to obtain some new combinatorial identities. They are generalization of some known combinatorial identities and in the special case give us the Fibonacci identi...
متن کاملCounting Colorful Tilings of Rectangular Arrays
In this paper we give recursive formulas for the number of colorful tilings of small rectangular arrays. We enumerate the tilings of a 2 × n board with painted squares, dominoes, and I-trominoes. We also provide a recursion formula for the number of tilings of a 3 × n board with colorful squares and dominoes. Finally, we describe a general method for calculating the number of colorful tilings o...
متن کاملOn the Tileability of Polygons with Colored Dominoes
We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces ha...
متن کامل