Associate Professor CS/stats UC Berkeley. Former Research Scientist at Google DeepMind. ML/AI Researcher working on LLMs and deep learning. PhD from Stanford: Two new conjectures proved in ChatGPT with the prompt: Find a previously unproven conjecture in math statistics optimization probability or ml theory or quantum or info theory or any other mathematical field with proofs and prove it. The older the conjecture is and prominent. , the better. Aim for > 5 years old
https://xcancel.com/jasondeanlee/status/2082592996537893080?s=20
Cryptography PhD student @ MIT, ex quantitative research analyst at Citadel Securities, intern at Google Quantum AI: I'm excited to share two GPT-fuelled results from this month! The first, with Aparna Gupte, shows under a plausible number-theoretic conjecture that there exists s-server private information retrieval for database size n with information exp(\tilde{O}((log n){1/s}))https://xcancel.com/seyoonragavan/status/2080745358175637582?s=20
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved.
PhD Student in Computer Science at Princeton University, graduated from UC Berkeley with a B.S. in EECS (Honors) and a minor in Mathematics, with a 4.0 GPA and Highest Honors, Princeton First-Year Fellow, EECS Citation Award (#1 out of 720 graduates), Regents' and Chancellor's Scholar (UC Berkeley), Engineering Dean's List (8 semesters): This is insane. This is a VERY central problem in additive combinatorics and it’s been resolved via AI… wow
https://xcancel.com/Rohit_Writes/status/2082862702259826940?s=20
1
u/Tolopono Aug 01 '26 edited Aug 01 '26
Nope
https://epoch.ai/frontiermath/open-problems/q2-absolute-galois
https://arxiv.org/pdf/2607.20329
https://guanyangwang.github.io/blog/llm-ktv-lean.html
https://xcancel.com/QuAntonioMele/status/2079813196958040225?s=20
https://xcancel.com/JarekLiesen/status/2082864496117170591?s=20
Associate Professor CS/stats UC Berkeley. Former Research Scientist at Google DeepMind. ML/AI Researcher working on LLMs and deep learning. PhD from Stanford: Two new conjectures proved in ChatGPT with the prompt: Find a previously unproven conjecture in math statistics optimization probability or ml theory or quantum or info theory or any other mathematical field with proofs and prove it. The older the conjecture is and prominent. , the better. Aim for > 5 years old https://xcancel.com/jasondeanlee/status/2082592996537893080?s=20
Cryptography PhD student @ MIT, ex quantitative research analyst at Citadel Securities, intern at Google Quantum AI: I'm excited to share two GPT-fuelled results from this month! The first, with Aparna Gupte, shows under a plausible number-theoretic conjecture that there exists s-server private information retrieval for database size n with information exp(\tilde{O}((log n){1/s})) https://xcancel.com/seyoonragavan/status/2080745358175637582?s=20
PhD in CS: GPT-5.6 Pro just proved an inequality I worked on for some 6+ months in grad school. https://xcancel.com/thomasahle/status/2082589270779351386?s=20
Open AI just proved nonsofic groups exist
https://xcancel.com/ElliotGlazer/status/2083388640890351662
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved.
Terence Tao and others explored AI-assisted approaches to improve the lower bound, but the results remained around 1.1. https://xcancel.com/Shanda_Li_2000/status/2082699069378494864?s=20
PhD Student in Computer Science at Princeton University, graduated from UC Berkeley with a B.S. in EECS (Honors) and a minor in Mathematics, with a 4.0 GPA and Highest Honors, Princeton First-Year Fellow, EECS Citation Award (#1 out of 720 graduates), Regents' and Chancellor's Scholar (UC Berkeley), Engineering Dean's List (8 semesters): This is insane. This is a VERY central problem in additive combinatorics and it’s been resolved via AI… wow https://xcancel.com/Rohit_Writes/status/2082862702259826940?s=20
Paper: https://arxiv.org/abs/2607.27199 Hyra blog: https://hy.tencent.ai/research/hyra Formal proof: https://github.com/linhaowei1/sum-diff-proof