The polynomial method in combinatorial incidence geometry
- đ¤ Speaker: Tao, T (University of California, Los Angeles)
- đ Date & Time: Thursday 17 February 2011, 14:00 - 15:00
- đ Venue: Seminar Room 1, Newton Institute
Abstract
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Tao, T (University of California, Los Angeles)
Thursday 17 February 2011, 14:00-15:00