On the distance sets of AD-regular sets
arXiv:1509.06675 · doi:10.1016/j.aim.2016.11.035
Abstract
I prove that if is a compact -Ahlfors-David regular set with , then where is the distance set of , and stands for packing dimension. The same proof strategy applies to other problems of similar nature. For instance, one can show that if is a compact -Ahlfors-David regular set with , then there exists a point such that . Specialising to product sets, one derives the following sum-product corollary: if is a non-empty compact -Ahlfors-David regular set with , then for some . In particular, . In all of the results mentioned above, compactness can be relaxed to boundedness and -measurability, if packing dimension is replaced by upper box dimension.
12 pages. v3: The proof of the claimed "further results" in v2 contained a gap. The statements of these results have been downgraded accordingly
References in corpus (2)
Cited by in corpus (13)
- New bounds on the dimensions of planar distance sets
- On Falconer's distance set problem in the plane
- An -identity and pinned distance problem
- On the Hausdorff dimension of pinned distance sets
- Rigidity, graphs and Hausdorff dimension
- Pinned distance problem, slicing measures and local smoothing estimates
- An elementary approach to simplexes in thin subsets of Euclidean space
- On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem
- Embedding distance graphs in finite field vector spaces
- An improved dimensional threshold for the angle problem
- Incidence estimates for well spaced tubes
- Distance sets, orthogonal projections, and passing to weak tangents
- On the Number of Dot Products Determined by a Large Set and One of its Translates in Finite Fields