Exponential-growth conjecture for irreducible factors of iterated polynomials
Throughout, let be a pair of polynomials over that are neither critical nor -critical, with irreducible and . Let be the number of irreducible factors of , and let be the maximum degree of one of its irreducible factors. Exponential-growth conjecture. Either
or
The conjecture asserts that at least one of the two factorization statistics always has exponential growth; the preceding lower bound that one of them is large at each level does not by itself establish this asymptotic conclusion.
References
- 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.