Erdős–Ulam problem

The Erdős–Anning theorem states that a set of points with integer distances must either be finite or lie on a single line.[1] However, there are other infinite sets of points with rational distances. For instance, on the unit circle, let S be the set of points

${\displaystyle (\cos \theta ,\sin \theta )}$

where ${\displaystyle \theta }$ is restricted to values that cause ${\displaystyle \tan {\tfrac {\theta }{4}}}$ to be a rational number. For each such point, both ${\displaystyle \sin {\tfrac {\theta }{2}}}$ and ${\displaystyle \cos {\tfrac {\theta }{2}}}$ are themselves both rational, and if ${\displaystyle \theta }$ and ${\displaystyle \varphi }$ define two points in S, then their distance is the rational number

${\displaystyle \left|2\sin {\frac {\theta }{2}}\cos {\frac {\varphi }{2}}-2\sin {\frac {\varphi }{2}}\cos {\frac {\theta }{2}}\right|.}$

More generally, a circle with radius ${\displaystyle \rho }$ contains a dense set of points at rational distances to each other if and only if ${\displaystyle \rho ^{2}}$ is rational.[2] However, these sets are only dense on their circle, not dense on the whole plane.

In 1946, Stanislaw Ulam asked whether there exists a set of points at rational distances from each other that forms a dense subset of the Euclidean plane.[2] While the answer to this question is still open, József Solymosi and Frank de Zeeuw showed that the only irreducible algebraic curves that contain infinitely many points at rational distances are lines and circles.[3] Terence Tao and Jafar Shaffaf independently observed that, if the Bombieri–Lang conjecture is true, the same methods would show that there is no infinite dense set of points at rational distances in the plane.[4][5] Using different methods, Hector Pasten proved that the abc conjecture also implies a negative solution to the Erdős–Ulam problem.[6]

If the Erdős–Ulam problem has a positive solution, it would provide a counterexample to the Bombieri–Lang[4][5] conjecture and to the abc conjecture.[6] It would also solve Harborth's conjecture, on the existence of drawings of planar graphs in which all distances are integers. If a dense rational-distance set exists, any straight-line drawing of a planar graph could be perturbed by a small amount (without introducing crossings) to use points from this set as its vertices, and then scaled to make the distances integers. However, like the Erdős–Ulam problem, Harborth's conjecture remains unproven.