In this paper, we prove that the bound

\begin{equation*}\max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}}\end{equation*}

$A \subset \mathbb R$

\begin{equation*}\max \{ |16A|, |A^{(16)}| \} \gg |A|^{\frac{3}{2} + c},\end{equation*}

$c\gt 0$

$\mathbb R$

$3/2$

\begin{equation*}|AA| \leq K|A| \implies \,\forall d \in \mathbb R \setminus \{0 \}, \,\, |\{(a,b) \in A \times A : a-b=d \}| \ll K^C |A|^{\frac{2}{3}-c^{\prime}},\end{equation*}

$c,C \gt 0$

We introduce a new concept of rank – relative rank associated to a filtered collection of polynomials. When the filtration is trivial, our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of relative bias. The main result of the paper is a relation between these two quantities over finite fields (as a special case, we obtain a new proof of the results in [21]). This relation allows us to get an accurate estimate for the number of points on an affine variety given by a collection of polynomials which is of high relative rank (Lemma 3.2). The key advantage of relative rank is that it allows one to perform an efficient regularization procedure which is polynomial in the initial number of polynomials (the regularization process with Schmidt rank is far worse than tower exponential). The main result allows us to replace Schmidt rank with relative rank in many key applications in combinatorics, algebraic geometry, and algebra. For example, we prove that any collection of polynomials $\mathcal P=(P_i)_{i=1}^c$ of degrees $\le d$ in a polynomial ring over an algebraically closed field of characteristic $>d$ is contained in an ideal $\mathcal I({\mathcal Q})$, generated by a collection ${\mathcal Q}$ of polynomials of degrees $\le d$ which form a regular sequence, and ${\mathcal Q}$ is of size $\le A c^{A}$, where $A=A(d)$ is independent of the number of variables.

We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give applications of these results to new bounds on correlations between Salié sums and to a new equidistribution estimate for the set of modular roots of primes.

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb {F}_p^n\times \mathbb {F}_p^n$ containing no nontrivial configurations of the form $(x,y)$, $(x,y+z)$, $(x,y+2z)$, $(x+z,y)$ must have density $\ll 1/\log _{m}{n}$, where $\log _{m}$ denotes the $m$-fold iterated logarithm. This gives the first reasonable bound in the multidimensional Szemerédi theorem for a two-dimensional four-point configuration in any setting.

We study higher uniformity properties of the Möbius function $\mu $, the von Mangoldt function $\Lambda $, and the divisor functions $d_k$ on short intervals $(X,X+H]$ with $X^{\theta +\varepsilon } \leq H \leq X^{1-\varepsilon }$ for a fixed constant $0 \leq \theta < 1$ and any $\varepsilon>0$.

More precisely, letting $\Lambda ^\sharp $ and $d_k^\sharp $ be suitable approximants of $\Lambda $ and $d_k$ and $\mu ^\sharp = 0$, we show for instance that, for any nilsequence $F(g(n)\Gamma )$, we have

$$\begin{align*}\sum_{X < n \leq X+H} (f(n)-f^\sharp(n)) F(g(n) \Gamma) \ll H \log^{-A} X \end{align*}$$

when $\theta = 5/8$ and $f \in \{\Lambda , \mu , d_k\}$ or $\theta = 1/3$ and $f = d_2$.

As a consequence, we show that the short interval Gowers norms $\|f-f^\sharp \|_{U^s(X,X+H]}$ are also asymptotically small for any fixed s for these choices of $f,\theta $. As applications, we prove an asymptotic formula for the number of solutions to linear equations in primes in short intervals and show that multiple ergodic averages along primes in short intervals converge in $L^2$.

Our innovations include the use of multiparameter nilsequence equidistribution theorems to control type $II$ sums and an elementary decomposition of the neighborhood of a hyperbola into arithmetic progressions to control type $I_2$ sums.

