REVIEW 1 cited by
Polynomial compositions with large monodromy groups and applications to arithmetic dynamics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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 $x^d$ 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".
Forward citations
Cited by 1 Pith paper
-
Monodromy groups of polynomials of composition length 2
Every composition of two indecomposable polynomials over a characteristic-0 field has a large monodromy kernel unless it is monomial-type, Chebyshev-type, admits a Ritt move, or is one of an explicit list of exception...
Discussion (0). Continue with ORCID to comment.