Symmetries of Julia Sets

Beardon, Alan F.

doi:10.1112/blms/22.6.576

Cited by 56 publications

(49 citation statements)

References 6 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then for all f,g G G, we may write [/, g] = <f>i ° ... ° <f> n for some elements <f>\,...,<f> n ofQ?.ln other words, Notice that in Theorem 4.3, the group H is a subgroup of the conformal automorphism group of J(G). Finally in this section we wish to point out the following result, largely contained in A. Beardon's work[2,3].…”

mentioning

confidence: 91%

The Dynamics of Semigroups of Rational Functions I

Hinkkanen

Martin

1996

Proceedings of the London Mathematical Society

123

219

View full text Add to dashboard Cite

This paper is concerned with a generalisation of the classical theory of the dynamics associated to the iteration of a rational mapping of the Riemann sphere, to the more general setting of the dynamics associated to an arbitrary semigroup of rational mappings. We are partly motivated by results of Gehring and Martin which show that certain parameter spaces for KJeinian groups are essentially the stable basins of infinity for certain polynomial semigroups.Here we discuss the structure of the Fatou and Julia sets and their basic properties. We investigate to what extent Sullivan's 'no wandering domains' theorem remains valid. We obtain a complete generalisation of the classical results concerning classification of basins and their associated dynamics under an algebraic hypothesis analogous to the group-theoretical notion of 'virtually abelian'. We show that, in general, polynomial semigroups can have wandering domains. We put forward some conjectures regarding what we believe might be true. We also prove a theorem about the existence of filled in Julia sets for certain polynomial semigroups with specific applications to the theory of Kleinian groups in mind.

show abstract

mentioning

confidence: 91%

The Dynamics of Semigroups of Rational Functions I

Hinkkanen

Martin

1996

Proceedings of the London Mathematical Society

123

219

View full text Add to dashboard Cite

show abstract

“…In particular, the critical point c i has finite orbit for f t if and only if c j has finite orbit for f t . If deg z h = 1, then h t must be a symmetry of the Julia set of f t ; these were classified in [Be1]. If deg z h > 1, then h t must share an iterate with f t for all t [Ri2]; it follows that condition (4) is symmetric in i and j.…”

mentioning

confidence: 99%

Special Curves and Postcritically Finite Polynomials

Baker¹,

Marco²

2013

Forum math. Pi

106

View full text Add to dashboard Cite

We study the postcritically finite maps within the moduli space of complex polynomial dynamical systems. We characterize rational curves in the moduli space containing an infinite number of postcritically finite maps, in terms of critical orbit relations, in two settings: (1) rational curves that are polynomially parameterized; and (2) cubic polynomials defined by a given fixed point multiplier. We offer a conjecture on the general form of algebraic subvarieties in the moduli space of rational maps on P 1 containing a Zariski-dense subset of postcritically finite maps.2010 Mathematics Subject Classification: 37F45 (primary); 11G50, 30C10 (secondary) OverviewIn this paper we address the question 'Which algebraic subvarieties of the moduli space M d of degree-d rational maps contain a Zariski-dense set of special points?' Here, a special point is the conjugacy class of a postcritically finite map f : P 1 → P 1 ; that is, every critical point of f has finite forward orbit under iteration. Postcritically finite (PCF) maps play an important role in complex dynamics, and in recent years there has been an explosion of work around them. It has been known since the foundational work of Thurston based on Teichmüller theory that PCF maps come in two flavors, the flexible Lattès maps (associated with elliptic curves and arising in one-dimensional families) and the rest (which are rigid). The rigid PCF maps form a countable Zariski-dense subset of the moduli space M d . From an arithmetic point of view, PCF maps are in several ways similar to elliptic curves with complex multiplication, and one can therefore view the above question as a dynamical analog of the André-Oort conjecture in arithmetic geometry. We formulate a conjectural answer to the above question: the special subvarieties V having a dense set of special points should M. Baker and L. DeMarco 2 be those for which the number of dynamically independent critical points does not exceed the dimension of V.As evidence for our general conjecture, we study rational curves within the parameter space of critically marked, monic, centered, degree-d polynomials. Our main result provides an explicit description of the polynomially parameterized rational curves that are special: they are those for which there is exactly one active critical orbit, up to polynomial symmetries. (We in fact prove a more general result about marked but not necessarily critical points that are simultaneously preperiodic.) We provide examples showing that the 'up to symmetries' condition is necessary, and we illustrate how one can check that a given curve is special. We also study the family of curves Per 1 (λ) inside the space of cubic polynomials. First introduced by Milnor, Per 1 (λ) is defined as the set of maps with a fixed point of multiplier λ. The curve Per 1 (0), defined by the condition that one critical point is fixed, is special, and we prove that Per 1 (λ) is not special for all λ = 0.The proofs of these results rely on several ingredients, including: (1) an arithmetic equidistr...

show abstract

“…For a polynomial f ∈ C[X], we let J(f ) denote the Julia set of f (see [Bea91, Chapter 3] or [Mil99] for the definition of a Julia set of a rational function over the complex numbers). As proved by Beardon [Bea90,Bea92], any family of polynomials which have the same Julia set J is determined by the symmetries of J . , which we will use later.…”

Section: Symmetries Of the Julia Setmentioning

confidence: 99%