In our paper, we study multiplicative properties of difference sets $A-A$ for large sets $A \subseteq {\mathbb {Z}}/q{\mathbb {Z}}$ in the case of composite q. We obtain a quantitative version of a result of A. Fish about the structure of the product sets $(A-A)(A-A)$. Also, we show that the multiplicative covering number of any difference set is always small.

We say that $S\subseteq \mathbb Z$ is a set of k-recurrence if for every measure-preserving transformation T of a probability measure space $(X,\mu )$ and every $A\subseteq X$ with $\mu (A)>0$, there is an $n\in S$ such that $\mu (A\cap T^{-n} A\cap T^{-2n}\cap \cdots \cap T^{-kn}A)>0$. A set of $1$-recurrence is called a set of measurable recurrence. Answering a question of Frantzikinakis, Lesigne, and Wierdl [Sets of k-recurrence but not (k+1)-recurrence. Ann. Inst. Fourier (Grenoble) 56(4) (2006), 839–849], we construct a set of $2$-recurrence S with the property that $\{n^2:n\in S\}$ is not a set of measurable recurrence.

Leonetti and Luca [‘On the iterates of the shifted Euler’s function’, Bull. Aust. Math. Soc., to appear] have shown that the integer sequence $(x_n)_{n\geq 1}$ defined by $x_{n+2}=\phi (x_{n+1})+\phi (x_{n})+k$, where $x_1,x_2\geq 1$, $k\geq 0$ and $2 \mid k$, is bounded by $4^{X^{3^{k+1}}}$, where $X=(3x_1+5x_2+7k)/2$. We improve this result by showing that the sequence $(x_n)$ is bounded by $2^{2X^2+X-3}$, where $X=x_1+x_2+2k$.

Let $\mathcal {F}$ denote the set of functions $f \colon [-1/2,1/2] \to \mathbb {R}_{\geq 0}$ such that $\int f = 1$. We determine the value of $\inf _{f \in \mathcal {F}} \| f \ast f \|_2^2$ up to a $4 \cdot 10^{-6}$ error, thereby making progress on a problem asked by Ben Green. Furthermore, we prove that a unique minimizer exists. As a corollary, we obtain improvements on the maximum size of $B_h[g]$ sets for $(g,h) \in \{ (2,2),(3,2),(4,2),(1,3),(1,4)\}$.

In this paper, the nilspace approach to higher-order Fourier analysis is developed in the setting of vector spaces over a prime field $\mathbb {F}_p$, with applications mainly in ergodic theory. A key requisite for this development is to identify a class of nilspaces adequate for this setting. We introduce such a class, whose members we call p-homogeneous nilspaces. One of our main results characterizes these objects in terms of a simple algebraic property. We then prove various further results on these nilspaces, leading to a structure theorem describing every finite p-homogeneous nilspace as the image, under a nilspace fibration, of a member of a simple family of filtered finite abelian p-groups. The applications include a description of the Host–Kra factors of ergodic $\mathbb {F}_p^\omega $-systems as p-homogeneous nilspace systems. This enables the analysis of these factors to be reduced to the study of such nilspace systems, with central questions on the factors thus becoming purely algebraic problems on finite nilspaces. We illustrate this approach by proving that for $k\leq p+1$ the kth Host–Kra factor is an Abramov system of order at most k, extending a result of Bergelson–Tao–Ziegler that holds for $k< p$. We illustrate the utility of p-homogeneous nilspaces also by showing that the structure theorem yields a new proof of the Tao–Ziegler inverse theorem for Gowers norms on $\mathbb {F}_p^n$.

Celebrated theorems of Roth and of Matoušek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta (n^{1/4})$. We study the analogous problem in the $\mathbb {Z}_n$ setting. We asymptotically determine the logarithm of the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for all positive integer $n$. We further determine up to a constant factor the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for many $n$. For example, if $n=p^k$ is a prime power, then the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ is $\Theta (n^{1/3+r_k/(6k)})$, where $r_k \in \{0,1,2\}$ is the remainder when $k$ is divided by $3$. This solves a problem of Hebbinghaus and Srivastav.

