Number of elements of an elliptic curve by Ciro Santilli 35 Updated +Created
Waring's problem for squares by Ciro Santilli 35 Updated +Created
4 squares are sufficient by Lagrange's four-square theorem.
The subsets reachable with 2 and 3 squares are fully characterized by Legendre's three-square theorem and
Waring problem variant by Ciro Santilli 35 Updated +Created
Charity Engine by Ciro Santilli 35 Updated +Created
Schoof's algorithm by Ciro Santilli 35 Updated +Created
Mordell's theorem by Ciro Santilli 35 Updated +Created
The number of points may be either finite or infinite. But when infinite, it is still a finitely generated group.
For this reason, the rank of an elliptic curve over the rational numbers is always defined.
TODO example.
Quantum computing university course by Ciro Santilli 35 Updated +Created
Legendre's three-square theorem by Ciro Santilli 35 Updated +Created
Sum of two squares theorem by Ciro Santilli 35 Updated +Created
MIT course by Ciro Santilli 35 Updated +Created
Rank of an elliptic curve over the rational numbers by Ciro Santilli 35 Updated +Created
Mordell's theorem guarantees that the rank (number of elements in the generating set of the group) is always well defined for an elliptic curve over the rational numbers. But as of 2023 there is no known algorithm which calculates the rank of any curve!
It is not even known if there are elliptic curves of every rank or not: Largest known ranks of an elliptic curve over the rational numbers, and it has proven extremely hard to find new ones over time.
TODO list of known values and algorithms? The Birch and Swinnerton-Dyer conjecture would immediately provide a stupid algorithm for it.
Department of the University of Oxford by Ciro Santilli 35 Updated +Created
18.783 MIT course by Ciro Santilli 35 Updated +Created
math.mit.edu/classes/18.783, Wow, good slides! Well organized site! This is a good professor! And brutal course. 25 lectures, and lecture one ends in BSD conjecture!
Oxford virtual learning environment by Ciro Santilli 35 Updated +Created
Their status is a mess as of 2020s, with several systems ongoing. Long live the "original" collegiate university!
Largest known ranks of an elliptic curve over the rational numbers by Ciro Santilli 35 Updated +Created
web.math.pmf.unizg.hr/~duje/tors/rankhist.html gives a list with Elkies (2006) on top with:
TODO why this non standard formulation?
Oxford mathematics Moodle by Ciro Santilli 35 Updated +Created
Has a mixture of open access and closed access. But at least it can have open access unlike the in-house systems such as Canvas where everything is necessarily paywalled!
Sometimes things appear open but don't show any meaningful content if you are not logged in, which is annoying.
But at least it gives a clear public course list, thing that certain departments (cough Department of Physics of the University of Oxford cough).
The organization is a bit crap, when you expand e.g. C Michaelmas term it shows nothing, just a search.
The way to go is via the year year categories e.g. "Year 2022-23": courses.maths.ox.ac.uk/course/index.php?categoryid=734. Term splitting is annoying, but one can stand it.
There seems to be no way to list all versions of a single course across multiple years besides just doing a search e.g.
Polynomial time algorithm by Ciro Santilli 35 Updated +Created

There are unlisted articles, also show them or only show them.