Glasgow Mathematical Journal · 2012 · 19 citations · 13 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationInvariant TheoryQuadratic FormsStabilityStability Of OrbitsStability TheoryArithmetic Of Finite FieldsQuadratic Fields
Abstract 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.
13