Related papers: Tilings of Rectangular Regions by Rectangular Tile…
We consider a class of cut-and-project sets $\Lambda = \Lambda_F \times \zahl$ in the plane. Let $L=\Lambda+w\real$, $w\in\real^2$, be a countable union of parallel lines. Then either (1) $L$ is a discrete family of lines, (2) $L$ is a…
We study whether an asymmetric limited-magnitude ball may tile $\mathbb{Z}^n$. This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilings act as perfect error-correcting codes in a channel which…
Rotationally symmetric tilings by a convex pentagonal tile belonging to both the Type 1 and Type 7 families are introduced. Among them are spiral tilings with two- and four-fold rotational symmetry. Those rotationally symmetric tilings are…
The Fourier-based diffraction approach is an established method to extract order and symmetry propertiesfrom a given point set. We want to investigate a different method for planar sets which works in direct spaceand relies on reduction of…
The Calisson puzzle is a tiling puzzle in which one must tile a triangular grid inside a hexagon with lozenges, under the constraint that certain prescribed edges remain tile boundaries and that adjacent lozenges along these edges have…
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…
We classify the dihedral edge-to-edge tilings of the sphere by regular polygons and quadrilaterals with equal opposite edges (edge configuration xyxy).
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases,…
The deductive method ruled mathematics for the last 2500 years, now it is the turn of the inductive method. Here we make a modest start by using the inductive method to discover and prove (rigorously) explicit generating functions for the…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
The existence question for tiling of the $n$-dimensional Euclidian space by crosses is well known. A few existence and nonexistence results are known in the literature. Of special interest are tilings of the Euclidian space by crosses with…
We study a random aggregation process involving rectangular clusters. In each aggregation event, two rectangles are chosen at random and if they have a compatible side, either vertical or horizontal, they merge along that side to form a…
If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
The design of irregular planar phased arrays (PAs) characterized by a highly-modular architecture is addressed. By exploiting the property of self-replicating tile shapes, also known as rep-tiles, the arising array layouts consist of tiles…
We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.
Substitution schemes provide a classical method for constructing tilings of Euclidean space. Allowing multiple scales in the scheme, we introduce a rich family of sequences of tile partitions generated by the substitution rule, which…
A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…