✦ LIBER ✦

Polyomino Convolutions and Tiling Problems

✍ Scribed by Ali Ulas Ozgur Kisisel

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 252 KB
Volume: 95
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3171

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A polyomino tiling problem of Thurston a

A polyomino tiling problem of Thurston and its configurational entropy

✍ J.C Lagarias; D.S Romano 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 874 KB

Tiling Rectangles and Half Strips with C

Tiling Rectangles and Half Strips with Congruent Polyominoes

✍ Michael Reid 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 322 KB

In the second edition of Golomb's classic ``Polyominoes'' [9], several infinite families of rectifiable polyominoes are given, but only nine sporadic examples are known. Curiously, two of these sporadic examples are related by a 2\_1 affine transformation (Fig. 1). This led us to consider the image

Analog neuro-based approach to tiling pr

Analog neuro-based approach to tiling problem using fitting function of polyominoes

✍ Hiroshi Ninomiya; Takeshi Nakayama; Hideki Asai 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

The tiling problem is a typical NP-complete problem, where the polyominoes are to be arranged without a gap on a finite checkerboard. In this study, the arrangement of l polyominoes on an m u n checkerboard is considered. As the first step, the conventional parallel algorithm using the maximum neura

The 3rd International Workshop on Polyom

The 3rd International Workshop on Polyominoes and Tilings

✍ Philippe Aigrain 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 143 KB

A Method to Generate Polyominoes and Pol

A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry

✍ Hiroshi Fukuda; Nobuaki Mutoh; Gisaku Nakamura; Doris Schattschneider 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 440 KB

A neural network approach to tiling prob

A neural network approach to tiling problems

✍ T. Tambouratzis 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has