Pith. sign in

REVIEW

Stability of Certain Higher Degree Polynomials

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.04290 v1 pith:E3M26BOM submitted 2022-06-09 math.NT

Stability of Certain Higher Degree Polynomials

classification math.NT
keywords irreduciblestabilityfraciteratespolynomialsarithmeticcertaindegree
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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)=z^d+\frac{1}{c}$ for $d\geq 2$, $c\in{\mathbb{Z}\setminus\{0\}}$. We show that for infinite families of $d\geq 3$, whenever $f(z)$ is irreducible, all its iterates are irreducible, that is, $f(z)$ is stable. For $c\equiv 1\pmod{4}$, we show that all the iterates of $z^2+\frac{1}{c}$ 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|\leq{10^{12}}$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.