Ryan Alweiss
I am a Junior Research Fellow and NSF postdoc at Trinity College Cambridge broadly interested in combinatorics and theoretical computer science. My mentor is Timothy Gowers.
Before that (2018-2023), I was a PhD student at Princeton University, advised by Noga Alon.
Before that (2015-2018), I was an undergraduate at MIT, where I graduated with a BS in mathematics.
Publications and Preprints
Hindman's Conjecture over the Rationals, preprint.
Improved Lower Bound for Frankl's Union-Closed Sets Conjecture (with B. Huang and M. Sellke), preprint.
Arithmetic Progressions in Sumsets of Sparse Integers (with N. Alon, Y.P. Liu, A. Martinsson, and S. Narayanan), Integers (2021).
Discrepancy Minimization via a Self-Balancing Walk (with Y. P.Liu and M. Sawhney), STOC (2021). Won Best Student Paper.
Set system blowups, preprint.
On the subgraph query problem (with C. Ben Hamida, X. He, and A. Moreira), Combinatorics, Probability and Computing (2021).
Improved bounds for the sunflower lemma (with S. Lovett, K. Wu, J. Zhang), Annals of Mathematics (2021). Also STOC (2020), where it won Best Paper. Quanta article.
Noisy Corruption Detection, Information Processing Letters (2020).
On the product dimension of clique factors (with N. Alon), European Journal of Combinatorics (2020).
Bounded gaps between primes in short intervals (with S. Luo), Research in Number Theory (2018).
Ramsey Numbers of Odd Cycles Versus Larger Even Wheels, Discrete Mathematics (2018).
Asymptotic results on Klazar set partition avoidance, Discrete Mathematics and Theoretical Computer Science (2018).
Give to Weizmann, the Hebrew University, Tel Aviv University, and the Technion.
I can be reached at ra and then 699 AT cam DOT ac DOT uk or at rye and then guy and then 10 AT gmail DOT com