Polyomino convolutions and tiling problems
Combinatorics
2007-05-23 v1
Abstract
We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a given polyomino not to tile the plane (rotations and translations allowed). We apply the criterion to several families of polyominoes, and show that the criterion detects some cases that are not detectable by generalized coloring arguments.
Keywords
Cite
@article{arxiv.math/0012179,
title = {Polyomino convolutions and tiling problems},
author = {Ali Ulas Ozgur Kisisel},
journal= {arXiv preprint arXiv:math/0012179},
year = {2007}
}
Comments
8 pages, 8 figures. To appear in \emph{J. of Combin. Theory Ser. A}