Stability of Certain Higher Degree Polynomials

preprint2022arXivOpen access

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+1cf(z)=z^d+\frac{1}{c} for d≥2d\geq 2, c∈Z∖{0}c\in{\mathbb{Z}\setminus\{0\}}. We show that for infinite families of d≥3d\geq 3, whenever f(z)f(z) is irreducible, all its iterates are irreducible, that is, f(z)f(z) is stable. For c≡1(mod4)c\equiv 1\pmod{4}, we show that all the iterates of z2+1cz^2+\frac{1}{c} are irreducible. Also we show that for d=3d=3, if f(z)f(z) is reducible, then the number of irreducible factors of each iterate of f(z)f(z) is exactly 22 for ∣c∣≤1012|c|\leq{10^{12}}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.