Eventually stable quadratic polynomials over Q

MaRDI QIDQ2190809zbMATH OpenFDO

Authors David Demark, Wade Hindes, Rafe Jones, Moses Misplon, Michael Stoneman, Michael Stoll

Publication date 22 June 2020

Published in The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.09220, http://nyjm.albany.edu/j/2020/26-25.html

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

zbMATH Keywords

hyperelliptic curvesiterated polynomialsrational pointsirreducible polynomialsarboreal Galois representation

Mathematics Subject Classification ID

Galois theory (11R32) Polynomials (irreducibility, etc.) (11R09) Polynomials in general fields (irreducibility, etc.) (12E05) Density theorems (11R45) 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 $mathbbQ$) 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 $mathbbQ$). Previous work of Hamblen, Jones, and Madhu shows that $f_r$ is eventually stable unless $r$ has the form $1/c$ for some integer $cotin0,-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 $logB$. 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 $10^9$.

Recommendations

• On stable quadratic polynomials
• Irreducibility of the iterates of a quadratic polynomial over a field
• Eventually stable rational functions
• Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\)
• An estimate on the number of stable quadratic polynomials

Cites work

• scientific article; zbMATH DE number 1466163 (Why is no real title available?)
• scientific article; zbMATH DE number 781760 (Why is no real title available?)
• An iterative construction of irreducible polynomials reducible modulo every prime
• Chabauty methods using elliptic curves
• Current trends and open problems in arithmetic dynamics
• Dynamical Galois groups of trinomials and Odoni's conjecture
• Eventually stable rational functions
• Finding rational points on bielliptic genus 2 curves
• Finite index theorems for iterated Galois groups of cubic polynomials
• Finite index theorems for iterated Galois groups of unicritical polynomials
• Galois group over \(\mathbb{Q}\) of some iterated polynomials
• Galois properties of torsion points on abelian varieties
• Galois representations from pre-image trees: an arboreal survey
• Galois theory of quadratic rational functions
• Integer points in backward orbits
• Properties of Iterates and Composites of Polynomials
• Rational points on curves
• The Magma algebra system. I: The user language
• The density of prime divisors in the arithmetic dynamics of quadratic polynomials
• The density of primes in orbits of \(z^d+c\)

Cited in

(10)

• Stabilité des polynômes
• An estimate on the number of stable quadratic polynomials
• Stability of certain higher degree polynomials
• Stable polynomials over finite fields
• Dynamical irreducibility of polynomials modulo primes
• Eventually stable rational functions
• Current trends and open problems in arithmetic dynamics
• Newly reducible iterates in families of quadratic polynomials
• On the complexity of exact counting of dynamically irreducible polynomials
• On stable quadratic polynomials

Describes a project that uses

Uses Software

• LMFDB
• Magma

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)