Related papers: A code space for a generalized IFS
Cabrelli, Forte, Molter and Vrscay in 1992 considered a {fuzzy} version of the theory of iterated function systems (IFSs in short) and their fractals%The idea was to extend the classical Hutchinson-Barnsley operator to selfmaps of a metric…
We give a systematic account of iterated function systems (IFS) of weak contractions of different types (Browder, Rakotch, topological). We show that the existence of attractors and asymptotically stable invariant measures, and the validity…
Factorizable joint shift (FJS) represents a type of distribution shift (or dataset shift) that comprises both covariate and label shift. Recently, it has been observed that FJS actually arises from consecutive label and covariate (or vice…
We investigate the use of iterated function system (IFS) models for data analysis. An IFS is a discrete dynamical system in which each time step corresponds to the application of one of a finite collection of maps. The maps, which represent…
We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…
Generalized topological spaces in the sense of Cs\'{a}sz\'{a}r have two main features which distinguish them from typical topologies. First, these families of subsets are not closed under intersections. Second, we allow for the possibility…
We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…
We consider iterated functions systems (IFS) on compact metric spaces and introduce the concept of target sets. Such sets have very rich dynamical properties and play a similar role as semifractals introduced by Lasota and Myjak do for…
The present article is devoted to one class of generalizations of the Salem functions. To construct such functions by systems of functional equations, the generalized shift operator is used.
Shift-invariant spaces (SISs) on the real line provide a natural framework for representing, analyzing and processing signals with inherent shift-invariant structure. In this paper, we extend this framework to the finite undirected graph…
We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…
The present article is devoted to the generalized Salem functions, the generailed shift operator, and certain related problems. A description of further investigations of the author of this article is given.These investigations (in terms of…
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…
We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on…
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) - compact fixed sets of self-similarity mapping. The method is based on a function which for a direction,…
We investigate Tree Iterated Function Systems (TIFSs), which we introduce in this paper. TIFSs are the generalizations of Iterated Function Systems in which we take the maps independently at each step and each block. In this paper, we give…
We introduce a harmonic analysis for a class of affine iteration models in $\br^d$. Using Hilbert-space geometry, we develop a new duality notion for affine and contractive iterated function systems (IFSs) and we construct some identities…
This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem…
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,…
Functional programmers have an established tradition of using traversals as a design pattern to work with recursive data structures. The technique is so prolific that a whole host of libraries have been designed to help in the task of…