Terry Tao's Crowdsourced Optimization Constants Repo Already Includes Komlós Conjecture as C_24
IgorCarron · x · 2026-09-21
Igor Carron quotes a thread on the Komlós conjecture—a min–max problem predicting a uniform bound C(n,d)<100, where the "100" is irrelevant; any finite constant independent of n and d would solve it. The poster intended to add the problem to Terry Tao's Optimization Problems repository but found it already there as constant C24.
The repo (teorth/optimizationproblems), introduced by Terence Tao in January 2026, is a crowdsourced collection of optimization constants in mathematics, recording best known upper and lower bounds for constants arising from variational problems and functional inequalities. It now has 371 stars, 92 forks, and 782 commits, with community contributions encouraged.
More from Research
- Xiaomi's CodeMidas turns source code into RL environments: 5,545 tasks, 23 languages — teortaxesTex · 2026-09-21
- Delip Rao responds to COLM paper code similarity claim: repo and tech reports public since Feb — deliprao · 2026-09-21
- Safety follows understanding: Nina Miolane calls for predictive laws of intelligence — ninamiolane · 2026-09-21
- Nina Miolane argues AI safety needs 'engineering laws': predictive math for intelligence — ninamiolane · 2026-09-21
- UC Berkeley launches Science of Intelligence Institute; Nina Miolane to give inaugural lecture Oct 7 — ninamiolane · 2026-09-21
- Tim Dettmers' lab announces open-source week: 2 frameworks, 4 papers for frontier AI on local hardware — Tim_Dettmers · 2026-09-21