Computing points of small height for cubic polynomials

From MaRDI portal
Publication:2390627

DOI10.2140/INVOLVE.2009.2.37zbMATH Open1194.37187arXiv0807.0468OpenAlexW2962782498MaRDI QIDQ2390627FDOQ2390627


Authors: Yanyan Li Edit this on Wikidata


Publication date: 31 July 2009

Published in: Involve (Search for Journal in Brave)

Abstract: Let f in Q[z] be a polynomial of degree d at least two. The associated canonical height hat{h}_f is a certain real-valued function on Q that returns zero precisely at preperiodic rational points of f. Morton and Silverman conjectured in 1994 that the number of such points is bounded above by a constant depending only on d. A related conjecture claims that at non-preperiodic rational points, hat{h}_f is bounded below by a positive constant (depending only on d) times some kind of height of f itself. In this paper, we provide support for these conjectures in the case d=3 by computing the set of small height points for several billion cubic polynomials.


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




Recommendations





Cited In (6)





This page was built for publication: Computing points of small height for cubic polynomials

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