Related papers: Invariant graphs of rational maps

In this paper, we prove that for any post-critically finite rational map $f$ on the Riemann sphere $\overline{\mathbb{C}}$, and for each sufficiently large integer $n$, there exists a finite and connected graph $G$ in the Julia set of $f$…

The postcritical set $P(f)$ of a rational map $f:\mathbb P^1\to \mathbb P^1$ is the smallest forward invariant subset of $\mathbb P^1$ that contains the critical values of $f$. In this paper we show that every finite set $X\subset \mathbb…

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 prove that any Latt\`es map can be approximated by strictly postcritically finite rational maps which are not Latt\`es maps.

In this paper, we prove that if $R\colon\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ is a postcritically finite rational map with Julia set homeomorphic to the Sierpi\'nski carpet, then there is an integer $n_0$, such that, for any $n\ge…

This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…

It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical…

We show that in the family of degree $d\geq 2$ rational maps of the Riemann sphere, the closure of strictly postcritically finite maps contains a (relatively) Baire generic subset of maps displaying maximal non-statistical behavior: for a…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

Given a rational map $f:\overline{\mathbb C}\to \overline{\mathbb C}$ and a finite graph $G\subset \overline{\mathbb C}$ such that $f(G)\subset G$ and $f$ is expanding on some neighbourhood of $G$, we show that there is another finite graph…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

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…

The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…

For a post-critically finite hyperbolic rational map $f$, we show that its Julia set $\mathcal{J}_f$ has Ahlfors-regular conformal dimension one if and only if $f$ is a crochet map, i.e., there is an $f$-invariant connected graph $G$…

We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…

A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…

Let $f$ be a rational map with degree at least two. We prove that $f$ has at least $2$ disjoint and infinite critical orbits in the Julia set if it has a Herman ring. This result is sharp in the following sense: there exists a cubic…

In this paper, we study hyperbolic rational maps with finitely connected Fatou sets. We construct models of post-critically finite hyperbolic tree mapping schemes for such maps, generalizing post-critically finite rational maps in the case…

Let $ R $ be a rational map with totally disconnected Julia set $ J(R). $ If the postcritical set on $ J(R) $ contains a non-persistently recurrent (or conical) point, then we show that the map $ R $ can not be a structurally stable map.

Let C be a finite connected graph for which there is a countable universal C-free graph, and whose tree of blocks is a path. Then the blocks of C are complete. This generalizes a result of Furedi and Komjath, and fits naturally into a set…