Falconer distance problem in ℝ^2
The Falconer distance problem threshold C_34 = s_Δ(ℝ^2) in the plane is defined as s_Δ(ℝ^2) : :=\ infBigl s∈[0,2] : ∀ compact E⊂ℝ^2,\ dim_H(E)>s Longrightarrow lvertΔ(E)rvert>0 Bigr.
From the catalogue. Imported from Terence Tao and contributors (optimizationproblems repository) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.
Cite
@misc{cairn-constant-34a-falconer-distance-problem-in-r-2,
title = {Falconer distance problem in ℝ^2},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/constant-34a-falconer-distance-problem-in-r-2}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
} Also: CITATION.cff · Atom feed of results
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
Description of constant
The Falconer distance problem threshold in the plane is defined as where for a compact set , the distance set is <a href="#GIOW2018-def-distance-set">[GIOW2018-def-distance-set]</a>, denotes Hausdorff dimension, and denotes the 1-dimensional Lebesgue measure of .
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| [[Fal1986](#Fal1986)] | Falconer proved (in particular in ) that if then . <a href="#GIOW2018-falconer-3-2">[GIOW2018-falconer-3-2]</a> | |
| [[Wol1999](#Wol1999)] | Wolff improved the planar threshold to . <a href="#GIOW2018-wolff-4-3">[GIOW2018-wolff-4-3]</a> | |
| [[GIOW2018](#GIOW2018)] | Guth–Iosevich–Ou–Wang proved that if then . <a href="#GIOW2018-thm-5-4">[GIOW2018-thm-5-4]</a> |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| Trivial | Since always, the infimum defining is . | |
| [[Fal1986](#Fal1986)] | Falconer gave examples showing (in general dimension ) that one cannot expect below the threshold ; in this yields . [<a href="#GIOW2018-lb-d-2">[GIOW2018-lb-d-2]</a>] |
Additional comments and links
- The Falconer distance conjecture in the plane predicts that the lower bound of is sharp. <a href="#GIOW2018-conj-plane">[GIOW2018-conj-plane]</a> <a href="#GIOW2018-thm-5-4">[GIOW2018-thm-5-4]</a> <a href="#GIOW2018-lb-d-2">[GIOW2018-lb-d-2]</a>
References
- <a id="GIOW2018"></a>[GIOW2018] Guth, Larry; Iosevich, Alex; Ou, Yumeng; Wang, Hong. On Falconer’s distance set problem in the plane. Inventiones mathematicae 219 (3) (2020), 779–830. DOI: 10.1007/s00222-019-00922-7. Google Scholar. arXiv PDF
- <a id="GIOW2018-def-distance-set"></a>[GIOW2018-def-distance-set] loc: arXiv v1 PDF p.1, Introduction. quote: “For a set , define the distance set .”
- <a id="GIOW2018-conj-plane"></a>[GIOW2018-conj-plane] loc: arXiv v1 PDF p.1, Introduction. quote: “This led him to conjecture that if , then the Lebesgue measure of the distance set is positive. This is known as the Falconer Distance Conjecture.”
- <a id="GIOW2018-falconer-3-2"></a>[GIOW2018-falconer-3-2] loc: arXiv v1 PDF p.1, Introduction. quote: “He proved that if , then .”
- <a id="GIOW2018-wolff-4-3"></a>[GIOW2018-wolff-4-3] loc: arXiv v1 PDF p.1, Introduction. quote: “In [37], Wolff proved that if is a compact set with Hausdorff dimension greater than , then has positive Lebesgue measure.”
- <a id="GIOW2018-thm-5-4"></a>[GIOW2018-thm-5-4] loc: arXiv v1 PDF p.1, Introduction. quote: “Theorem 1.1. If is a compact set with Hausdorff dimension greater than , then has positive Lebesgue measure.”
- <a id="GIOW2018-lb-d-2"></a>[GIOW2018-lb-d-2] loc: arXiv v1 PDF p.1, Introduction. quote: “Using an example based on the integer lattice, he showed for every there exist sets of Hausdorff dimension for which .”
- <a id="Fal1986"></a>[Fal1986] Falconer, K. J. On the Hausdorff dimensions of distance sets. Mathematika 32 (1985), no. 2, 206–212. DOI: 10.1112/S0025579300010998. Google Scholar.
- <a id="Wol1999"></a>[Wol1999] Wolff, Thomas. Decay of circular means of Fourier transforms of measures. International Mathematics Research Notices 1999 (10), 547–567. DOI: 10.1155/S1073792899000288. Google Scholar.
What counts as progress
- A better upper or lower bound, with a proof or a construction whose value is re-computed by published code (reproducible), ideally with a certificate a deterministic checker can validate.
- A formal proof (Lean) of a known bound, or a precise error in a claimed one.
- New references for the tables above (literature claims).
Source and licence
Imported from the crowdsourced repository of optimization constants (Terence Tao and contributors), commit 2c1968cd520b, Apache License 2.0; reformatted for this page. New records should also be reported there.