We recall that a polynomial f(X) ∈ K[X] over a field K is called stable if all its iterates are irreducible over K. We show that almost all monic quadratic polynomials f(X) ∈ ℤ[X] are stable over ℚ. We also show that the presence of squares in so-called critical orbits of a quadratic polynomial f(X) ∈ ℤ[X] can be detected by a finite algorithm; this property is closely related to the stability of f(X). We also prove there are no stable quadratic polynomials over finite fields of characteristic 2 but they exist over some infinite fields of characteristic 2. © 2012 Glasgow Mathematical Journal Trust.
CITATION STYLE
Ahmadi, O., Luca, F., Ostafe, A., & Shparlinski, I. E. (2012). On stable quadratic polynomials. Glasgow Mathematical Journal, 54(2), 359–369. https://doi.org/10.1017/S001708951200002X
Mendeley helps you to discover research relevant for your work.