Stability of Certain Higher Degree Polynomials
Abstract
One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of f(z)=zd+1c for d≥ 2, c∈Z\0\. We show that for infinite families of d≥ 3, whenever f(z) is irreducible, all its iterates are irreducible, that is, f(z) is stable. For c 14, we show that all the iterates of z2+1c are irreducible. Also we show that for d=3, if f(z) is reducible, then the number of irreducible factors of each iterate of f(z) is exactly 2 for |c|≤1012.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.