Feed Entities Podcasts Deep Dives Developers About

[KongchangAI]

Real-time AI knowledge base. Every claim is traceable to its source, with data freshness under 24 hours.

Powered by 240+ first-hand AI sources

Knowledge

Feed
Hot Entities
Podcasts

Developers

CLI
MCP Server
REST API
About

© 2026 KongchangAI. The freshest, most accurate AI knowledge

Unverified50% confidenceFactExact time

2010年Larry Guth和Nets Katz利用多项式方法解决了Erdős距离问题，证明n个点至少确定Ω(n/log n)个不同距离

1

Sources

50%

Confidence

Long-term

Relevance

8/8/2026

First Seen

Sources

西尔维斯特-加莱定理：为什么有限点集必存在普通直线

Related Claims

UnverifiedGuth和Katz在2015年解决Erdős不同距离问题时综合运用了代数几何与多项式方法78% similar Unverified该发现涉及的问题核心在于原始矩M_n与泰勒/Jensen系数之间的阶乘归一化处理偏差59% similar UnverifiedIn 1984, Spencer, Szemerédi, and Trotter proved the upper bound U(N) ≤ O(N^(4/3)) for the unit distance problem.59% similar Unverified陶哲轩与本·格林合作证明了'素数中存在任意长的等差数列'的格林-陶定理58% similar Unverified单位距离问题由匈牙利数学家Paul Erdős于1946年提出，属于组合几何领域57% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/705813

API

curl https://kongchang.com/api/v1/knowledge/claims/705813

MCP

get_claim(id=705813)