Search Clay Mathematics Institute

  • About
    About
    • About
    • History
    • Principal Activities
    • Who’s Who
    • CMI Logo
    • Policies
  • Programs & Awards
    Programs & Awards
    • Programs & Awards
    • Funded programs
    • Fellowship Nominations
    • Clay Research Award
    • Dissemination Award
  • People
  • The Millennium Prize Problems
    The Millennium Prize Problems
    • The Millennium Prize Problems
    • Birch and Swinnerton-Dyer Conjecture
    • Hodge Conjecture
    • Navier-Stokes Equation
    • P vs NP
    • Poincaré Conjecture
    • Riemann Hypothesis
    • Yang-Mills & the Mass Gap
    • Rules for the Millennium Prize Problems
  • Online resources
    Online resources
    • Online resources
    • Books
    • Video Library
    • Lecture notes
    • Collections
      Collections
      • Collections
      • Euclid’s Elements
      • Ada Lovelace’s Mathematical Papers
      • Collected Works of James G. Arthur
      • Klein Protokolle
      • Notes of the talks at the I.M.Gelfand Seminar
      • Quillen Notebooks
      • Riemann’s 1859 Manuscript
  • Events
  • News

Home — Events — Explicit p-Adic Methods in Number Theory, Sage Days 71

Explicit p-Adic Methods in Number Theory, Sage Days 71

Date: 20 March 2016 - 24 March 2014

Location: Mathematical Institute, University of Oxford

Event type: CMI Workshop

Organisers: Jennifer Balakrishnan (Oxford), David Roe (Pittsburgh)

This workshop aims to illuminate a cluster of ideas centered around p-adic methods in number theory.  It will begin with an introduction to Sage and the six chosen themes for the week, aimed at number theorists who would like to learn more about each topic.  For the remainder of the week, each day will begin with research talks in the morning, followed by extended working time in the afternoons and evenings, where participants will have a chance to discuss and implement p-adic algorithms.

The topics have been chosen for their potential to generate productive discussion between experts in related fields:
(1)  Point-counting algorithms based on p-adic cohomology have advanced from Kedlaya’s algorithm in 2001 to the recent work of Harvey on computing zeta functions in average polynomial time.
(2) Algorithms for computation of p-adic heights on elliptic curves allow investigations of the p-adic Birch and Swinnerton-Dyer Conjecture and conjectures in Iwasawa theory.
(3) Overconvergent modular symbols are used to compute p-adic L-functions and investigate p-adic families of modular forms.
4) Motivic integration has proven useful theoretically in p-adic representation theory and the Langlands program, and has the potential to allow the computation of orbital integrals.
(5) Work by the CETHop project in p-adic Hodge theory provides computational access to theoretical links between Galois representations and linear algebraic data.
(6) The Chabauty-Coleman method can produce rational points on higher genus curves with small Mordell-Weil rank. Kim’s nonabelian Chabauty program explores the challenge of higher rank.

Share

Related events

See all events
See all events
  • Privacy Policy
  • Contact CMI

© 2025 Clay Mathematics Institute

Site by One