Weak pinned distance conjecture

About 1 year old · traced to

For a finite point set P⊆R2P\subseteq\mathbb R^2, a point q∈Pq\in P determines the distinct Euclidean distances from qq to the other points of PP.

Weak pinned distance conjecture. For every ε>0\varepsilon>0, there exists a constant Cε>0C_\varepsilon>0 such that every finite point set P⊆R2P\subseteq\mathbb R^2 contains a point q∈Pq\in P determining at least

Cε∣P∣1−εC_\varepsilon |P|^{1-\varepsilon}

distances to the other points of PP.

The conjecture is attributed in the source to Erdős. It is presented as an open conjecture and is used to derive a graphical distinct-realisation conjecture.

References

Primary source

Sean Dewar, Nora Frankl, Samuel Mansfield, Anthony Nixon, Jonathan Passant and Audie Warren, “Generalised Erdős distance theory on graphs”, arXiv:2505.06590 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.