Andrew V. Sutherland
genus 1:
genus 2:
genus 3:
drew@math.mit.edu |

I am a Principal Research Scientist here in the math department at MIT, focused on computational number theory and arithmetic geometry.
Here is a larger photograph and links to my arXiv, MathSciNet, and Google Scholar pages. My office is in room 2-341 in the Simons Building (Building 2). For spring 2019 my office hours are M 2:30-3:30 and T 1:30-2:30.

My work is supported by grants from the National Science Foundation and the Simons Foundation, and I am part of the Simons Collaboration on Arithmetic Geometry, Number Theory, and Computation.

In a pair of March 18 preprints, Harvey and van der Hoeven announced a proof of the Schönhage-Strassen conjecture: the complexity of integer multiplication is

Sato-Tate distributions in genus 1.

Sato-Tate distributions in genus 2.

Sato-Tate distributions in genus 3 (a few examples).

genus 2 curves over of small discriminant over

genus 3 hyperelliptic curves of small discriminant over

genus 3 non-hyperelliptic curves of small discriminant over

Modular polynomials of all levels up to 300 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 described 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).

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.