{"paper":{"title":"On the probability of n equidistant points in high-dimensional lattices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Martin Minchev, Mladen Savov, Stefan Gerdjikov","submitted_at":"2025-02-05T18:35:46Z","abstract_excerpt":"Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \\[ C_n\\cdot\\frac{1}{d^{(m-1)/2}} \\quad \\text{for} \\quad d \\to \\infty \\quad \\text{and} \\quad m = \\binom{n}{2}, \\] with an explicit constant in terms of the first 4 moments of $X$. Moreover, we generalise this result to encompass all finitely supported $X$, as well as under different distances. Our method relies on the relatively rarely used multidimensional local limit theorem and an analysis of the lattice on $\\mathbb{Z}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03440","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/2502.03440/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"}