Related papers: Uniformly perfect analytic and conformal attractor…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
Orbital fuzzy iterated function systems are obtained as a combination of the concepts of iterated fuzzy set system and orbital iterated function system. It turns out that, for such a system, the corresponding fuzzy operator is weakly…
For $n,d\in\mathbb{N}$ we consider the families: - $L_n^d$ of attractors for iterated function systems (IFS) consisting of $n$ contractions acting on $[0,1]^d$, - $wL_n^d$ of attractors for weak iterated function systems (wIFS) consisting…
In this note we give a simple sufficient condition for an affine iterated function system to admit an invariant affine subspace persistently with respect to changes in the translation parameters. This yields further examples of tuples of…
We study small perturbations of a sectional hyperbolic set of a vector field on a compact manifold. Indeed, we obtain robustly finiteness of homoclinic classes on this scenary. Moreover, since attractor and repeller sets are particular…
We prove necessary and sufficient conditions for the informational completeness of an arbitrary set of Gaussian observables on continuous variable systems with finite number of degrees of freedom. In particular, we show that an…
The term "overlapping" refers to a certain fairly simple type of piecewise continuous function from the unit interval to itself and also to a fairly simple type of iterated function system (IFS) on the unit interval. A correspondence…
We study fractal sets $\Gamma\subset \mathbb{R}^n$ with non-empty interior $\Omega$, that are attractors of iterated function systems (IFSs) of contracting similarities satisfying the open set condition. Examples for $n=2$ are the closures…
Non-autonomous iterated function systems are a generalization of iterated function systems. If the contractions in the system are conformal mappings, it is called a non-autonomous conformal iterated function system, and its attractor is…
For some fractal measures it is a very difficult problem in general to prove the existence of spectrum (respectively, frame, Riesz and Bessel spectrum). In fact there are examples of extremely sparse sets that are not even Bessel spectra.…
This paper concerns the local connectedness of components of self-similar sets. Given an equal partition of the unit square into n*n small squares, we may choose arbitrarily two or more of them and form an iterated function system. The…
The use of iteration and piecewise functions allows analytic expression of the trajectories of an R\"ossler-like attractor, avoiding infinite series solution. It seems possible to extend this approach to other attractors, even if the…
Let $\{S_i\}_{i=1}^\ell$ be an iterated function system (IFS) on $\R^d$ with attractor $K$. Let $(\Sigma,\sigma)$ denote the one-sided full shift over the alphabet $\{1,..., \ell\}$. We define the projection entropy function $h_\pi$ on the…
We completely describe the equilibrium states of a class of potentials over the full shift which includes Falconer's singular value function for affine iterated function systems with invertible affinities. We show that the number of…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…
In these lecture notes we present connections between the theory of iterated function systems, in particular those attractors that are graphs of multivariate real-valued fractal functions, foldable figures and affine Weyl groups, and…
The main theorem of this paper establishes conditions under which the "chaos game" algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non contractive iterated…
We construct a model structure on simplicial profinite sets such that the homotopy groups carry a natural profinite structure. This yields a rigid profinite completion functor for spaces and pro-spaces. One motivation is the \'etale…
In this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the…