27 citations · 183 across the 26 of their papers we have counts for
5 papers · 1 filter
An algorithmic Polynomial Freiman-Ruzsa theorem
Davi Castro-Silva, Jop Briët, Srinivasan Arunachalam +2
We provide algorithmic versions of the Polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Ann. of Math., 2025). In particular, we give a polynomial-time algorithm…
On the threshold for Szemerédi's theorem with random differences
Jop Briët, Davi Castro-Silva
Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemerédi's theorem with random differences is bounded from above by $N^{1-\…
Random restrictions of high-rank tensors and polynomial maps
Jop Briët, Davi Castro-Silva
Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, f…
Gaussian width bounds with applications to arithmetic progressions in random settings
Jop Briët, Sivakanth Gopi
Motivated by problems on random differences in Szemerédi's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width o…
Arithmetic expanders and deviation bounds for random tensors
Jop Briët, Shravas Rao
We prove hypergraph variants of the celebrated Alon-Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every prime $p\geq…