{
  "annotation_id": "fb3199f4-3ca4-4ac4-80c8-0ccb1d7eb047",
  "date_created": "2026-02-17T05:53:19.842000Z",
  "date_modified": "2026-02-17T05:53:19.842000Z",
  "file_hash": "eea3661133a43fbc7609e35b89c808c0e797c37ce91138c0af9a14aea64485da",
  "private": false,
  "record": {
    "abstract": "In 1997, Erd\\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\\mathbb{R}^2$ that determines $O(\\frac{n}{\\sqrt{\\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset determines at least 3 distinct pairwise distances. We construct $n$-point sets from an $m\\times m$ box of the lattice $L = \\{(x,\\sqrt{2}y):x,y \\in \\mathbb{Z}\\} \\subset \\mathbb{R}^2.$ The distinct distance bound follows from applying Bernays\u0027 theorem to the number of integers represented by the binary quadratic form $u^2 + 2v^2$. The local 4-point constraint is verified through Perucca\u0027s similarity classification of the six similarity types determining exactly two distances.",
    "arxiv_id": "2601.09102",
    "authors": [
      "Benjamin Grayzel"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Solution to a Problem of Erd\\H{o}s Concerning Distances and Points",
    "url": "https://arxiv.org/abs/2601.09102",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "72a59f06-eeaf-4e76-8125-c91acfd396f9",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}