Related papers: Periodic double tilings of the plane

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

The paper establishes a correspondence relating two specific classes of complex algebraic K3 surfaces. The first class consists of K3 surfaces polarized by the rank-sixteen lattice H+E_7+E_7. The second class consists of K3 surfaces…

We study the diagonals of two-dimensional tilings generated by direct product substitutions. The properties of these diagonals are primarily determined by the eigenvalues of the substitution matrix, but also the order of the letters in the…

We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic tile sets we believe this construction introduces an approach that is different enough to be interesting and…

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 consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…

We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…

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 define 2-dimensional topological substitutions. A tiling of the Euclidean plane, or of the hyperbolic plane, is substitutive if the underlying 2-complex can be obtained by iteration of a 2-dimensional topological substitution. We prove…

Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…

The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…

We study $C^1$-regular surfaces in $R^3$ that admit tilings by a finite number of rigid motion congruence classes of tiles. We construct examples with various topologies and present a framework for a systematic study, mainly concentrating…

We study the existence of periodic solutions in a class of planar Filippov systems obtained from non-autonomous periodic perturbations of reversible piecewise smooth differential systems. It is assumed that the unperturbed system presents a…

We present a construction of a family of non-periodic tilings using elementary tools such as modular arithmetic and vector geometry. These tilings exhibit a distinct type of structural regularity, which we term modulo-staggered rotational…

A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…

For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…

We present a way of tiling the plane with a regular hexagonal network of defects. The network is stable and follows in consequence of the three-junctions that appear in a model of two real scalar fields that presents $Z_3$ symmetry. The…

This paper characterizes all the convex domains which can form six-fold lattice tilings of the Euclidean plane. They are parallelograms, centrally symmetric hexagons, one type of centrally symmetric octagons and two types of decagons.