Eventually stable quadratic polynomials over Q

From MaRDI portal
Publication:2190809

zbMATH Open1446.37100arXiv1902.09220MaRDI QIDQ2190809FDOQ2190809

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

Publication date: 22 June 2020

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

Abstract: We study the number of irreducible factors (over mathbbQ) of the nth iterate of a polynomial of the form fr(x)=x2+r for rational r. When the number of such factors is bounded independent of n, we call fr(x) extit{eventually stable} (over mathbbQ). Previous work of Hamblen, Jones, and Madhu shows that fr 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 f1/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 f1/c has at least four irreducible factors, and all c-values such that f1/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 f1/c, for all c with absolute value at most 109.


Full work available at URL: https://arxiv.org/abs/1902.09220

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



Recommendations




Cites Work


Cited In (5)

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)