Expired50% confidenceFactExact time
Princeton mathematics professor Will Sawin improved upon the AI's result, proving that Delta=0.014 can be achieved, advancing the improvement from sub-polynomial to polynomial.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026(expired)
Sources
Related Claims
UnverifiedPrinceton mathematics professor Will Sawin subsequently refined the AI's result, proving that one can take delta = 0.014.84% similarUnverifiedAI在解决困扰学界60年的埃尔多斯1196号本原集猜想时，引入了原本用于素数研究的冯·曼戈尔特函数55% similarUnverified对于单调次模函数最大化问题，简单贪心算法可获得 (1−1/e)≈0.632 的最优多项式时间近似比，该结果由Nemhauser等人于1978年证明54% similarUnverified在纽结理论中，AI发现了双曲体积与代数不变量之间此前未知的函数关系54% similarUnverifiedNguyen and Stehlé proved that as long as the floating-point precision satisfies a dimension-dependent lower bound (approximately O(n) bits of floating-point mantissa precision), the correctness of each step of the LLL algorithm is guaranteed.53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/51612API
curl https://kongchang.com/api/v1/knowledge/claims/51612MCP
get_claim(id=51612)