Related papers: Simple tiles and attractors

The paper considers systems of contraction similarities in $\mathbb R^d$ sending a given polyhedron $P$ to polyhedra $P_i\subset P$, whose non-empty intersections are singletons and contain the common vertices of those polyhedra, while 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…

We consider a class of planar self-affine sets which we call "box-like". A box-like self-affine set is the attractor of an iterated function system (IFS) of affine maps where the image of the unit square, [0,1]^2, under arbitrary…

Let $M$ be a $2\times2$ real matrix with both eigenvalues less than~1 in modulus. Consider two self-affine contraction maps from $\mathbb R^2 \to \mathbb R^2$, \begin{equation*} T_m(v) = M v - u \ \ \mathrm{and}\ \ T_p(v) = M v + u,…

We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…

We give a construction of a self-similar tiling of the plane with any prescribed expansion coefficient $\lambda\in\C$ (satisfying the necessary algebraic condition of being a complex Perron number). For any integer $m>1$ we show that there…

In the present work, we study the attractors of iterated function systems (IFSs) on connected and compact metric spaces. We prove that the whole of the phase space of a forward minimal IFS, for which some map admits an attracting fixed…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…

This paper studies properties of tilings of the plane by parallelograms. In particular it is established that in parallelogram tilings using a finite number of shapes all tiles occur in only finitely many orientations.

A tiling of $\mathbb{R}^d$ is repulsive if no $r$-patch can repeat arbitrarily close to itself, relative to $r$. This is a characteristic property of aperiodic order, for a non repulsive tiling has arbitrarily large local periodic patterns.…

We investigate the topological and metric properties of attractors of an iterated function system (IFS) whose functions may not be contractive. We focus, in particular, on invertible IFSs of finitely many maps on a compact metric space. We…

Recently a concept of self-excited and hidden attractors was suggested: an attractor is called a self-excited attractor if its basin of attraction overlaps with neighborhood of an equilibrium, otherwise it is called a hidden attractor. For…

This paper refined and introduced some notations (namely attractors, physical attractors, proper attractors, topologically exact and topologically mixing) within the context of relations. We establish necessary and sufficient conditions,…

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…

An effort has been made to show mathematicians some new ideas applied to image analysis. Gray images are presented as tilings. Based on topological properties of the tiling, a number of gray convex hulls: maximal, minimal, and oriented ones…

Let $R$ be an $n\times n$ expanding matrix with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set $\mathcal{D}\subset\mathbb{Z}^n$ so that the integral self-affine set…

While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…

Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…