2000 character limit reached
Stable Polynomials over Finite Fields (1206.4979v1)
Published 21 Jun 2012 in math.NT
Abstract: We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial case described by R. Jones and N. Boston. Moreover, for characteristic three, we show that certain polynomials of degree three are not stable. We also use the Weil bound for multiplicative character sums to estimate the number of stable arbitrary polynomials over finite fields of odd characteristic.
Sponsor
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.