Polyomino convolutions and tiling problems

Simple item page
dc.creatorKisisel, Ali Ulas Ozgur
dc.date2000-12-19
dc.date.accessioned2026-07-07T04:39:18Z
dc.date.available2026-07-07T04:39:18Z
dc.descriptionWe 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.
dc.description8 pages, 8 figures. To appear in \emph{J. of Combin. Theory Ser. A}
dc.identifierhttps://arxiv.org/abs/math/0012179
dc.identifierhttp://arxiv.org/abs/math/0012179
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60604
dc.subjectCombinatorics
dc.titlePolyomino convolutions and tiling problems
dc.typetext

Files

Collections

arXiv