Explorerβ€ΊArtificial Intelligenceβ€ΊAI
Research PaperResearchia:202605.07002

Grokability in five inequalities

Paata Ivanisvili

Abstract

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 $\mathbb{R}^n$, sharper $L_2$-$L_1$ moment comparison inequalities on the Hamming cube $\{-1,1\}^n$, a strengthened autoconvolution inequality, improved asymptotic bounds on the size of the largest $g$-Sidon sets in $\{1,\dots,n\}$, and an optimal balanced Szare...

Submitted: May 7, 2026Subjects: AI; Artificial Intelligence

Description / Details

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 Rn\mathbb{R}^n, sharper L2L_2-L1L_1 moment comparison inequalities on the Hamming cube {βˆ’1,1}n\{-1,1\}^n, a strengthened autoconvolution inequality, improved asymptotic bounds on the size of the largest gg-Sidon sets in {1,…,n}\{1,\dots,n\}, and an optimal balanced Szarek's inequality.


Source: arXiv:2605.05193v1 - http://arxiv.org/abs/2605.05193v1 PDF: https://arxiv.org/pdf/2605.05193v1 Original Link: http://arxiv.org/abs/2605.05193v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
May 7, 2026
Topic:
Artificial Intelligence
Area:
AI
Comments:
0
Bookmark