Tiling complexity of small n-ominoes \((N<10)\)
type: Item
instance of: scholarly article
title: Tiling complexity of small n-ominoes \((N<10)\)
zbMATH Open document ID: 0663.05023
DOI: 10.1016/0012-365X(88)90081-7
author: Daniel A. Rawsthorne
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: The author studies monohedral plane tilings by n-ominoes (polyominoes) for \(n<10\). He defines the complexity of a tile as the smallest number of congruent copies of the tile that are needed to form a patch which tiles by translation. A computer is used to calculate the complexity of n- ominoes for small n. Also examples of the different tiling types are given.
Mathematics Subject Classification ID: 05B50
Mathematics Subject Classification ID: 05B45
zbMATH DE Number: 4083648
zbMATH Keywords: monohedral plane tilings
zbMATH Keywords: n-ominoes
zbMATH Keywords: polyominoes
Wikidata QID: Q56112483
reviewed by: Egon Schulte
MaRDI profile type: Publication
cites work: Etalements cristallographiques
cites work: Q5523633
cites work: Q5344631
cites work: Polymorphic prototiles
cites work: Tetramorphic and pentamorphic prototiles
cites work: Polymorphic Polyominoes
cites work: An enneamorphic prototile
cites work: Checker Boards and Polyominoes
cites work: Replicating Figures in the Plane
cites work: Tiling with polyominoes
cites work: Tiling with sets of polyominoes
cites work: The eighty-one types of isohedral tilings in the plane
cites work: Tilings with congruent tiles
cites work: Q3735714
cites work: On Paving the Plane
cites work: Q3932992
cites work: Q3715773
cites work: Convex Polygons that Cannot Tile the Plane
cites work: The Plane Symmetry Groups: Their Recognition and Notation
cites work: Tiling the Plane with Congruent Pentagons
cites work: Will It Tile? Try the Conway Criterion!
full work available at URL: 0012-365x(88)90081-7
OpenAlex ID: W1968163400
description: scientific article; zbMATH DE number 4083648