Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lower bounds for incidences

Published 11 Sep 2024 in math.CO, math.CA, and math.MG | (2409.07658v2)

Abstract: Let $p_1,\ldots,p_n$ be a set of points in the unit square and let $T_1,\ldots,T_n$ be a set of $\delta$-tubes such that $T_j$ passes through $p_j$. We prove a lower bound for the number of incidences between the points and tubes under a natural regularity condition (similar to Frostman regularity). As a consequence, we show that in any configuration of points $p_1,\ldots, p_n \in [0,1]2$ along with a line $\ell_j$ through each point $p_j$, there exist $j\neq k$ for which $d(p_j, \ell_k) \lesssim n{-2/3+o(1)}$. It follows from the latter result that any set of $n$ points in the unit square contains three points forming a triangle of area at most $n{-7/6+o(1)}$. This new upper bound for Heilbronn's triangle problem attains the high-low limit established in our previous work arXiv:2305.18253.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.