Growth of points on hyperelliptic curves over number fields (Q2155607)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Growth of points on hyperelliptic curves over number fields
scientific article

    Statements

    Growth of points on hyperelliptic curves over number fields (English)
    0 references
    0 references
    15 July 2022
    0 references
    Let \(C\) be a smooth projective curve defined over \(\mathbb{Q}\) and \(\overline{\mathbb{Q}}\) an algebraic closure of \(\mathbb{Q}\). For a positive integer \(n\) and a positive real number \(X\), we define the quantity \(N_{n,C}(X,G)\) to be the number of extensions \(K=\mathbb{Q}(P)\), where \(P\in C(\overline{\mathbb{Q}})\), with degree \([K : \mathbb{Q}] = n\), \(\mathrm{Gal}(\overline{K}/ \mathbb{Q}) \cong G\), and bounded absolute discriminant \(|\mathrm{Disc}(K)| \leq X\). In this paper, the case where \(C\) is a hyperelliptic curve \(g \geq 1\) is studied. Assume that \(C\) is defined by an equation \(y^2=f(x)\), where \(f(x)\) is a polynomial of \(\mathbb{Q}[x]\) with \(\deg f = d\). If \(d = 2g+1\) and \(n \geq d\), then it is proved that \(N_{n,C}(X,S_3) \gg X^{c_n}\), where \[ c_n = \frac{1}{4}- \frac{gn^2-(g^2-2g-3)n-2g^2}{2n^2(n-1)}, \] and when \(n\) is sufficiently large, \[ c_n = \frac{1}{4}- \frac{gn+g^2-2g}{2n(n-1)}. \] Furthermore, if \(d = 2g+2\) and \(n \geq d+2\) is even, then it is proved that \(N_{n,C}(X,S_3)\gg X^{c_n}\), where \[ c_n = \frac{1}{4}-\frac{(1+2g)n^2-(2g^2-2g-8)n-(4g^2+4g)}{4n^2(n-1)}, \] and when \(n\) is sufficiently large, \[ c_n = \frac{1}{4}-\frac{(1+2g)n^2-2g^2+2g+2}{4n(n-1)}. \] These results generalise that of \textit{R. J. Lemke Oliver} and \textit{F. Thorne} and recovers their bound when \(g = 1\) [Int. Math. Res. Not. 2021, No. 24, 18411--18441 (2021; Zbl 1491.11059)].
    0 references
    arithmetic statistics
    0 references
    hyperelliptic curves
    0 references
    Diophantine stability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references