# Things are moving fast!

Lately exciting new results concerning distinct distances are constantly being discovered. Marcos Charalambides just uploaded this paper to arXiv. The main result of the paper is the following.

Theorem 1 (Charalambides). Consider a curve $\gamma \subset {\mathbb R}^d$ of degree $m$, and let $\cal P$ be a set of $n$ points that are contained in $\gamma$. If no irreducible component of $\gamma$ is an algebraic helix, then the number of distinct distances that are determined by $\cal P$ is $\Omega(n^{5/4})$ (where the constant of proportionality depends on $d$ and $m$).

Algebraic helices are lines and geodesics of the Clifford torus, which is the surface that is parameterized as

$(u_1,\cdots,u_k)\to(\alpha_1\cos u_1,\alpha_1\sin u_1,\cdots,\alpha_k\cos u_k,\alpha_k\sin u_k)\subset{\mathbb R}^{2k},$

where $2k\le d$ and $\alpha_1,\cdots,\alpha_k >0$ are constants. One reason why I find this result quite interesting is its connection to characterizing sets that determine a small number of distinct distances (say, $o(n)$ distinct distances; see a brief discussion in this post). Only a few properties of such sets are known. Theorem 1 implies that if $\cal P$ is a planar $n$-point set that determines $o(n)$ distinct distances, then no constant degree curve, except possibly for planar algebraic helices, can contain $\Omega(n^{4/5})$ points of $\cal P$.

Charalambides states that “the proof relies on a link to a certain structural rigidity question on curves”. I still need time to digest how this proof works, but I am always excited to see new connections between combinatorial geometry problems and other parts of math!