pith. sign in

arxiv: 1505.06351 · v3 · pith:QLO4BEQ6new · submitted 2015-05-23 · 🧮 math.NT · math.CV· math.DS

Polynomial semiconjugacies, decompositions of iterations, and invariant curves

classification 🧮 math.NT math.CVmath.DS
keywords mathbbpolynomialresultscirccurvesdecompositionsinvariantiterations
0
0 comments X
read the original abstract

We study the functional equation $A\circ X=X\circ B$, where $A,$ $B$, and $X$ are polynomials over $\mathbb C$. Using previous results of the author about polynomials sharing preimages of compact sets, we show that for given $B$ its solutions may be described in terms of the filled-in Julia set of $B$. On this base, we prove a number of results describing a general structure of solutions. The results obtained imply in particular the result of Medvedev and Scanlon about invariant curves of maps $F:\,\mathbb C^2 \rightarrow \mathbb C^2$ of the form $(x,y)\rightarrow (f(x),f(y))$, where $f$ is a polynomial, and a version of the result of Zieve and M\"uller about decompositions of iterations of a polynomial.

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.