Events, Meetings, Workshops, and Conferences
Details about recent and upcoming events related to the collaboration can be found below:
January 12 (Marriott Marquis San Diego Marina Hotel)
Please RSVP at firstname.lastname@example.org.
February 1, 2018
February 2, 2018
This public collaboration lecture will discuss the predictions of the Langlands program for K3 surfaces, presenting some examples, open problems, and computational challenges. At 4:00pm at MIT. Abstract
February 5, 2018
February 6, 2018
Rigorous computation of the endomorphism ring of a Jacobian Collaboration PI John Voight (Dartmouth) speaks in the Brown University Algebra seminar on algorithms for the rigorous computation of the endomorphism ring of the Jacobian of a curve defined over a number field. Abstract
April 6, 2018
Number field fragments and Fermat’s last theorem
Simons Collaboration Seminar (open to all) by Bjorn Poonen (MIT)
3:30-4:30pm in MIT room 6-120
We describe an attempt (unsuccessful so far) to give a new proof of Fermat’s last theorem, involving geometry of numbers and the isotypic components of a Galois number field viewed as a representation of its Galois group.
May 10-14 (ICERM)
Many collaboration members will attend this ICERM workshop on birational geometry. Abstract
July 16-20 (University of Wisconsin, Madison)
Many collaboration members will attend this bi-annual conference on algorithmic number theory.
August 20-24 (MIT)
The collaboration’s first conference will take place at MIT.
June 3-7 (ICERM)
In this workshop, we will explore a number of themes in the arithmetic of abelian varieties of low dimension (typically dimension 2–4), with a focus on computational aspects. Topics will include the study of torsion points, Galois representations, endomorphism rings, Sato-Tate distributions, Mumford-Tate groups, complex and p-adic analytic aspects, L-functions, rational points, and so on.
Our goal is for the workshop to bring together researchers working on abelian varieties in a number of facets to establish collaborations, develop algorithms, and stimulate further research.