What is Arithmetic Geometry?

Arithmetic geometry is where number theory meets algebraic geometry. Its origins can be traced back to the ancient Greek mathematician Diophantus, who was interested in rational and integral solutions to polynomial equations. Perhaps the most well-known problem of this nature is Fermat's Last Theorem, which asserts that

xⁿ + yⁿ = zⁿ

has no solutions in the integers for n ≥ 3 other than those where x, y, or z is zero. In 1637, Fermat notoriously claimed to have a proof of this assertion but did not write it down, stating instead, "I have discovered a truly marvelous proof of this, which this margin is too narrow to contain." Mathematicians generally believe it was unlikely that Fermat had a complete proof. The problem remained unsolved for over 300 years, until the 1990s, when Andrew Wiles announced a proof that established a profound connection between modular forms and elliptic curves via Galois representations.

In the 21st century, arithmetic geometry has continued to evolve rapidly, greatly benefiting from advances in computing technology. In this area, we often liken computers to “telescopes” as they enable us to see further than ever before and gather tremendous amounts of data. My research in arithmetic geometry aims to advance both theoretical knowledge and computational tools related to the arithmetic of abelian varieties and their Galois representations.

Preprints and Publications

Software Repositories

  • DavenportConstantDB [code]

    • Description: Database of Davenport constants for abelian groups of order up to 500.

    • Joint with Jessica Han

  • ModCrvToEC [code]

    • Description: Magma code for computing maps from a modular curve to an elliptic curve.

    • Joint with Jeremy Rouse

  • PointSearchNumberFields [code]

    • Description: Magma code for searching for points on projective curves over number fields.

    • Joint with Jeremy Rouse and Flora Yi