Point sets avoiding near-integer distances
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914540056215552 |
|---|---|
| author | Goenka, Ritesh Moore, Kenneth |
| author_facet | Goenka, Ritesh Moore, Kenneth |
| contents | Let $d \in \mathbb{N}$, $δ\in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, δ)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least $δ$ away from any integer. In the planar case, Sárközy proved that for every $\varepsilon > 0$, $N_2(X, δ) = Ω_δ(X^{1/2-\varepsilon})$ as $X \rightarrow \infty$ whenever $δ$ is sufficiently small in terms of $\varepsilon$, while Konyagin proved the almost matching upper bound $N_2(X,δ) = O_δ(X^{1/2})$.
We study this problem in higher dimensions, addressing a question of Erdős and Sárközy. Extending Sárközy's construction, we show that for every $\varepsilon > 0$, $N_3(X, δ) = Ω_δ(X^{1-\varepsilon})$ for $δ$ sufficiently small in terms of $\varepsilon$. We also provide a lifting lemma from integer distance sets to sets avoiding near-integer distances via bilipschitz embeddings of snowflaked Euclidean spaces. This allows us to prove a linear lower bound $N_4(X,δ) = Ω_δ(X)$ for all sufficiently small $δ$. Finally, adapting Konyagin's approach, we prove the upper bound $N_d(X, δ) = O_{d, δ}(X^{d/2})$ for all $d \in \mathbb{N}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_06621 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Point sets avoiding near-integer distances Goenka, Ritesh Moore, Kenneth Combinatorics Metric Geometry 52C10 (Primary) 51K05, 51F30, 42A05, 42B10 (Secondary) Let $d \in \mathbb{N}$, $δ\in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, δ)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least $δ$ away from any integer. In the planar case, Sárközy proved that for every $\varepsilon > 0$, $N_2(X, δ) = Ω_δ(X^{1/2-\varepsilon})$ as $X \rightarrow \infty$ whenever $δ$ is sufficiently small in terms of $\varepsilon$, while Konyagin proved the almost matching upper bound $N_2(X,δ) = O_δ(X^{1/2})$. We study this problem in higher dimensions, addressing a question of Erdős and Sárközy. Extending Sárközy's construction, we show that for every $\varepsilon > 0$, $N_3(X, δ) = Ω_δ(X^{1-\varepsilon})$ for $δ$ sufficiently small in terms of $\varepsilon$. We also provide a lifting lemma from integer distance sets to sets avoiding near-integer distances via bilipschitz embeddings of snowflaked Euclidean spaces. This allows us to prove a linear lower bound $N_4(X,δ) = Ω_δ(X)$ for all sufficiently small $δ$. Finally, adapting Konyagin's approach, we prove the upper bound $N_d(X, δ) = O_{d, δ}(X^{d/2})$ for all $d \in \mathbb{N}$. |
| title | Point sets avoiding near-integer distances |
| topic | Combinatorics Metric Geometry 52C10 (Primary) 51K05, 51F30, 42A05, 42B10 (Secondary) |
| url | https://arxiv.org/abs/2605.06621 |