{"paper":{"title":"Geometric Sidon Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Christian Clemen, Jakob F\\\"uhrer, Oliver Roche-Newton","submitted_at":"2026-06-04T08:16:57Z","abstract_excerpt":"This paper considers geometric problems of the following type: given a point set $P \\subset \\mathbb R^2$, one seeks a large subset avoiding a prescribed geometric configuration. Our main result states that, for any $P \\subset \\mathbb R^2$, there exists a subset $P' \\subset P$ with $|P'| \\gg |P|^{1/3}$ such that all of the distances determined by $P'$ are distinct. This improves a result of Charalambides. We make heavy use of a result of Li and Postle concerning the independence number of hypergraphs which satisfy some edge distribution conditions, as well as tools from incidence geometry."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05841","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.05841/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}