Related papers: Dynamics of Siegel Rational Maps with Prescribed C…
In this paper, we introduce cosine Thurston maps. In particular, we construct postsingularly finite topological cosine maps and focus on such maps with strictly preperiodic critical points. We use the techniques of Hubbard, Schleicher, and…
We prove that cubic polynomial maps with a fixed Siegel disk and a critical orbit eventually landing inside that Siegel disk lie in the support of the bifurcation measure. This answers a question of Dujardin in positive. Our result implies…
We extend uniform pseudo-Siegel bounds for neutral quadratic polynomials to $\psi^\bullet$-quadratic-like Siegel maps. In this form, the bounds are compatible with the $\psi$-quadratic-like renormalization theory and are easily transferable…
It has been shown that the Sierpi\'nski gasket-like sets can appear as the Julia sets of some geometrically finite rational maps. In this paper we prove that such type of Julia sets can also appear in the rational maps containing Siegel…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…
We study rational self-maps of $\mathbb{P}^{1}$ whose critical points all have finite forward orbit. Thurston's rigidity theorem states that outside a single well-understood family, there are finitely many such maps over $\mathbb{C}$ of…
We study the class of entire transcendental maps of finite order with one critical point and one asymptotic value, which has exactly one finite pre-image, and having a persistent Siegel disc. After normalisation this is a one parameter…
The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…
Consider a quadratic polynomial with a fixed Siegel disc of bounded type. Using an adaptation of complex a priori bounds for critical circle maps, we prove that this Siegel polynomial is conformally mateable with the basilica polynomial.
Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…
We prove that if two non-renormalizable cubic Siegel polynomials with bounded type rotation numbers are combinatorially equivalent, then they are also conformally equivalent. As a consequence, we show that in the one-parameter slice of…
We demonstrate that the question whether or not a given postcritically finite topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.
We investigate rational maps with period one and two cluster cycles. Given the definition of a cluster, we show that, in the case where the degree is $d$ and the cluster is fixed, the Thurston class of a rational map is fixed by the…
We provide a complete combinatorial classification of critically fixed anti-Thurston maps, i.e., orientation-reversing branched covers of the 2-sphere that fix every critical point. The first step in the proof, and an interesting result in…
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at…
In this paper, we construct geometrically finite rational maps with buried critical points on the boundaries of some hyperbolic components by using the pinching and plumbing deformations.
A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of the Thurston algorithm in obstructed cases, and in one…
In this paper, we study CTP maps, that is, marked rational maps with constant Thurston pullback mapping. We prove that all the regular or mixing CTP polynomials satisfy McMullen's condition. Additionally, we construct a new class of…
A Thurston map is a branched covering map $f\colon S^2\to S^2$ that is postcritically finite. Mating of polynomials, introduced by Douady and Hubbard, is a method to geometrically combine the Julia sets of two polynomials (and their…