Logarithmic bounds for Roth's theorem via almost-periodicity

  title={Logarithmic bounds for Roth's theorem via almost-periodicity},
  author={Thomas F. Bloom and Olof Sisask},
  journal={discrete Analysis},
Logarithmic bounds for Roth's theorem via almost-periodicity, Discrete Analysis 2019:4, 20pp. A central result of additive combinatorics, Roth's theorem, asserts that for every $\delta>0$ there exists $N$ such that every subset of $\{1,2,\dots,N\}$ of size at least $\delta N$ contains an arithmetic progression of length 3. This is the first non-trivial case of Szemeredi's theorem, proved over 20 years later, which is the corresponding statement for progressions of general length. If we define… 

Tower-type bounds for Roth’s theorem with popular differences

It is proved that the minimum $N_0(\epsilon)$ in Green's theorem is an exponential tower of 2s of height on the order of $\log(1/\ep silon)$.

Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions.

We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this

Recent progress on bounds for sets with no three terms in arithmetic progression

(1) x, x + y, . . . , x + (k − 1)y, of all lengths. Here nontrivial means that y 6= 0 in (1). Motivated by van der Waerden’s result, Erdős and Turán (1936) conjectured that every subset of the


A paper of Bloom and Sisask is presented, which provides a new proof of Roth’s theorem on 3-term arithmetic progressions, using an almost periodicity argument in physical space rather than relying on Fourier analysis, as many previous proofs have done.

A Subexponential Upper Bound for van der Waerden Numbers $W(3, k)$

We show an improved upper estimate for van der Waerden number $W(3,k):$ there is an absolute constant $c>0$ such that if $\{1,\dots,N\}=X\cup Y$ is a partition such that $X$ does not contain any

New bound for Roth's theorem with generalized coefficients

: We prove the following conjecture of Shkredov and Solymosi: every subset A ⊂ Z 2 such that ∑ a ∈ A \{ 0 } 1 / (cid:107) a (cid:107) 2 = + ∞ contains the three vertices of an isosceles right

Roth's Theorem and the Hardy--Littlewood majorant problem for thin subsets of primes

. We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth’s Theorem in these sets, namely, we show that any subset of them with positive relative upper

Integer Sets of Large Harmonic Sum Which Avoid Long Arithmetic Progressions

We give conditions under which certain digit-restricted integer sets avoid k-term arithmetic progressions. These sets are reasonably efficient to compute and therefore enable large-scale search. We

Almost periodicity and its applications to Roth’s theorem

We give a self-contained exposition of several aspects of Croot-Sisask almost periodicity, with a special focus on its application to Roth’s theorem. Using almost periodicity, we obtain a bound on

The Equidistant Dimension of Graphs

A subset S of vertices of a connected graph G is a distance-equalizer set if for every two distinct vertices x,y∈V(G)\S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}




We show that if $A\subset \{1,\ldots ,N\}$ does not contain any nontrivial solutions to the equation $x+y+z=3w$ , then $$\begin{eqnarray}|A|\leqslant \frac{N}{\exp (c(\log N)^{1/7})},\end{eqnarray}$$

Arithmetic Progressions in Sumsets and Lp-Almost-Periodicity

A very short proof of a theorem of Green that if A and B are subsets of {1,.

A Probabilistic Technique for Finding Almost-Periods of Convolutions

We introduce a new probabilistic technique for finding ‘almost-periods’ of convolutions of subsets of groups. This gives results similar to the Bogolyubovtype estimates established by Fourier

A quantitative improvement for Roth's theorem on arithmetic progressions

  • T. Bloom
  • Mathematics
    J. Lond. Math. Soc.
  • 2016
The quantitative estimate for Roth's theorem is improved, showing that if A⊂{1,...,N} contains no non‐trivial three‐term arithmetic progressions, then |A|≪N(loglogN)4/logN .

Roth’s theorem on progressions revisited

An improvement of the density condition for a subset A to contain a nontrivial arithmetic progression of length 3 to prove the following Theorem.

New Bounds on cap sets

We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \over

Integer Sets Containing No Arithmetic Progressions

lfh and k are positive integers there exists N(h, k) such that whenever N ^ N(h, k), and the integers 1,2,...,N are divided into h subsets, at least one must contain an arithmetic progression of

Additive structures in sumsets

  • T. Sanders
  • Mathematics, Computer Science
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2008
The observation that one can apply the iterative method to these problems using some machinery of Bourgain regarding the large spectrum of L2-functions seems to be of interest in its own right and has already found one application elsewhere.

On Roth's theorem on progressions

We show that if Af 1;:::;Ng contains no nontrivial three-term arithmetic progressions thenjAj = O(N=log 1 o(1) N).

On certain other sets of integers

We show that if A ⊂ {1,...,N} contains no non-trivial three-term arithmetic progressions then |A| = O(N/log3/4−o(1)N).