13 citations · 58 across the 12 of their papers we have counts for
13 papers
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…
The Kelley--Meka bounds for sets free of three-term arithmetic progressions
Thomas F. Bloom, Olof Sisask
We give a self-contained exposition of the recent remarkable result of Kelley and Meka: if has no non-trivial three-term arithmetic progressions then $\…
Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions
Thomas F. Bloom, Olof Sisask
We show that if contains no non-trivial three-term arithmetic progressions then for some absolute constant . In…
Logarithmic bounds for Roth's theorem via almost-periodicity
Thomas F. Bloom, Olof Sisask
We give a new proof of logarithmic bounds for Roth's theorem on arithmetic progressions, namely that if is free of three-term progressions, then $\lver…
Convolutions of sets with bounded VC-dimension are uniformly continuous
Olof Sisask
We study a notion of VC-dimension for subsets of groups, defining this for a set to be the VC-dimension of the family . We show that if…
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…