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 — News — 2015 Clay Research Award

2015 Clay Research Award

Date: 04 June 2015

The 2015 Clay Research award has been made jointly to Larry Guth  and Nets Katz for their solution of the Erdős distance problem and for other joint and separate contributions to combinatorial incidence geometry. Their work is an important contribution to the understanding of  the interplay between combinatorics and geometry.

Larry Guth is a professor of mathematics at MIT, having moved there from the Courant Institute in 2012.  He received his PhD in 2005 from MIT under Tomasz Mrowka. Originally working in metric and systolic geometry, he has since made major contributions to harmonic analysis and combinatorics. In particular, he developed ideas introduced by Dvir to prove the multilinear Kakeya  estimate (originally due to Bennett, Carberry and Tao)  and then, with Bourgain, applied them to obtain new results on the  ‘restriction conjecture’ in harmonic analysis.

Nets Katz  has been a professor of mathematics at Caltech since 2013, having previously  been at Indiana University.  He received his PhD in 1993  from the University of Pennsylvania, under Dennis DeTurck.  His earlier work was in harmonic analysis, but more recently he has diversified into combinatorics and PDEs. He has made important contributions in additive number theory, with Bateman on the ‘cap set problem’ and with Bourgain and Tao in their joint proof of the Bourgain–Katz–Tao sum product theorem.  

The distance problem was posed by Paul Erdős in 1946. It concerns the distribution of distances determined by a set of n points in a metric space. At most how many times can the same distance (say the unit distance) occur? What is the minimum number of distinct distances that can occur?

In 2010, Guth and Katz published a spectacular breakthrough in which they gave a near-optimal answer to the second question for points in the plane, by proving an almost tight lower bound of the order of n / log n.  Their paper built on a novel approach to the problem suggested by Elekes and Sharir, and also on the earlier work on the Kakeya problem

Share

More news

See all news
17 March 2025

STEM for Britain 2025

Congratulations to Edwina Yeo (University College London), winner of The Parliamentary & Scientific Committee’s STEM for Britain Gold Medal, sponsored by CMI, for her poster Preventing bacterial surface contamination via mathematical modelling.

Read more
12 February 2025

Babbage Archive

Oxford’s History of Science Museum holds important material associated with Charles Babbage, including components of Babbage’s first (unfinished) mechanical computing machine and an archive of his personal notes about his machines. With support from CMI, the Museum undertook a project to conserve and digitise this precious archive of Babbage material. Image courtesy of the History […]

Read more
2025 Clay Research Fellows
16 January 2025

2025 Clay Research Fellows

The Clay Mathematics Institute is pleased to announce that Ryan Chen, Alex Cohen and Anna Skorobogatova have been awarded Clay Research Fellowships. Ryan Chen will receive his PhD from the Massachusetts Institute of Technology in 2025, where he works under the guidance of Wei Zhang. Ryan has been appointed as a Clay Research Fellow for […]

Read more
Image of the Clay Research Award
01 May 2024

2024 Clay Research Award

Read more
See all news
  • Privacy Policy
  • Contact CMI

© 2025 Clay Mathematics Institute

Site by One