Iterated function systems over arbitrary shift spaces

Abstract

The orbit of a point x∈ X in a classical iterated function system (IFS) can be defined as \fu(x)=fun·s fu1(x): u=u1·s un is a word of a full shift on finite symbols and fui is a continuous self map on X \. One also can associate to σ=σ1σ2·s∈ a non-autonomous system (X,\,fσ) where the trajectory of x∈ X is defined as x,\,fσ1(x),\,fσ1σ2(x),….Here instead of the full shift, we consider an arbitrary shift space . Then we investigate basic properties related to this IFS and the associated non-autonomous systems. In particular, we look for sufficient conditions that guarantees that in a transitive IFS one may have a transitive (X,\,fσ) for some σ∈ and how abundance are such σ's.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…