University of Cambridge > Talks.cam > Discrete Analysis Seminar > A Proto Inverse Szemerédi–Trotter Theorem

A Proto Inverse Szemerédi–Trotter Theorem

Add to your list(s) Download to your calendar using vCal

  • UserOlivine Silier (UC Berkeley)
  • ClockWednesday 06 November 2024, 13:30-15:00
  • HouseMR4, CMS.

If you have a question about this talk, please contact dm672.

A point-line incidence is a point-line pair such that the point is on the line. The Szemerédi-Trotter theorem says the number of point-line incidences for n (distinct) points and lines in R2 is tightly upperbounded by O(n4/3). We advance the inverse problem: we geometrically characterize ‘sharp’ examples which saturate the bound by proving the existence of a nice cell decomposition we call the two bush cell decomposition. The proof crucially relies on the crossing number inequality from graph theory and has a traditional analysis flavor.

Our two bush cell decomposition also holds in the analogous point-unit circle incidence problem. This constitutes an important step towards obtaining an ε improvement in the unit-distance problem.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity