A refined energy bound for perpendicular bisectors

TL;DR

This paper improves the lower bound on the number of distinct perpendicular bisectors determined by a set of points in the plane, advancing towards a conjecture that this number is quadratic unless many points lie on a single line or circle.

Contribution

It establishes a refined lower bound of (n^{52/35 - \u03b5}) for the number of distinct perpendicular bisectors, progressing toward the quadratic bound conjectured.

Findings

Either a line or circle contains half the points, or the number of perpendicular bisectors is (n^{52/35 - })

The proof involves bounding quadruples with shared perpendicular bisectors

Progress towards the conjecture of quadratic number of perpendicular bisectors

Abstract

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by pairs of points in $\mathcal{P}$ is $\Omega(n^{52/35 - \epsilon})$, where the constant implied by the $\Omega$ notation depends on $\mathcal{P}$. This is progress toward a conjecture of Lund, Sheffer, and de Zeeuw, that either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors is $\Omega(n^2)$. The proof relies bounding the size of a carefully selected subset of the quadruples $(a,b,c,d) \in \mathcal{P}^4$ such that the perpendicular bisector of $a$ and $b$ is the same as the perpendicular bisector of $c$ and $d$.