Falconer's conjecture
In geometric measure theory, Falconer's conjecture, named after Kenneth Falconer, is an unsolved problem concerning the sets of Euclidean distances between points in compact -dimensional spaces. Intuitively, it states that a set of points that is large in its Hausdorff dimension must determine a set of distances that is large in measure. More precisely, if is a compact set of points in -dimensional Euclidean space whose Hausdorff dimension is strictly greater than , then the conjecture states that the set of distances between pairs of points in must have nonzero Lebesgue measure.[1]
Formulation and motivation
[edit]Falconer (1985) proved that Borel sets with Hausdorff dimension greater than have distance sets with nonzero measure.[2] He motivated this result as a multidimensional generalization of the Steinhaus theorem, a previous result of Hugo Steinhaus proving that every set of real numbers with nonzero measure must have a difference set that contains an interval of the form for some .[3] It may also be seen as a continuous analogue of the Erdős distinct distances problem, which states that large finite sets of points must have large numbers of distinct distances.[4]
Partial results
[edit]Erdoğan (2005) proved that compact sets of points whose Hausdorff dimension is greater than have distance sets with nonzero measure; for large values of this approximates the threshold on Hausdorff dimension given by the Falconer conjecture.[5] For points in the Euclidean plane, Borel sets of Hausdorff dimension greater than 5/4 (or with ) have distance sets with nonzero measure and, more strongly, they have a point such that the Lebesgue measure of the distances from the set to this point is positive.[6] For the best known bound is according to a preprint by Du, Ou, Ren and Zhang[7][8]
A variant of Falconer's conjecture states that, for points in the plane, a compact set whose Hausdorff dimension is greater than or equal to one must have a distance set of Hausdorff dimension one. This follows from the results on measure for sets of Hausdorff dimension greater than 5/4. For a compact planar set with Hausdorff dimension at least one, the distance set must have Hausdorff dimension at least 1/2.[9]
Related conjectures
[edit]Proving a bound strictly greater than 1/2 for the dimension of the distance set in the case of compact planar sets with Hausdorff dimension at least one would be equivalent to resolving several other unsolved conjectures. These include a conjecture of Paul Erdős on the existence of Borel subrings of the real numbers with fractional Hausdorff dimension, and a variant of the Kakeya set problem on the Hausdorff dimension of sets such that, for every possible direction, there is a line segment whose intersection with the set has high Hausdorff dimension.[10] These conjectures were solved by Bourgain.
Other distance functions
[edit]For non-Euclidean distance functions in the plane defined by polygonal norms, the analogue of the Falconer conjecture is false: there exist sets of Hausdorff dimension two whose distance sets have measure zero.[11][12]
References
[edit]- ^ Iosevich, Alex (2019), "What is ... Falconer's conjecture?" (PDF), Notices of the American Mathematical Society, 66 (4): 552–555, doi:10.1090/noti1843, MR 3889529
- ^ Falconer, K. J. (1985), "On the Hausdorff dimensions of distance sets", Mathematika, 32 (2): 206–212 (1986), doi:10.1112/S0025579300010998, MR 0834490. See in particular the remarks following Corollary 2.3. Although this paper is widely cited as its origin, the Falconer conjecture itself does not appear in it.
- ^ Steinhaus, Hugo (1920), "Sur les distances des points dans les ensembles de mesure positive" (PDF), Fundamenta Mathematicae (in French), 1 (1): 93–104, doi:10.4064/fm-1-1-93-104.
- ^ Arutyunyants, G.; Iosevich, A. (2004), "Falconer conjecture, spherical averages and discrete analogs", in Pach, János (ed.), Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol. 342, Providence, Rhode Island: American Mathematical Society, pp. 15–24, doi:10.1090/conm/342/06127, ISBN 978-0-8218-3484-8, MR 2065249
- ^ Erdoğan, M. Burak (2005), "A bilinear Fourier extension theorem and applications to the distance set problem", International Mathematics Research Notices, 2005 (23): 1411–1425, CiteSeerX 10.1.1.121.7673, doi:10.1155/IMRN.2005.1411
{{citation}}
: CS1 maint: unflagged free DOI (link). - ^ Guth, Larry; Iosevich, Alex; Ou, Yumeng; Wang, Hong (2020), "On Falconer's distance set problem in the plane", Inventiones Mathematicae, 219 (3): 779–830, arXiv:1808.09346, Bibcode:2020InMat.219..779G, doi:10.1007/s00222-019-00917-x, MR 4055179
- ^ Du, Xiumin; Ou, Yumeng; Ren, Kevin; Zhang, Ruixiang (2023). "New improvement to Falconer distance set problem in higher dimensions". arXiv:2309.04103 [math.CA].
- ^ Sloman, Leila (2024-04-09). "Number of Distances Separating Points Has a New Bound". Quanta Magazine. Retrieved 2024-04-10.
- ^ Mattila, Pertti (1987), "Spherical averages of Fourier transforms of measures with finite energy; dimension of intersections and distance sets", Mathematika, 34 (2): 207–228, doi:10.1112/S0025579300013462, MR 0933500.
- ^ Katz, Nets Hawk; Tao, Terence (2001), "Some connections between Falconer's distance set conjecture and sets of Furstenburg type", New York Journal of Mathematics, 7: 149–187, arXiv:math/0101195, Bibcode:2001math......1195H, MR 1856956.
- ^ Falconer, K. J. (May 2004), "Dimensions of intersections and distance sets for polyhedral norms", Real Analysis Exchange, 30 (2): 719–726, doi:10.14321/realanalexch.30.2.0719, JSTOR 10.14321/realanalexch.30.2.0719, MR 2177429.
- ^ Konyagin, Sergei; Łaba, Izabella (2006), "Distance sets of well-distributed planar sets for polygonal norms", Israel Journal of Mathematics, 152 (1): 157–179, arXiv:math/0405017, doi:10.1007/BF02771981, MR 2214458.