2026-08-16T05:16:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5108 2024-03-06T10:35:54Z ddc:004 open_access

Bisector Energy and Few Distinct Distances Lund, Ben Sheffer, Adam de Zeeuw, Frank Combinatorial geometry distinct distances incidence geometry We introduce the bisector energy of an n-point set P in the real plane, defined as the number of quadruples (a,b,c,d) from P such that a and b determine the same perpendicular bisector as c and d. If no line or circle contains M(n) points of P, then we prove that the bisector energy is O(M(n)^{2/5}n^{12/5} + M(n)n^2). We also prove the lower bound M(n)n^2, which matches our upper bound when M(n) is large. We use our upper bound on the bisector energy to obtain two rather different results: (i) If P determines O(n / sqrt(log n)) distinct distances, then for any 0 < a < 1/4, either there exists a line or circle that contains n^a points of P, or there exist n^{8/5 - 12a/5} distinct lines that contain sqrt(log n) points of P. This result provides new information on a conjecture of Erdös regarding the structure of point sets with few distinct distances. (ii) If no line or circle contains M(n) points of P, then the number of distinct perpendicular bisectors determined by P is min{M(n)^{-2/5}n^{8/5}, M(n)^{-1}n^2}). This appears to be the first higher-dimensional example in a framework for studying the expansion properties of polynomials and rational functions over the real numbers, initiated by Elekes and Ronyai. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ben Lund and Adam Sheffer and Frank de Zeeuw 2015 Is Part Of LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SOCG.2015.537 urn:nbn:de:0030-drops-51086 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.537 eng https://creativecommons.org/licenses/by/3.0/legalcode