Related papers: Improved Bounds for Szemer\'{e}di's Theorem

Let $r_5(N)$ be the largest cardinality of a set in $\{1,\ldots,N\}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c\in (0,1)$ such that \[r_5(N)\ll \frac{N}{\exp((\log\log N)^{c})}.\] Our work…

Define $r_4(N)$ to be the largest cardinality of a set $A \subset \{1,\dots,N\}$ which does not contain four elements in arithmetic progression. In 1998 Gowers proved that \[ r_4(N) \ll N(\log \log N)^{-c}\] for some absolute constant…

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

Let $r_k(n)$ denote the maximum cardinality of a set $A \subset \{1,2, \dots, n \}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound…

Define $r_4(N)$ to be the largest cardinality of a set $A$ in $\{1,\dots,N\}$ which does not contain four elements in arithmetic progression. In 1998 Gowers proved that $r_4(N) \ll N(\log \log N)^{-c}$ for some absolute constant $c> 0$. In…

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 a simple modification to their method that strengthens…

We show that there exists $c>0$ such that any subset of $\{1, \dots, N\}$ of density at least $(\log\log{N})^{-c}$ contains a nontrivial progression of the form $x,x+y,x+y^2$. This is the first quantitatively effective version of the…

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…

Szemer\'edi's theorem implies that there are $2^{o(n)}$ subsets of $[n]$ which do not contain a $k$-term arithmetic progression. A sparse analogue of this statement was obtained by Balogh, Morris, and Samotij, using the hypergraph container…

We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll…

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

We prove quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm. The proof is modeled after work of Green, Tao, and Ziegler and uses as a crucial input recent work of the first author regarding the equidistribution…

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

We develop recent ideas of Elsholtz, Proske, and Sauermann to construct denser subsets of $\{1,\dots,N\}$ that lack arithmetic progressions of length $3$. This gives the first quasipolynomial improvement since the original construction of…