pith. sign in

arxiv: 2408.12371 · v2 · pith:WML4DAAJnew · submitted 2024-08-22 · 🧮 math.DS

Invariant graphs in Julia sets and decompositions of rational maps

classification 🧮 math.DS
keywords finitejuliarationalcontainsgraphmapsmathbboverline
0
0 comments X
read the original abstract

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$ such that $f^n(G) \subset G$. This graph contains all post-critical points in the Julia set, while every component of $\overline{\mathbb{C}}\setminus G$ contains at most one post-critical point in the Fatou set. The proof relies on the cluster-Sierpinski decomposition of post-critically finite rational maps.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Rigidity of McMullen Julia sets

    math.DS 2026-06 unverdicted novelty 7.0

    Complete quasisymmetric classification and rigidity proof for Julia sets of postcritically finite McMullen maps, establishing first rigid examples in carpet, necklace, and cluster classes.