Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Raghu Meka

Raghu Meka

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

AI×1Complexity×1HCI×1Functional Analysis×1Algorithms×1Combinatorics×1

Frequent co-authors

Alan Li1×
Rahul Saha1×
Anton Xue1×
Swarat Chaudhuri1×
Adam Klivans1×
Pravesh K Kothari1×

Research Timeline

2026
Optimal Sparsifiers for Abelian Cayley Graphs

This paper proves that for any finite abelian group, there exists a spectral sparsifier for its Cayley graph with log(|G|) generators. This result improves upon previous work for constructing code sparsifiers for F2-linear codes.

Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration

AI was used to improve bounds on the Grothendieck constant $K_G$ in mathematics research, leading to novel insights.

Highlighted terms show continued research focus across papers

Papers

cs.AIcs.CCcs.HCEmpiricalRecentAug 11, 2026

Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration

Alan Li, Rahul Saha, Anton Xue, Swarat Chaudhuri +3 more

AI was used to improve bounds on the Grothendieck constant $K_G$ in mathematics research, leading to novel insights.

View →
cs.DSmath.COTheoretical
Recent
Jul 9, 2026

Optimal Sparsifiers for Abelian Cayley Graphs

Arpon Basu, Pravesh K. Kothari, Raghu Meka, Stefan Tudose

This paper proves that for any finite abelian group, there exists a spectral sparsifier for its Cayley graph with log(|G|) generators. This result improves upon previous work for constructing code spa…

View →