English

Stability of Certain Higher Degree Polynomials

Number Theory 2022-06-10 v1

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 d2d\geq 2, cZ{0}c\in{\mathbb{Z}\setminus\{0\}}. We show that for infinite families of d3d\geq 3, whenever f(z)f(z) is irreducible, all its iterates are irreducible, that is, f(z)f(z) is stable. For c1(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 c1012|c|\leq{10^{12}}.

Keywords

Cite

@article{arxiv.2206.04290,
  title  = {Stability of Certain Higher Degree Polynomials},
  author = {Shanta Laishram and Ritumoni Sarma and Himanshu Sharma},
  journal= {arXiv preprint arXiv:2206.04290},
  year   = {2022}
}
R2 v1 2026-06-24T11:44:31.520Z