2000 character limit reached
On the factorization of iterated polynomials
Published 17 Oct 2018 in math.NT | (1810.07715v2)
Abstract: Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the iterated polynomials $f(g{(n)}(x))$ over $\mathbb F_q$, such as the largest degree of an irreducible factor and the number of irreducible factors. In particular, we provide significant improvements on the results of D. G\'{o}mez-P\'{e}rez, A. Ostafe and I. Shparlinski (2014).
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.