The dichotomy conjecture for the growth of irreducible-factor degrees

Throughout, let (f,g)(f,g) be a pair of polynomials over Fq\mathbb{F}_q that are neither critical nor pp-critical, with ff irreducible and degggreaterthanorequalto2deg g greater than or equal to 2. Let Mf,g(n)M_{f,g}(n) denote the maximum degree of an irreducible factor of f(g(n)(x))f(g^{(n)}(x)). The growth dichotomy conjecture. One of the following holds:

Mf,g(n)n;M_{f,g}(n)\approx n;

or

logMf,g(n)n.\log M_{f,g}(n)\gg n.

This would rule out polynomial growth of intermediate degree for Mf,g(n)M_{f,g}(n) and, according to the authors, a proof or disproof would help solve the preceding problem of characterizing the polynomials gg for which Mf,g(n)nM_{f,g}(n)\approx n.

Sources & referencesView supporting material

Primary source

Lucas Reis, “On the factorization of iterated polynomials”, arXiv:1810.07715 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.