theoretical computer science

@letonyo

2026-09-18 — reply from @FJSchreiber — saved image

Anthony Leverrier @letonyo

Is this happening a lot:
you interact with chatGPT to solve an interesting (TCS/math) question; after 50 prompts, you get some midly interesting result (that would have been a good paper not long ago) and a 50-page page written by the AI.
But then, you're too tired (1/2)

7:51 AM · Sep 18, 2026 · 13.5K Views

7 replies · 13 reposts · 92 likes · 25 bookmarks

Relevant · View quotes

Anthony Leverrier @letonyo · 2h
to check it all, and to rewrite it in a clear way. So you just let it there on your computer.

This has happened to me quite a bit, and i guess I'm not the only one.

7 replies · 4 reposts · 64 likes · 3K views

Franz Schreiber @FJSchreiber · 10m
I gues like with all the shiny gadgets of modern society, it requires discipline. (That being said, I can relate)

1 reply · 2 likes · 245 views

Anthony Leverrier @letonyo · 7m
it's just that the effort for having the finished product you can put on the arxiv is vastly larger than the one to get the result together with a full AI-generated paper.
And the current incentives for publishing new results are not that high anymore, unless it's a breakthrough [cut off]

ai for mathresearch workflowarxivpublishing incentiveschatgpttheoretical computer science

@Aaroth

2026-09-16 — quoting his own earlier post — saved image

Aaron Roth @Aaroth · 23h

A world without open problems
Here are some that fell today:
K-server: arxiv.org/abs/2609.15979
Matroid Secretary: arxiv.org/abs/2609.14555...
Matrix Spencer: arxiv.org/abs/2609.15025
(Well Matrix Spencer was maybe also a few weeks ago, but who's counting? arxiv.org/abs/2608.28816
)

[Quoted post]
Aaron Roth @Aaroth · Aug 1
We are clearly moving to a world that will be without open problems, but this doesn't mean math is going away. Interesting work will correspond to discovering new questions and coherent theoretical frameworks. Well defined ... [cut off]

mathopen problemsarxivtheoretical computer science

will depue @willdepue

2026-08-01 — saved image

Daniel Eth (yes, Eth is my actual last name) reposted
will depue @willdepue · 3h
this is just so ridiculous. how long until a model can solve multiple major open problems in deep learning? what will happen then? seems inevitable in the next year or two

[quoted tweet]
Noam Brown @polynoamial · 10h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.
…

[embedded document image, numbered list]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n²log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^(1/400)-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

ai modelsmathematicstwitteropenaiastratheoretical computer science

Noam Brown @polynoamial

2026-08-01 — saved image

Noam Brown @polynoamial · 10h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.

We believe it will be a major step for scientific reasoning. openai.com/index/ten-adva...

[embedded image, numbered list]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n²log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^(1/400)-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

Lijie Chen @wjmzbmr1 · 10h
10 proofs from our next major model Astra on long-standing open problems in mathematics and theoretical computer science (also including new circuit lower bounds for computing the permanent!)...

openaiastramathematicsai researchtheoretical computer sciencequantum complexity