COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
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 problemAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCambridge DOCking Station Bioinformatics joint CRI-BSU series 12th Annual Disability LectureOther talksMathematical fictions and mathematicians’ choices The SORTS project: A co-produced training resource for secondary school staff to provide a supportive response to students who self-harm. How hypervelocity stars constrain the Galactic Centre Hold for EHT OfB How is limb size controlled during development and repair? New approaches for an old question Neural Fields for Embedded Variational Problems in Imaging |