Publication date
January 1976
DOI Publisher
Published by Elsevier Inc. ISSN
0097-3165Abstract
AbstractThe notion of a tiling of a set generalizes the notion of a factorization of a group and the geometric idea of tiling by congruent figures
AbstractThe notion of a tiling of a set generalizes the notion of a factorization of a group and the geometric idea of tiling by congruent figures
We say that a triangle T tiles a polygon A, if A can be dissected into finitely many nonoverlapping ...
We investigate lattice tilings of n-space by (k, n)-crosses, establishing necessary and sufficient c...
We consider a set of necessary conditions which are efficient heuristics for deciding when a set of ...
AbstractWhen can a given finite region consisting of cells in a regular lattice (triangular, square,...
AbstractThe notion of a factorization of a group is generalized and a method is presented for obtain...
AbstractSeveral classification theorems involving highly symmetric tilings by regular polygons have ...
AbstractIt is shown that any set of three lattice points in n-dimensional Euclidean space Rn tiles t...
A tiling is a covering of the plane with non-overlapping figures that have no holes between them. Fo...
AbstractWe discuss regular production systems as a tool for analyzing tilings in general. As an appl...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
AbstractLet T be a finite set of tiles. The group of invariants G(T), introduced by Pak (Trans. AMS ...
Tilings can be found everywhere in everyday life. They consist of various types of tiles. Tilings, w...
AbstractIn this paper we prove that one can only tile a triangle with tiles all congruent to each ot...
This paper continues the investigation of tiling problems via formal languages, which was begun in p...
We say that a triangle T tiles a polygon A, if A can be dissected into finitely many nonoverlapping ...
We investigate lattice tilings of n-space by (k, n)-crosses, establishing necessary and sufficient c...
We consider a set of necessary conditions which are efficient heuristics for deciding when a set of ...
AbstractWhen can a given finite region consisting of cells in a regular lattice (triangular, square,...
AbstractThe notion of a factorization of a group is generalized and a method is presented for obtain...
AbstractSeveral classification theorems involving highly symmetric tilings by regular polygons have ...
AbstractIt is shown that any set of three lattice points in n-dimensional Euclidean space Rn tiles t...
A tiling is a covering of the plane with non-overlapping figures that have no holes between them. Fo...
AbstractWe discuss regular production systems as a tool for analyzing tilings in general. As an appl...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
AbstractLet T be a finite set of tiles. The group of invariants G(T), introduced by Pak (Trans. AMS ...
Tilings can be found everywhere in everyday life. They consist of various types of tiles. Tilings, w...
AbstractIn this paper we prove that one can only tile a triangle with tiles all congruent to each ot...
This paper continues the investigation of tiling problems via formal languages, which was begun in p...
We say that a triangle T tiles a polygon A, if A can be dissected into finitely many nonoverlapping ...
We investigate lattice tilings of n-space by (k, n)-crosses, establishing necessary and sufficient c...
We consider a set of necessary conditions which are efficient heuristics for deciding when a set of ...
Add to ORKG