Verified65% confidenceFactTime unknown
The Erdős Unit Distance Problem asks how many pairs of points among n points placed in the plane can have a distance of exactly 1.
3
Sources
65%
Confidence
Long-term
Relevance
6/1/2026
First Seen
Sources
Related Entities
Related Claims
Unverified平面单位距离问题与Erdős-Szemerédi猜想、Erdős距离问题并列为组合几何三大经典难题79% similarUnverifiedVoronoi图将平面划分为若干区域，每个区域内所有点到对应生成点的距离都小于到其他生成点的距离，其顶点可作为难抵极点的候选集合61% similarUnverifiedFor vectors A=(1,1) and B=(2,2), the cosine similarity is 1 and the Euclidean distance is approximately 1.41; the cosine similarity between A and C=(1,0) is approximately 0.707 and the Euclidean distance is 1.59% similarUnverifiedThe Johnson-Lindenstrauss lemma guarantees that for any ε∈(0,1), as long as the target dimension k≥O(log(n)/ε²), there exists a mapping from high dimensions to k dimensions that preserves all pairwise distances within a factor of (1±ε).58% similarUnverifiedThe Haversine formula can accurately calculate the great-circle distance between any two points on a sphere.57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/17787API
curl https://kongchang.com/api/v1/knowledge/claims/17787MCP
get_claim(id=17787)