Grokability in five inequalities
Not on the map. Why?
Abstract (arXiv)
In this note, we report five mathematical discoveries made in collaboration with Grok, all of which have been subsequently verified by the authors. These include an improved lower bound on the maximal Gaussian perimeter of convex sets in ℝn, sharper L2-L1 moment comparison inequalities on the Hamming cube -1,1n, a strengthened autoconvolution inequality, improved asymptotic bounds on the size of the largest g-Sidon sets in 1,dots,n, and an optimal balanced Szarek's inequality.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 40 references that are in the map. First posted on arXiv 6 May 2026.
Builds on
8 of 40 references.
References · 8
- 2026Learning to Discover at Test Timecited by 94
- 2025Mathematical exploration and discovery at scalecited by 66
- 2025ThetaEvolve: Test-time Learning on Open Problemscited by 52
- 2025Early science acceleration experiments with GPT-5cited by 35
- 2014Testing for high-dimensional geometry in random graphscited by 25
- 2026Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the ErdHos Problemscited by 24
- 2026Accelerating Scientific Research with Gemini: Case Studies and Common Techniquescited by 24
- 2026Automated Conjecture Resolution with Formal Verificationcited by 21
Built on by
Not cited yet.