Related papers: Fractal dimension for Inhomogeneous graph-directed…
Iterated function systems (IFSs) are one of the most important tools for building examples of fractal sets exhibiting some kind of `approximate self-similarity'. Examples include self-similar sets, self-affine sets etc. A beautiful variant…
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…
In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…
This paper seeks conditions that ensure that the attractor of a graph directed iterated function system (GD-IFS) cannot be realised as the attractor of a standard iterated function system (IFS). For a strongly connected directed graph, it…
We show that for the attractor $(K_{1},\dots,K_{q})$ of a graph directed iterated function system, for each $1\leq j\leq q$ and $\varepsilon>0$ there exits a self-similar set $K\subseteq K_{j}$ that satisfies the strong separation condition…
We prove that the upper box dimension of an inhomogeneous self-affine set is bounded above by the maximum of the affinity dimension and the dimension of the condensation set. In addition, we determine sufficient conditions for this upper…
We study a wide class of fractal interpolation functions in a single platform by considering the domains of these functions as general attractors. We obtain lower and upper bounds of the box dimension of these functions in a more general…
We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. Under a mild separation condition, we show that the Hausdorff and box dimensions of the attractor are equal to the minimum of 1…
The attractors of iterated function systems are usually obtained as the Hausdorff limit of any non-empty compact subset under iteration. In this note we show that an iterated function system on a boundedly compact metric space has compact,…
For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of standard (1-vertex directed graph) IFSs, with or without separation…
In the context of general iterated function systems (IFSs), we introduce bilinear fractal interpolants as the fixed points of certain Read-Bajraktarevi\'{c} operators. By exhibiting a generalized "taxi-cab" metric, we show that the graph of…
A central question in the field of inhomogeneous attractors has been to relate the dimension of an inhomogeneous attractor to the condensation set and associated homogeneous attractor. This has been achieved only in specific settings, with…
In this paper, the product of the Hausdorff metric on the product space is defined and the equivalency between the product Hausdorff metric and the Hausdorff metric on the product space is established. The finite product of the iterated…
Iterated Function Systems (IFSs) have been at the heart of fractal geometry almost from its origin, and several generalizations for the notion of IFS have been suggested. Subdivision schemes are widely used in computer graphics and attempts…
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…
In this paper, we characterize a novel separation property for IFS-attractors on complete metric spaces. Such a separation property is weaker than the strong open set condition (SOSC) and becomes necessary to reach the equality between the…
This is the second part of our study of the dimension theory of $C^1$ iterated function systems (IFSs) and repellers on ${\Bbb R}^d$. In the first part we proved that the upper box-counting dimension of the attractor of any $C^1$ IFS on…
In the paper, we define a class of new fractals named ``non-autonomous attractors", which are the generalization of classic Moran sets and attractors of iterated function systems. Simply to say, we replace the similarity mappings by…
This is the first article in a two-part series containing some results on dimension estimates for $C^1$ iterated function systems and repellers. In this part, we prove that the upper box-counting dimension of the attractor of any $C^1$…
The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…