2003
DOI: 10.1007/b14147
|View full text |Cite
|
Sign up to set email alerts
|

Combinations of Complex Dynamical Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
50
0

Year Published

2007
2007
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(51 citation statements)
references
References 0 publications
1
50
0
Order By: Relevance
“…The whole action, therefore, can be characterized by studying cycles of components. For each component C there are three cases (compare [15,Canonical Decomposition Theorem]): the composition F := F C of all coverings in the cycle (that is the first-return map of C) is one of the following: -a homeomorphism, -a Thurston map with parabolic orbifold, -a Thurston map with hyperbolic orbifold.…”
Section: Pilgrim's Conjecturementioning
confidence: 99%
See 1 more Smart Citation
“…The whole action, therefore, can be characterized by studying cycles of components. For each component C there are three cases (compare [15,Canonical Decomposition Theorem]): the composition F := F C of all coverings in the cycle (that is the first-return map of C) is one of the following: -a homeomorphism, -a Thurston map with parabolic orbifold, -a Thurston map with hyperbolic orbifold.…”
Section: Pilgrim's Conjecturementioning
confidence: 99%
“…10 an application of our approach is given: we prove a conjecture by Kevin Pilgrim [15] (see Theorem 10.3). …”
Section: Introductionmentioning
confidence: 98%
“…Tuning by D (θ) corresponds to the classical ("formal") tuning procedure, as described, for example, in [Mil89,Pil03]. Consequently, the group K (11, D (1/3)) is generated by…”
Section: Figure 9 External Raysmentioning
confidence: 99%
“…These came up in Thurston's topological characterization of critically finite rational maps. For further information, see the Thurston notes [11], the Douady-Hubbard paper [6], the Pilgrim paper [8], or the Pilgrim monograph [9].…”
Section: Critically Finite Mapsmentioning
confidence: 99%