2000 character limit reached
On the cycles of components of disconnected Julia sets
Published 9 Apr 2019 in math.DS | (1904.04541v2)
Abstract: For any integers $d\ge 3$ and $n\ge 1$, we construct a hyperbolic rational map of degree $d$ such that it has $n$ cycles of the connected components of its Julia set except single points and Jordan curves.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.