A probabilistic technique for finding almost-periods of convolutions E Croot, O Sisask Geometric and functional analysis 20, 1367-1396, 2010 | 113 | 2010 |
Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions TF Bloom, O Sisask arXiv preprint arXiv:2007.03528, 2020 | 50 | 2020 |
Arithmetic progressions in sumsets and Lp-almost-periodicity E Croot, I Łaba, O Sisask Combinatorics, Probability and Computing 22 (03), 351-365, 2013 | 50 | 2013 |
Roth's theorem for four variables and additive structures in sums of sparse sets T Schoen, O Sisask Forum of Mathematics, Sigma 4, 2016 | 39 | 2016 |
On the maximal number of 3-term arithmetic progressions in subsets of ℤ/pℤ B Green, O Sisask Bulletin of the London Mathematical Society 40 (6), 945-955, 2008 | 16 | 2008 |
Convolutions of sets with bounded VC-dimension are uniformly continuous O Sisask arXiv preprint arXiv:1802.02836, 2018 | 15 | 2018 |
Logarithmic bounds for Roth's theorem via almost-periodicity TF Bloom, O Sisask arXiv preprint arXiv:1810.12791, 2018 | 14 | 2018 |
Convergence Results for Systems of Linear Forms on Cyclic Groups and Periodic Nilsequences P Candela, O Sisask SIAM Journal on Discrete Mathematics 28 (2), 786-810, 2014 | 14 | 2014 |
A new proof of Roth’s theorem on arithmetic progressions E Croot, O Sisask Proceedings of the American Mathematical Society 137 (3), 805-809, 2009 | 14 | 2009 |
An improvement to the Kelley-Meka bounds on three-term arithmetic progressions TF Bloom, O Sisask arXiv preprint arXiv:2309.02353, 2023 | 13 | 2023 |
The Kelley–Meka bounds for sets free of three-term arithmetic progressions TF Bloom, O Sisask Essential Number Theory 2 (1), 15-44, 2023 | 11 | 2023 |
On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime P Candela, O Sisask Acta Mathematica Hungarica 132 (3), 223-243, 2011 | 11 | 2011 |
A removal lemma for linear configurations in subsets of the circle P Candela, O Sisask Proceedings of the Edinburgh Mathematical Society 56 (3), 657-666, 2013 | 7 | 2013 |
The graded ring database webpage G Brown, S Davis, A Kasprzyk, M Kerber, O Sisask, S Tawn | 6 | |
Combinatorial properties of large subsets of abelian groups OPA Sisask University of Bristol, 2009 | 5 | 2009 |
Bourgain’s proof of the existence of long arithmetic progressions in A+ B O Sisask preprint, 2009 | 3 | 2009 |
Notes on proving Roth’s theorem using Bogolyubov’s method E Croot, O Sisask | 1 | |
Discrete Fourier analysis: structures in sumsets O Sisask | 1 | |
A PROOF OF ROTH’S THEOREM ON ARITHMETIC PROGRESSIONS E CROOT, O SISASK | | |