Expired50% confidenceFactExact time
In 1984, Spencer, Szemerédi, and Trotter proved the upper bound U(N) ≤ O(N^(4/3)) for the unit distance problem.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026(expired)
Sources
OpenAI Cracks Erdős Unit Distance Conjecture: AI Independently Disproves 80-Year-Old Math Problem for the First Time
bilibiliAI技术投降派6/6/2026
Related Claims
UnverifiedIn 1984, Spencer, Szemerédi, and Trotter proved the upper bound result U(N) ≤ O(N^(4/3)), meaning the number of unit-distance pairs among N points does not exceed a constant multiple of N to the power of 4/3.85% similarUnverified2010年Larry Guth和Nets Katz利用多项式方法解决了Erdős距离问题，证明n个点至少确定Ω(n/log n)个不同距离59% similarUnverifiedFrostman引理（1935年）断言：如果紧集的s维Hausdorff测度为正，则该集合上存在非零正则Borel测度μ满足μ(B(x,r)) ≤ C·r^s56% similarUnverifiedTerence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.56% similarUnverifiedDriscoll-Healy采样定理(1994)指出，对于带宽为B的球面函数，只需在球面上等间距采样2B×2B=4B²个点即可精确重构所有球谐系数56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/50582API
curl https://kongchang.com/api/v1/knowledge/claims/50582MCP
get_claim(id=50582)