A multi-parameter variant of the Erd\H{o}s distance problem
Alex Iosevich, Maria Janczak, Jonathan Passant

TL;DR
This paper investigates a multi-parameter variant of the Erdős distance problem, establishing new bounds and optimal results for the size of certain distance sets in high-dimensional Euclidean spaces.
Contribution
It introduces a generalized framework for the Erdős distance problem with multiple parameters and derives optimal bounds for various partitions and conditions, extending previous results.
Findings
Proves near-optimal bounds for two-dimensional partitions.
Establishes bounds for $B_{k,l}$ under $s$-adaptability conditions.
Provides explicit bounds for the case $k=l$ using known exponents.
Abstract
We study the following variant of the Erd\H{o}s distance problem. Given and a point sets in and with is an increasing partition of define where with in . For it is not difficult to construct and such that . On the other hand, it is easy to see that if is the best know exponent for the distance problem in that . The question we study is whether we can improve the exponent . We first study partitions of length two in detail and prove the optimal result (up to logarithms) that In the generalised two dimensional case for we need…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Approximation and Integration
