arXiv subjects

Mark Comerford

Publications and source records attributed to Mark Comerford.

13 recordsLinked to original sources

arXiv2025

Thick-Thin 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. For non-autonomous iteration where one considers compositions of polynomials from a sequence which is in general allowed to vary, the Julia set is uniformly perfect for all sequences with suitably bounded coefficients, while Comerford, Stankewitz and Sumi showed in \cite{CSS} that for certain sequences of polynomials with unbounded coefficients, it is possible to have Julia sets which are HNUP. In this manuscript we give an example of a non-autonomous polynomial sequences whose Julia sets lie in between these two extremes in that they are not uniformly perfect, but also not HNUP. In addition we show that these Julia sets can be expressed as a `thick-thin' decomposition consisting of a ${\mathrm F}_\sigma$ subset which is a countable union of uniformly perfect sets and a ${\mathrm G}_\delta$ subset which is HNUP.

math.DS↗

arXiv2022

Mandelbrot sets for fixed template iterations

We study the dynamics of template iterations, consisting of arbitrary compositions of functions chosen from a finite set of polynomials. In particular, we focus on templates using complex unicritical maps in the family $\{ z^d + c, c \in \mathbb{C}, d \ge 2 \}$. We examine the dependence on parameters of the connectedness locus for a fixed template and show that, for most templates, the connectedness locus moves upper semicontiuously. On the other hand, one does not in general have lower semicontinuous dependence, and we show this by means of a counterexample.

math.DS↗

arXiv2021

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↗

arXiv2019

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↗

arXiv2018

On Possible Limit Functions on a Fatou Component in non-Autonomous Iteration

The possibilities for limit functions on a Fatou component for the iteration of a single polynomial or rational function are well understood and quite restricted. In non-autonomous iteration, where one considers compositions of arbitrary polynomials with suitably bounded degrees and coefficients, one should observe a far greater range of behaviour. We show this is indeed the case and we exhibit a bounded sequence of quadratic polynomials which has a bounded Fatou component on which one obtains as limit functions every member of the classical Schlicht family of normalized univalent functions on the unit disc. The proof is based on quasiconformal surgery and the use of high iterates of a quadratic polynomial with a Siegel disc which closely approximate the identity on compact subsets. Careful bookkeeping using the hyperbolic metric is required to control the errors in approximating the desired limit functions and ensure that these errors ultimately tend to zero.

math.DS↗

arXiv2016

Orbit Portraits in non-Autonomous Iteration

We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits can be realized by the dynamics associated with sequences of polynomials with suitably uniformly bounded degrees and coefficients. We show that, in the case of sequences of polynomials of constant degree, the portraits which arise are eventually periodic which is somewhat similar to the classical theory of polynomial iteration. However, if the degrees of the polynomials in the sequence are allowed to vary, one can obtain portraits with complementary arcs of irrational length which are fundamentally different from the classical ones.

math.DS↗

arXiv2012

Preservation of External Rays in non-Autonomous Iteration

We consider the dynamics arising from the iteration of an arbitrary sequence of polynomials with uniformly bounded degrees and coefficients and show that, as parameters vary within a single hyperbolic component in parameter space, certain properties of the corresponding Julia sets are preserved. In particular, we show that if the sequence is hyperbolic and all the Julia sets are connected, then the whole basin at infinity moves holomorphically. This extends also to the landing points of external rays and the resultant holomorphic motion of the Julia sets coincides with that obtained earlier using grand orbits. In addition, if a finite set of external rays separate the Julia set for a particular parameter value, then the rays with the same external angles separate the Julia set for every parameter in the same hyperbolic component.

math.DS↗

arXiv2012

A Straightening Theorem for non-Autonomous Iteration

The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences arising from a varying sequence of functions. In order to do this, new techniques are required to control the distortion and quasiconformal dilatation of the hybrid equivalence. In particular, the Caratheodory topology for pointed domains allows us to specify the appropriate bounds on the sequence of sets on which the polynomial-like mapping sequence is defined and give us good estimates on the degree of distortion and quasiconformality.

math.DS↗

arXiv2011

The Caratheodory Topology for Multiply Connected Domains I

We consider the convergence of pointed multiply connected domains in the Caratheodory topology. Behaviour in the limit is largely determined by the properties of the simple closed hyperbolic geodesics which separate components of the complement. Of particular importance are those whose hyperbolic length is as short as possible which we call meridians of the domain. We prove a continuity result on convergence of such geodesics for sequences of pointed hyperbolic domains which converge in the Caratheodory topology to another pointed hyperbolic domain. Using this we describe an equivalent condition to Caratheodory convergence which is formulated in terms of Riemann mappings to standard slit domains.

math.CV↗

arXiv2011

The Caratheodory Topology for Multiply Connected Domains II

We continue our exposition concerning the Caratheodory topology for multiply connected domains by introducing the notion of boundedness for a family of pointed domains of the same connectivity. The limit of a convergent sequence of n-connected domains which is bounded in this sense is again n-connected and will satisfy the same bounds. We prove a result which establishes several equivalent conditions for boundedness. This allows us to extend the notions of convergence and equicontinuity to families of functions defined on varying domains.

math.CV↗

arXiv2011

On the Modulus of a Union of Nested Annuli

We prove a result which gives sufficient conditions for a conformal annulus which is a countable union of nested conformal annuli to have bounded modulus. Our theorem also gives estimates for the modulus of such an annulus and is proved using an interpolation result which constructs a quasiconformal map between two annuli given a smooth identification of their boundaries.

math.CV↗

arXiv2011

Non-Autonomous Julia Sets with Invariant Sequences of Measurable Line Fields

The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable bounds on the degrees and coefficients. We show that the natural generalization of the no invariant line fields conjecture to this setting is not true. In particular, we construct a sequence of quadratic polynomials whose iterated Julia sets all have positive area and which has an invariant sequence of measurable line fields whose supports are these iterated Julia sets.

math.DS↗

arXiv2011

Short Separating Geodesics for Multiply Connected Domains

We consider the following questions: given a hyperbolic plane domain and a separation of its complement into two disjoint closed sets each of which contains at least two points, what is the shortest closed hyperbolic geodesic which separates these sets and is it a simple closed curve? We show that a shortest curve always exists although in general it may not be simple. However, one can also always find a shortest simple curve and we call such a geodesic a \emph{meridian} of the domain. Meridians generalize to domains of higher connectivity the notion of the equator of an annulus as the shortest geodesic which separates the complement. We show that although they are not in general uniquely defined, if one of the sets of the separation of the complement is connected, then they are unique and are also the shortest possible closed curves which separate the complement in this fashion.

math.CV↗