Andrew V. Sutherland
genus 1:
genus 2:
genus 3:
(he/him/his) drew@math.mit.edu |

I am a Principal Research Scientist in the mathematics department at MIT, focused on computational number theory and arithmetic geometry.
Here is a larger photograph, my CV, and links to my arXiv, MathSciNet, zbMath, DBLP, Google Scholar and Wikipedia pages. My office is in room 2-341 in the Simons Building (Building 2).

My work is supported by grants from the National Science Foundation and the Simons Foundation; I am a Principal Investigator in the Simons Collaboration on Arithmetic Geometry, Number Theory, and Computation.

Thanks to the generous support of the NSF, funding is available for US-based participants who wish to attend the ANTS-XV conference in the UK.

Sato-Tate distributions in dimension 3 (all 410 of them).

Elliptic curves (18.783), Spring 2022 (the 2021 version is now available on OCW).

VaNTAGe (co-organized with Rachel Pries).

MIT number theory seminar (co-organized with Bjoon Poonen and Wei Zhang).

BC-MIT number theory seminar (co-organized with Sol Friedberg, Ben Howard, Keerthi Madapusi Pera, Bjorn Poonen, Zhiwei Yun, and Wei Zhang).

psetpartners.mit.edu (Administrator), 2020-present.

researchseminars.org (Administrator), 2020-present.

The Number Theory Foundation (President), 2019-present.

Algorithmic Number Theory Symposia (Steering Committee), 2019-present.

CoCalc (Advisory Board), 2018-present.

Research in Number Theory (Editor in Chief), Springer, 2017-present.

L-functions and Modular Forms Database (Managing Editor), 2016-present.

Mathematics of Computation (Associate Editor), 2014-present.

to appear in Forum of Mathematics, Sigma (code and data)

Appendix to

Mathematics of Computation

Arithmetic Geometry, Number Theory, and Computation, Simons Symposia (2021), 123-213.

Discrete Analysis 2021, Paper No. 23, 23 pp. [MR 4341956, Zbl 7471813]

Proceedings of the National Academy of Sciences

Fourteenth Algorithmic Number Theory Symposium (ANTS XIV), The Open Book Series

Arithmetic Geometry, Cryptography, and Coding Theory, Contemporary Mathematics

Comptes Rendus Mathematique

Analytic Methods in Arithmetic Geometry, Contemporary Mathematics

Arithmetic Geometry: Computations and Applications, Contemporary Mathematics

Thirteenth Algorithmic Number Theory Symposium (ANTS XIII), The Open Book Series

Thirteenth Algorithmic Number Theory Symposium (ANTS XIII), The Open Book Series

Research in the Mathematical Sciences

Mathematics of Computation

Algebra and Number Theory

Proceedings of the AMS

International Journal of Number Theory

Twelfth Algorithmic Number Theory Symposium (ANTS XII), LMS Journal of Computation and Mathematics

Twelfth Algorithmic Number Theory Symposium (ANTS XII), LMS Journal of Computation and Mathematics

Twelfth Algorithmic Number Theory Symposium (ANTS XII), LMS Journal of Computation and Mathematics

Forum of Mathematics, Sigma

Frobenius distributions: Lang-Trotter and Sato-Tate conjectures, Contemporary Mathematics

Frobenius distributions: Lang-Trotter and Sato-Tate conjectures, Contemporary Mathematics

Frobenius distributions: Lang-Trotter and Sato-Tate conjectures, Contemporary Mathematics

Journal of Number Theory

Mathematics of Computation

LMS Journal of Computation and Mathematics

Algebra and Number Theory

Research in the Mathematical Sciences

Eleventh Algorithmic Number Theory Symposium (ANTS XI), LMS Journal of Computation and Mathematics

Algebra and Number Theory

Foundations of Computational Mathematics

Tenth Algorithmic Number Theory Symposium (ANTS X), The Open Book Series

Tenth Algorithmic Number Theory Symposium (ANTS X), The Open Book Series

Tenth Algorithmic Number Theory Symposium (ANTS X), The Open Book Series

LMS Journal of Computation and Mathematics

LMS Journal of Computation and Mathematics

Compositio Mathematica

Proceedings of the London Mathematical Society

Journal de Théorie des Nombres de Bordeaux

Designs, Codes, and Cryptography

Mathematics of Computation

Mathematics of Computation

Mathematics of Computation

Mathematics of Computation

Journal of Number Theory

Ninth Algorithmic Number Theory Symposium (ANTS IX), Lecture Notes in Computer Science

Ramanujan Journal

Journal de Théorie des Nombres de Bordeaux

Arithmetic, Geometry, Cryptography, and Coding Theory, Contemporary Mathematics

Mathematics of Computation

Algorithmic Number Theory 8th International Symposium (ANTS VIII), Lecture Notes in Computer Science

PhD thesis, Massachusetts Institute of Technology, 2007 (errata, award) [MR 2717420]

Appendix to

Lecture 1 slides; Lecture 2 slides; Lecture 3 slides, Lecture 4 slides.

Lecture 1 video; Lecture 2 video; Lecture 3 video; Lecture 4 video.

Lecture 1 slides; Lecture 2 slides; Lecture 5 slides.

Lecture 1 slides, video; Lecture 2 video; Lecture 3 video; Lecture 4 video; Lecture 5 slides, video; Lecture 6 video.

Sums of cubes

Sato-Tate distributions in genus 1.

Sato-Tate distributions in genus 2.

Sato-Tate distributions in genus 3.

genus 2 curves over ℚ.

genus 3 curves over ℚ.

Modular polynomials of all levels up to 300 and prime levels up to 1000 for the

Modular polynomials of prime level up to 5000 for the Weber ƒ function

Modular polynomials of prime level up to 200 for various modular functions used by classpoly

Optimized equations for

Optimized equations for

Alternative defining equations for

Defining equations for

Table of factored norms of singular moduli

Partition class polynomials, as defined in

Elliptic curve point-counting records

Record CM constructions of elliptic curves

Pairing-friendly Edwards curves of near-prime order with embedding degree 6

Pairing-friendly curves of prime order with embedding degree 6

Pairing-friendly curves of prime order with embedding degree 10

101 useful trace zero varieties

Gallery of large Jacobians

Narrow admissible tuples database (part of the bounded gaps between primes polymath project).

rforest_v1.0.tar, as described in

classpoly_v1.0.2.tar, as described in

smoothrelation_v1.3.tar, as described in

smalljac_v4.1.3.tar, as described in

ff_poly_v1.2.7.tar, fast finite field arithmetic over word size prime fields (up to 61 bits).

ff_poly_big_v1.2.7.tar, fast finite field arithmetic over word size prime fields (up to 61 bits), uses David Harvey's zn_poly library to more efficiently handle polynomials of large degree.

Many of the research products (publications/data/software) listed above were supported by NSF grants DMS-1115455 and DMS-1522526, and Simons Foundation grant 550033.

Computational support has been provided by Google Cloud and Charity Engine.

I am committed to making my research accessible to as many people as possible. Please contact me if you have difficulty accessing any of the content on this site.

See this link for more information about accessibility at MIT.