pith. sign in

arxiv: math/9905012 · v1 · submitted 1999-05-03 · 🧮 math.CO

Some Polyomino Tilings of the Plane

classification 🧮 math.CO
keywords tetrominotilingslowerplaneallowsboundboundscalculate
0
0 comments X
read the original abstract

We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino, the $L$ tetromino, and the $T$ tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by each of these. For the $T$ tetromino, we also derive a lower bound from the solution of the Ising model in two dimensions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.