English

A Congruence Condition For The Four-Distance Problem

Number Theory 2020-06-09 v3

Abstract

Place the vertices of a rectangle at {(0,±1/2),(a,±1/2)}\{(0, \pm 1/2), (a, \pm 1/2)\}, where aa is rational. We show that if v3(a)=0v_3(a) = 0, then any point (x,y)(x,y) that is rational distance from all four vertices of the rectangle has either v3(x)<0v_3(x) < 0 or v3(y)<0v_3(y)<0, where v3()v_3(\cdot) is the 3-adic valuation. The case of particular interest is the long-open four-distance problem, which asks whether such a rational distance point exists in the case a=1a=1 of the unit square. For the four-distance problem, our result rules out one-fourth of all potential solutions with bounded height.

Keywords

Cite

@article{arxiv.1904.12097,
  title  = {A Congruence Condition For The Four-Distance Problem},
  author = {William McCloskey},
  journal= {arXiv preprint arXiv:1904.12097},
  year   = {2020}
}

Comments

12 pages

R2 v1 2026-06-23T08:51:03.434Z