University of Cambridge > Talks.cam > Discrete Analysis Seminar > Lower bounds for incidences and Heilbronn's triangle problem

Lower bounds for incidences and Heilbronn's triangle problem

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

  • UserDmitrii Zakharov (Massachusetts Institute of Technology) World_link
  • ClockWednesday 29 January 2025, 13:30-15:00
  • HouseMR4, CMS.

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

Upper bounds on the number of incidences between points and lines, tubes, and other geometric objects, have many applications in combinatorics and analysis. On the other hand, much less is known about lower bounds. We prove a general lower bound for the number of incidences between points and tubes in the plane under a natural spacing condition. In particular, if you take n points in the unit square and draw a line through each point, then there is a non-trivial point-line pair with distance at most n-2/3+o(1). This quickly implies that any n points in the unit square define a triangle of area at most n-7/6+o(1), giving a new upper bound for the Heilbronn’s triangle problem. Joint work with Alex Cohen and Cosmin Pohoata.

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-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity