Pinned distinct distances for most norms

About 1 year old · traced to

A dd-norm is a norm ∥⋅∥\|\cdot\| on Rd\mathbb R^d. For a finite point set P⊆RdP\subseteq\mathbb R^d and x∈Px\in P, consider the distinct distances from xx to the other points of PP in this norm.

Pinned most-norms conjecture. For most dd-norms ∥⋅∥\|\cdot\|, every finite point set P⊆RdP\subseteq\mathbb R^d contains a point x∈Px\in P determining (1−o(1))∣P∣(1-o(1))|P| distances to the other points, where the rate of decay o(1)o(1) depends only on ∥⋅∥\|\cdot\|.

The conjecture is proposed as an improvement of the paper's weaker pinned-distance result for typical norms. The source does not state that it has been resolved.

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.