We show that if $\mathcal {A}\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in \mathcal {A}$ and $n\geq 1$, then

\[ \lvert \mathcal{A}\rvert \ll \frac{N}{(\log N)^{c\log\log \log N}} \]

$c>0$

We show that there is a red-blue colouring of $[N]$ with no blue 3-term arithmetic progression and no red arithmetic progression of length $e^{C(\log N)^{3/4}(\log \log N)^{1/4}}$. Consequently, the two-colour van der Waerden number $w(3,k)$ is bounded below by $k^{b(k)}$, where $b(k) = c \big ( \frac {\log k}{\log \log k} \big )^{1/3}$. Previously it had been speculated, supported by data, that $w(3,k) = O(k^2)$.

We establish the mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive upper density contains patterns of the form $\{m,m+[p_n^a], m+[p_n^b]\}$ , where $a,b$ are positive nonintegers and $p_n$ denotes the nth prime, a property that fails if a or b is a natural number. Our approach is based on a recent criterion for joint ergodicity of collections of sequences, and the bulk of the proof is devoted to obtaining good seminorm estimates for the related multiple ergodic averages. The input needed from number theory are upper bounds for the number of prime k-tuples that follow from elementary sieve theory estimates and equidistribution results of fractional powers of primes in the circle.

We study quantitative relationships between the triangle removal lemma and several of its variants. One such variant, which we call the triangle-free lemma, states that for each $\epsilon>0$ there exists M such that every triangle-free graph G has an $\epsilon$ -approximate homomorphism to a triangle-free graph F on at most M vertices (here an $\epsilon$ -approximate homomorphism is a map $V(G) \to V(F)$ where all but at most $\epsilon \left\lvert{V(G)}\right\rvert^2$ edges of G are mapped to edges of F). One consequence of our results is that the least possible M in the triangle-free lemma grows faster than exponential in any polynomial in $\epsilon^{-1}$ . We also prove more general results for arbitrary graphs, as well as arithmetic analogues over finite fields, where the bounds are close to optimal.

For a polynomial progression

$$ \begin{align*}(x,\; x+P_1(y),\ldots,\; x+P_{t}(y)),\end{align*} $$

$P_1, \ldots ,\!P_t$

$$ \begin{align*}(x,\; x+y^2,\; x+2y^2,\; x+y^3,\; x+2y^3),\end{align*} $$

$\mathbb {Z}/N\mathbb {Z}$

$\mathbb {Z}/N\mathbb {Z}$

We obtain a nontrivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to the growth of conjugates classes, estimates of exponential sums, and restriction phenomenon.

We improve the best known sum-product estimates over the reals. We prove that

\[\max(|A+A|,|A+A|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,,\]

$A\subset \mathbb {R}$

Furthermore,

\[|AA+AA|\geq |A|^{\frac{127}{80} - o(1)}\,.\]

\[|A+A|\geq |A|^{\frac{30}{19}-o(1)}\,.\]

We show that there is a measure-preserving system $(X,\mathscr {B}, \mu , T)$ together with functions $F_0, F_1, F_2 \in L^{\infty }(\mu )$ such that the correlation sequence $C_{F_0, F_1, F_2}(n) = \int _X F_0 \cdot T^n F_1 \cdot T^{2n} F_2 \, d\mu $ is not an approximate integral combination of $2$ -step nilsequences.

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that relates true complexity to algebraic relations between the terms of the progression, and we prove it for a number of progressions, including $x, x+y, x+y^{2}, x+y+y^{2}$ and $x, x+y, x+2y, x+y^{2}$. As a corollary, we prove an asymptotic for the count of certain progressions of complexity 1 in subsets of finite fields. In the process, we obtain an equidistribution result for certain polynomial progressions, analogous to the counting lemma for systems of linear forms proved by Green and Tao.