Related papers: A code space for a generalized IFS
The paper is devoted to searching algorithms which will allow to generate images of attractors of \emph{generalized iterated function systems} (GIFS in short), which are certain generalization of classical iterated function systems, defined…
Miculescu and Mihail in 2008 introduced the concept of a \emph{generalized iterated function system} (GIFS in~short), a particular extension of the classical IFS. The idea is that, instead of families of selfmaps of a metric space~$X$,…
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
In 2013 Balka and M\'ath\'e showed that in uncountable polish spaces the typical compact set is not a fractal of any IFS. In 2008 Miculescu and Mihail introduced a concept of a generalized iterated function system (GIFS in short), a…
Miculescu and Mihail in 2008 introduced a concept of a generalized iterated function system (GIFS in short), a particular extension of classical IFS. Instead of families of selfmaps of a metric space $X$, they considered families of…
In this paper, influenced by the ideas from A. Mihail, The canonical projection between the shift space of an IIFS and its attractor as a fixed point, Fixed Point Theory Appl., 2015, Paper No. 75, 15 p., we associate to every generalized…
Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…
We introduce the novel concept of hypercomplex iterated function system (IFS) on the complete metric space $(\mathbb{A}_{n+1}^k,d)$ and define its hypercomplex attractor. Systems of hypercomplex function systems arising from hypercomplex…
In this paper, we reformulate the definition of the iterated function systems (denoted by general IFSs in this paper) and show the existence and uniqueness (in some sense) of the limit sets generated by the general IFSs, to unify the…
An infinite iterated function system (IIFS) is a countable collection of contraction maps on a compact metric space. In this paper we study the conditions under which the attractor of a such system admits a parameterization by a continuous…
We provide a new algorithm (called the grid algorithm) designed to generate the image of the attractor of a generalized iterated function system on a finite dimensional space and we compare it with the deterministic algorithm regarding…
We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…
The study of generalized iterated function systems (GIFS) was introduced by Mihail and Miculescu in 2008. We provide a new approach to study those systems as the limit of the Hutchinson-Barnsley setting for infinite iterated function…
In this paper we introduce expansive iterated function systems, ( IFS) on a compact metric space then various shadowing properties and their equivalence are considered for expansive IFS.
In this paper, we present the generalized iterated function system for constructing of common fractals of generalized contractive mappings in the setup of dislocated metric spaces. The well-posedness of attractors based problems of rational…
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…
Iterated function systems (IFS) provide a powerful method for constructing fractals and modeling complex structures. This paper develops the notion of a dynamical system of IFS to study how an initial IFS evolves over time. We construct a…
We develop a qualitative-dynamics framework for general Iterated Function Systems (IFSs) on locally compact spaces. Our approach extends to IFSs a framework recently developed in the semiflows setting by James Yorke and the present author…
The orbit of a point $x\in X$ in a classical iterated function system (IFS) can be defined as $\{f_u(x)=f_{u_n}\circ\cdots \circ f_{u_1}(x):$ $u=u_1\cdots u_n$ is a word of a full shift $\Sigma$ on finite symbols and $f_{u_i}$ is a…
Iterated functions system (IFS) is defined by specifying a set of functions in a classical phase space, which act randomly on an initial point. In an analogous way, we define a quantum iterated functions system (QIFS), where functions act…