skip to content

The polynomial method in combinatorial incidence geometry

Presented by: 
T Tao University of California, Los Angeles
Thursday 17th February 2011 - 14:00 to 15:00
INI Seminar Room 1
Combinatorial incidence geometry is concerned with controlling the number of possible incidences between a finite number of geometric objects such as points, lines, and circles, in various domains. Recently, a number of breakthroughs in the subject (such as Dvir's solution of the finite field Kakeya conjecture, or Guth and Katz's near-complete solution of the Erdos distance problem) have been obtained by applying the _polynomial method_, in which one uses linear algebra (or algebraic topology) to efficiently captures many of these objects inside an algebraic variety of controlled degree, and then uses tools from algebraic geometry to understand how this variety interacts with the other objects being studied. In this talk we give an introduction to these methods.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons