2000 character limit reached
Commuting rational functions revisited
Published 8 Aug 2018 in math.DS | (1808.02774v3)
Abstract: Let $B$ be a rational function of degree at least two that is neither a Latt`es map nor conjugate to $z{\pm n}$ or $\pm T_n$. We provide a method for describing the set $C_B$ consisting of all rational functions commuting with $B.$ Specifically, we define an equivalence relation $\underset{B}{\sim}$ on $ C_B$ such that the quotient $ C_B/\underset{B}{\sim}$ possesses the structure of a finite group $G_B$, and describe generators of $G_B$ in terms of the fundamental group of a special graph associated with $B$.
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.