Congratulations to Maarten Derickx

Maarten Derickx was awarded the Schoonschip Prize from the Computer Algebra of the Netherlands (CAN) Foundation for best Ph.D. thesis of Dutch universities involving Computer Algebra. Dr. Derickx’s thesis title is Torsion points on elliptic curves on number fields of small degree (Leiden, 2016).

The Schoonschip Prize is named after the first Dutch computer algebra system called Schoonschip. This system was developed in the 1960s by Nobel laureate Martinus J.G. Veltman to assist with renormalizations of gauge theories, and later inspired systems like Mathematica.

Annotating the L-functions and Modular Forms Database

During the week of March 18-22, 2019, a workshop was held at the Institute for Advanced Study (IAS) in Princeton. This workshop had approximately 20 participants, and it was supported in part by the IAS, the American Institute of Mathematics (AIM), and the Simons Foundation. We explored several ways to improve the dissemination of mathematical knowledge via the LMFDB, including: expanding on the current use of “knowls” to display context-free information, implementing annotations which provide context and references associated to individual mathematical objects (as in the OEIS), and implementing a way to visualize the many predictions of the Langlands program within the framework of the LMFDB.

Bjorn Poonen

Arnold Ross Lecture on “Elliptic curves”

Collaboration PI Bjorn Poonen will deliver the Arnold Ross Lecture on the topic “Elliptic curves” to an expected audience of over 1000 high school students at the 45th ARML competition at the Pennsylvania State University on May 31, 2019.

Abelian varieties over finite fields

Currently the L-Functions and Modular Forms Database (http://www.lmfdb.org/) includes a database of isogeny classes of abelian varieties over finite fields, identified by their q-Weil polynomials. This meeting set out to enumerate the isomorphism classes within each isogeny class. In the ordinary case, this translates to a problem about complex lattices, and Marseglia has shown how to effectively solve this by enumerating ideal classes in CM orders.

The workshop started by setting up a schema for how we will identify isomorphism classes, including the desired structural data, and we kicked off computations in an initial range. We discussed how to compute polarizations on each isogeny class, and the solution to this problem (enumerating short lattice vectors subject to positivity, up to equivalence) also provides a way to compute isogenies between the isomorphism classes. This will be practical to compute – at least in some range – and we studied examples of isogeny graphs.

A new statistical model challenges long-held assumptions on the possible ranks of elliptic curves.

Quanta Magazine features an article describing recent research involving Simons Collaboration team members
Bjorn Poonen and John Voight, inspired by earlier research by Noam Elkies.
Learn more

Coding sprint at the Arithmetic Geometry, Number Theory, and Computation conference

A coding sprint was part of a follow-up development week for the Arithmetic Geometry, Number Theory, and Computation conference held at MIT from August 20-24. The photo, taken by John Cremona feature “sprinters” Alex Best, David Roe, David Lowry-Douda, Edgar Costa, Maarten Derickx, and John Voight.

Conference on Arithmetic Geometry, Number Theory, and Computation

The collaboration announced its first conference will be held at MIT this summer, August 20-24, 2018. Learn more.

Mathematicians Crack the Cursed Curve

Collaboration PI Jennifer Balakrishnan is featured in this Quanta article describing the effort to determine all rational points on the split Cartan modular curve Xsplit(13) of level 13, also known as the “cursed curve”, by realizing Minhyong Kim’s nonabelian approach to the Chabauty method. Learn more.

2018 International Congress of Mathematicians in Rio de Janeiro

Collaboration PI, Bjorn Poonen, will speak at the 2018 International Congress of Mathematicians in Rio de Janeiro on a heuristic probabilistic model for elliptic curves. The model suggests a uniform bound for their rank over the rational numbers. Learn more

Record-setting number theory computation on Google

Collaboration PI, Andrew Sutherland, recently broke the record for the largest ever Compute Engine cluster, with 220,000 cores on Preemptible VMs, the largest known high-performance computing cluster to ever run in the public cloud. Learn more