Polynomial semiconjugacies, decompositions of iterations, and invariant curves
Abstract
We study the functional equation A X=X B, where A, B, and X are polynomials over 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:\, C2 → C2 of the form (x,y)→ (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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.