English

Polynomial compositions with large monodromy groups and applications to arithmetic dynamics

Number Theory 2024-02-02 v2

Abstract

For a composition f=f1frf=f_1\circ\cdots \circ f_r of polynomials fiQ[x]f_i\in \mathbb Q[x] of degrees di5d_i\geq 5 with alternating or symmetric monodromy group, we show that the monodromy group of ff contains the iterated wreath product AdrAd1A_{d_r}\wr \cdots\wr A_{d_1}. A similar property holds more generally for polynomials that do not factor through xdx^d or Chebyshev. We derive consequences to arithmetic dynamics regarding arboreal representations, and forward and backward orbits of such ff. In particular, given an orbit (an)n=0(a_n)_{n=0}^\infty of ff as above, we show that for "almost all" aZa\in \mathbb Z, the set of primes pp for which some ana_n is congruent to aa mod pp is "small".

Keywords

Cite

@article{arxiv.2401.17872,
  title  = {Polynomial compositions with large monodromy groups and applications to arithmetic dynamics},
  author = {Joachim König and Danny Neftin and Shai Rosenberg},
  journal= {arXiv preprint arXiv:2401.17872},
  year   = {2024}
}
R2 v1 2026-06-28T14:33:07.581Z