# Grokability in five inequalities

arXiv: https://arxiv.org/abs/2605.05193 · HTML: https://mlsanity.com/paper/2605.05193/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 8 of its 40 references that are in the map.
- First posted on arXiv 6 May 2026.

## Builds on (most cited first, 8 of 8)

- [Learning to Discover at Test Time](https://mlsanity.com/paper/2601.16175/) (2026)
- [Mathematical exploration and discovery at scale](https://mlsanity.com/paper/2511.02864/) (2025)
- [ThetaEvolve: Test-time Learning on Open Problems](https://mlsanity.com/paper/2511.23473/) (2025)
- [Early science acceleration experiments with GPT-5](https://mlsanity.com/paper/2511.16072/) (2025)
- [Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the ErdHos Problems](https://mlsanity.com/paper/2601.22401/) (2026)
- [Accelerating Scientific Research with Gemini: Case Studies and Common Techniques](https://mlsanity.com/paper/2602.03837/) (2026)
- [Automated Conjecture Resolution with Formal Verification](https://mlsanity.com/paper/2604.03789/) (2026)
- [Testing for high-dimensional geometry in random graphs](https://mlsanity.com/paper/1411.5713/) (2014)

## 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.