Revista Matemática Iberoamericana · 2014 · 15 citations · 12 references
Natural SciencesMathematicsAlgebraCombinatoricsNumber TheoryAbstract AlgebraArithmetic GeometryQuadratic FormsStabilityArithmetic Of Finite FieldsFinite Field Arithmetic
We use the theory of resultants to study the stability, that is, the property of having all iterates irreducible, of an arbitrary polynomial f over a finite field \mathbb{F}_q . This result partially generalizes the quadratic polynomial case described by R. Jones and N. Boston. Moreover, for p=3 , 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 polynomials over a finite field of odd characteristic.
12
Choice Reviews Online · 2000 · 1.6K citations
Prime and composite polynomials
J. F. Ritt · Transactions of the American Mathematical Society · 1922 · 294 citations
Factorization of polynomials over finite fields
Richard G. Swan · Pacific Journal of Mathematics · 1962 · 256 citations · Full text