Bisectors and pinned distances
Combinatorics
2020-12-16 v1
Abstract
We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their bisector energy.
Cite
@article{arxiv.1810.00765,
title = {Bisectors and pinned distances},
author = {Ben Lund and Giorgis Petridis},
journal= {arXiv preprint arXiv:1810.00765},
year = {2020}
}