Computing points of small height for cubic polynomials

Details Computing points of small height for cubic polynomials Computing points of small height for cubic polynomials

2008-07-03

arxiv.org/abs/0807.0468v3

Mathematics

Number Theory

Final version, to appear in Involve. 20 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing points of small height for cubic polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing points of small height for cubic polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing points of small height for cubic polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115111