SearcharxivSearch

arXiv subjects

Rich Stankewitz

Publications and source records attributed to Rich Stankewitz.

12 recordsLinked to original sources

Uniformly perfect analytic and conformal non-autonomous attractor sets

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane C have uniformly perfect attractor sets. Examples are given to illustrate the main theorem, as well as to indicate how it generalizes other results. Examples are also given to illustrate how natural generalizations of corresponding results for autonomous IFS's do not hold in general in this more flexible setting.

math.CV

Uniformly perfect and hereditarily non uniformly perfect analytic and conformal non-autonomous attractor sets

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane have uniformly perfect attractor sets, while other conditions imply the attractor is pointwise thin, and thus hereditarily non uniformly perfect. Examples are given to illustrate the main theorems, as well as to indicate how they generalize other results. Examples are also given to illustrate how possible generalizations of corresponding results for autonomous IFS's do not hold in general in this more flexible setting. Further, applications to non-autonomous Julia sets are given. Lastly, since our definition of NIFS is in some ways more general than others found in the literature, a careful analysis is given to show when certain familiar relationships still hold, along with detailed examples showing when other relationships do not hold.

math.DS

Hereditarily non Uniformly Perfect non-Autonomous Julia Sets

Hereditarily non uniformly perfect (HNUP) sets were introduced by Stankewitz, Sugawa, and Sumi in \cite{SSS} who gave several examples of such sets based on Cantor set-like constructions using nested intervals. We exhibit a class of examples in non-autonomous iteration where one considers compositions of polynomials from a sequence which is in general allowed to vary. In particular, we give a sharp criterion for when Julia sets from our class will be HNUP and we show that the maximum possible Hausdorff dimension of $1$ for these Julia sets can be attained. The proof of the latter considers the Julia set as the limit set of a non-autonomous conformal iterated function system and we calculate the Hausdorff dimension using a version of Bowen's formula given in the paper by Rempe-Gillen and Urbánski \cite{RU}.

math.DS

Hereditarily Non Uniformly Perfect Sets

We introduce the concept of hereditarily non uniformly perfect sets, compact sets for which no compact subset is uniformly perfect, and compare them with the following: Hausdorff dimension zero sets, logarithmic capacity zero sets, Lebesgue 2-dimensional measure zero sets, and porous sets. In particular, we give an example of a compact set in the plane of Hausdorff dimension 2 (and positive logarithmic capacity) which is hereditarily non uniformly perfect.

math.CV

Backward Iteration Algorithms for Julia sets of Möbius Semigroups

We extend a result regarding the Random Backward Iteration algorithm for drawing Julia sets (known to work for certain rational semigroups containing a non-Möbius element) to a class of Möbius semigroups which includes certain settings not yet been dealt with in the literature, namely, when the Julia set is not a thick attractor in the sense given in [David Fried, Sebastian. M. Marotta, and Rich Stankewitz, Complex dynamics of Möbius semigroups, Ergodic Theory Dynam. Systems, 32(6):1889--1929, 2012].

math.DS

Random Backward Iteration Algorithm for Julia sets of Rational Semigroups

We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the context of iteration of a rational map of degree two or more, extends to finitely generated rational semigroups (of a certain type). We also provide some consequences of this result.

math.DS

Dynamical properties and structure of Julia sets of postcritically bounded polynomial semigroups

We discuss the dynamic and structural properties of polynomial semigroups, a natural extension of iteration theory to random (walk) dynamics, where the semigroup $G$ of complex polynomials (under the operation of composition of functions) is such that there exists a bounded set in the plane which contains any finite critical value of any map $g \in G$. In general, the Julia set of such a semigroup $G$ may be disconnected, and each Fatou component of such $G$ is either simply connected or doubly connected (\cite{Su01,Su9}). In this paper, we show that for any two distinct Fatou components of certain types (e.g., two doubly connected components of the Fatou set), the boundaries are separated by a Cantor set of quasicircles (with uniform dilatation) inside the Julia set of $G.$ Important in this theory is the understanding of various situations which can and cannot occur with respect to how the Julia sets of the maps $g \in G$ are distributed within the Julia set of the entire semigroup $G$. We give several results in this direction and show how such results are used to generate (semi) hyperbolic semigroups possessing this postcritically boundedness condition.

math.DS

Some counterexamples in dynamics of rational semigroups

We give an example of two rational functions with non-equal Julia sets that generate a rational semigroup whose completely invariant Julia set is a closed line segment. We also give an example of polynomials with unequal Julia sets that generate a non nearly Abelian polynomial semigroup with the property that the Julia set of one generator is equal to the Julia set of the semigroup. These examples show that certain conjectures in the field of dynamics of rational semigroups do not hold as stated and therefore require the allowance of certain exceptional cases.

math.DS

Uniformly perfect analytic and conformal attractor sets

Conditions are given which imply that analytic iterated function systems (IFS's) in the complex plane have uniformly perfect attractor sets. In particular, it is shown that the attractor set of a finitely generated conformal IFS is uniformly perfect when it contains two or more points. Also, an example of a finitely generated analytic attractor set which is not uniformly perfect is given.

math.DS

Completely invariant sets of normality for rational semigroups

Let G be a semigroup of rational functions of degree at least two where the semigroup operation is composition of functions. We prove that the largest open subset of the Riemann sphere on which the semigroup G is normal and is completely invariant under each element of G, can have only 0, 1, 2, or infinitely many components.

math.DS

Uniformly perfect sets, rational semigroups, Kleinian groups and IFS's

We show that the Julia set of a non-elementary rational semigroup G is uniformly perfect when there is a uniform bound on the Lipschitz constants of the generators of G. This also proves that the limit set of a non-elementary Moebius group is uniformly perfect when there is a uniform bound on the Lipschitz constants of the generators of the group and this implies that the limit set of a finitely generated non-elementary Kleinian group is uniformly perfect.

math.DS

Completely invariant Julia sets of polynomial semigroups

Let G be a semigroup of rational functions of degree at least two, under composition of functions. Suppose that G contains two polynomials with non-equal Julia sets. We prove that the smallest closed subset of the Riemann sphere which contains at least three points and is completely invariant under each element of G, is the sphere itself.

math.DS