13 citations · 58 across the 12 of their papers we have counts for
6 papers · 1 filter
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…
Arithmetic progressions in sumsets and L^p-almost-periodicity
Ernie Croot, Izabella Laba, Olof Sisask
We prove results about the L^p-almost-periodicity of convolutions. One of these follows from a simple but rather general lemma about approximating a sum of functions in L^p, and gi…
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…
On the maximal number of three-term arithmetic progressions in subsets of Z/pZ
Ben Green, Olof Sisask
Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at m…