4 citations · 7 across the 3 of their papers we have counts for
3 papers
math.NT2023★ 4 cited
An improvement to the Kelley-Meka bounds on three-term arithmetic progressions
Thomas F. Bloom, Olof Sisask
In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present…
math.CO2014
Roth's theorem for four variables and additive structures in sums of sparse sets
Tomasz Schoen, Olof Sisask
We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, wh…
math.NT2010★ 3 cited
A probabilistic technique for finding almost-periods of convolutions
Ernie Croot, Olof Sisask
We introduce a new probabilistic technique for finding 'almost-periods' of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates establishe…