Tiling complexity of small n-ominoes \((N<10)\) (Q1114701): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Egon Schulte / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q56112483 / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Egon Schulte / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Etalements cristallographiques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic prototiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tetramorphic and pentamorphic prototiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic Polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enneamorphic prototile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checker Boards and Polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replicating Figures in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with sets of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eighty-one types of isohedral tilings in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tilings with congruent tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Paving the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polygons that Cannot Tile the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Plane Symmetry Groups: Their Recognition and Notation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling the Plane with Congruent Pentagons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Will It Tile? Try the Conway Criterion! / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90081-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968163400 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:01, 30 July 2024

scientific article
Language Label Description Also known as
English
Tiling complexity of small n-ominoes \((N<10)\)
scientific article

    Statements

    Tiling complexity of small n-ominoes \((N<10)\) (English)
    0 references
    1988
    0 references
    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.
    0 references
    monohedral plane tilings
    0 references
    n-ominoes
    0 references
    polyominoes
    0 references
    0 references

    Identifiers