{"title":"Lower bounds for incidences","authors":"Alex Cohen, Cosmin Pohoata, Dmitrii Zakharov","doi":"arxiv-2409.07658","DOIUrl":null,"url":null,"abstract":"Let $p_1,\\ldots,p_n$ be a set of points in the unit square and let\n$T_1,\\ldots,T_n$ be a set of $\\delta$-tubes such that $T_j$ passes through\n$p_j$. We prove a lower bound for the number of incidences between the points\nand tubes under a natural regularity condition (similar to Frostman\nregularity). As a consequence, we show that in any configuration of points\n$p_1,\\ldots, p_n \\in [0,1]^2$ along with a line $\\ell_j$ through each point\n$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\nsquare contains three points forming a triangle of area at most\n$n^{-7/6+o(1)}$. This new upper bound for Heilbronn's triangle problem attains\nthe high-low limit established in our previous work arXiv:2305.18253.","PeriodicalId":501444,"journal":{"name":"arXiv - MATH - Metric Geometry","volume":"67 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Metric Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.