Polynomial compositions with large monodromy groups and applications to arithmetic dynamics
Abstract: For a composition $f=f_1\circ\cdots \circ f_r$ of polynomials $f_i\in \mathbb Q[x]$ of degrees $d_i\geq 5$ with alternating or symmetric monodromy group, we show that the monodromy group of $f$ contains the iterated wreath product $A_{d_r}\wr \cdots\wr A_{d_1}$. A similar property holds more generally for polynomials that do not factor through $xd$ or Chebyshev. We derive consequences to arithmetic dynamics regarding arboreal representations, and forward and backward orbits of such $f$. In particular, given an orbit $(a_n)_{n=0}\infty$ of $f$ as above, we show that for "almost all" $a\in \mathbb Z$, the set of primes $p$ for which some $a_n$ is congruent to $a$ mod $p$ is "small".
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.