Related papers: New lower bounds for $r_3(N)$

Ellenberg and Gijswijt gave the best known asymptotic upper bound for the cardinality of subsets of $\mathbb F_q^n$ without 3-term arithmetic progressions. We improve this bound by a factor $\sqrt{n}$. In the case $q=3$, we also obtain more…

We prove polynomial bounds on the growth of higher Sobolev norms for the nonlinear Schrodinger equation set on a torus, in dimension 3, with super-cubic and sub-quintic nonlinearity. Due to improved Strichartz estimates, these bounds are…

Very recently, Green and Sawhney obtained a quasipolynomial bound in the Furstenberg--S\'ark\"ozy theorem for square differences by proving an ''arithmetic level-$d$'' inequality, thereby yielding a greatly improved density increment…

We give a new proof of logarithmic bounds for Roth's theorem on arithmetic progressions, namely that if $A \subset \{1,2,\ldots,N\}$ is free of three-term progressions, then $\lvert A\rvert \leq N/(\log N)^{1-o(1)}$. Unlike previous proofs,…

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…

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…

We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…

We show that subsets of $\mathbb{F}_q^{\infty}$ of large Fourier dimension must contain three-term arithmetic progressions. This contrasts with a construction of Shmerkin of a subset of $\mathbb{R}$ of Fourier dimension $1$ with no…

This paper records some apparently new results for the partition of integer intervals [1, n] into weakly sum-free subsets. These were produced using a method closely related to that used by Schur in 1917. New lower bounds can be produced in…

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is…

Given a subset of the integers of zero density, we define the weaker notion of fractional density of such a set. It is shown how this notion corresponds to that of the Hausdorff dimension of a compact subset of the reals. We then show that…

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

We adapt the construction of subsets of {1, 2, ..., N} that contain no k-term arithmetic progressions to give a relatively thick subset of an arbitrary set of N integers. Particular examples include a thick subset of {1, 4, 9, ..., N^2}…

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

We prove that every subset of $\{1,\dots, N\}$ which does not contain any solutions to the equation $x+y+z=3w$ has at most $\exp(-c(\log N)^{1/5+o(1)})N$ elements, for some $c>0$. This theorem improves upon previous estimates. Additionally,…

We study residual polynomials, $R_{x_0,n}^{(\mathfrak{e})}$, $\mathfrak{e}\subset\mathbb{R}$, $x_0\in\mathbb{R}\setminus\mathfrak{e}$, which are the degree at most $n$ polynomials with $R(x_0)=1$ that minimize the $\sup$ norm on…