K-distance sets, Falconer conjecture, and discrete analogs
Classical Analysis and ODEs
2007-05-23 v1
Abstract
We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a diophantine mechanism to convert continuous results into distance set estimates for discrete point sets.
Cite
@article{arxiv.math/0303227,
title = {K-distance sets, Falconer conjecture, and discrete analogs},
author = {A. Iosevich and I. Laba},
journal= {arXiv preprint arXiv:math/0303227},
year = {2007}
}
Comments
10 pages