Eventually stable quadratic polynomials over Q

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

arboreal Galois representation hyperelliptic curves irreducible polynomials iterated polynomials rational points

Polynomials (irreducibility, etc.) (11R09) Galois theory (11R32) Density theorems (11R45) Polynomials in general fields (irreducibility, etc.) (12E05) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05) Dynamical systems over global ground fields (37P15)

Abstract: We study the number of irreducible factors (over

m a t h b b Q

) of the

n

th iterate of a polynomial of the form

f_{r} (x) = x^{2} + r

for rational

r

. When the number of such factors is bounded independent of

n

, we call

f_{r} (x)

extit{eventually stable} (over

m a t h b b Q

). Previous work of Hamblen, Jones, and Madhu shows that

f_{r}

is eventually stable unless

r

has the form

1 / c

for some integer

c o t i n 0, - 1

, in which case existing methods break down. We study this family, and prove that several conditions on

c

of various flavors imply that all iterates of

f_{1 / c}

are irreducible. We give an algorithm that checks the latter property for all

c

up to a large bound

B

in time polynomial in

l o g B

. We find all

c

-values for which the third iterate of

f_{1 / c}

has at least four irreducible factors, and all

c

-values such that

f_{1 / c}

is irreducible but its third iterate has at least three irreducible factors. This last result requires finding all rational points on a genus-2 hyperelliptic curve for which the method of Chabauty and Coleman does not apply; we use the more recent variant known as elliptic Chabauty. Finally, we apply all these results to completely determine the number of irreducible factors of any iterate of

f_{1 / c}

, for all

c

with absolute value at most

1 0^{9}

.

Review text

Let \(K\) be a field, \(\alpha \in K\), \(f \in K[x]\). A pair \((f, \alpha)\) is called {eventually stable over} \(K\) if there exists a constant \(C(f;\alpha)\) such that the number of irreducible factors over \(K\) of \(f^n(x)-\alpha\), where \(f^n\) stands for the \(n\)-th iterate of \(f\), is at most \(C(f;\alpha)\) for all \(n\geq 1\). Also, \(f\) is {eventually stable over} \(K\) if \((f; 0)\) is eventually stable. The authors prove that the polynomial \(f_c(x) = x^2 + 1/c\) is eventually stable over \(\mathbb Q\) for \(c \in {\mathbb Z} \setminus \{0,-1\}\) satisfying \(|c| \leq 10^9\), and that \(C(f_c,0) \leq 4\). They also describe many series of \(c\) when the \(n\)-th iterate of \(f_c\) is irreducible over \(\mathbb Q\) for all \(n \geq 1\).

Recommendations

Cites work

Cited in

(15)

Describes a project that uses

Uses Software

This page was built for publication: Eventually stable quadratic polynomials over \(\mathbb{Q}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190809)