Polynomial bound for the number of rational points on curves (Q449704)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial bound for the number of rational points on curves
scientific article

    Statements

    Polynomial bound for the number of rational points on curves (English)
    0 references
    0 references
    31 August 2012
    0 references
    Let \(k\) be a number field, with discriminant \(\Delta\). Let \(f\in k[X,Y]\) be a polynomial of degree \(D\). The main theorem of the paper states that the set of affine \(k\)-rational points of \(f(x,y)=0\) is either infinite or bounded by \[ \text{exp}\left(2^{3^{D^2}}[K:{\mathbb Q}]^4 \max (h_\infty(F), \log|\Delta|, 1)\right), \] where \(h_\infty(F)\) denotes the logarithm of the maximum archimedean absolute value of the coefficients of \(F\). The paper uses a simple estimate of the number of points of \({\mathbb P}^n(\bar{\mathbb Q})\) of degree \(\leq D\) and of height \(\leq H\) and compares with a previous paper of the same author [Proc. Lond. Math. Soc. (3) 101, No. 3, 759--794 (2010; Zbl 1210.11073)], improving the term of the estimate concerning the height but losing (substantially) on the dependence on the degree.
    0 references
    Curves over number fields
    0 references
    number of rational points
    0 references

    Identifiers