Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A heuristic for boundedness of ranks of elliptic curves - MaRDI portal

A heuristic for boundedness of ranks of elliptic curves (Q2327704)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A heuristic for boundedness of ranks of elliptic curves
scientific article

    Statements

    A heuristic for boundedness of ranks of elliptic curves (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    Summary: We present a heuristic that suggests that ranks of elliptic curves \(E\) over \(\mathbb{Q}\) are bounded. In fact, it suggests that there are only finitely many \(E\) of rank greater than 21. Our heuristic is based on modeling the ranks and Shafarevich-Tate groups of elliptic curves simultaneously, and relies on a theorem counting alternating integer matrices of specified rank. We also discuss analogues for elliptic curves over other global fields.
    0 references
    elliptic curve
    0 references
    rank
    0 references
    Shafarevich-Tate group
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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