Let $P_1, \ldots , P_m \in \mathbb {K}[\mathrm {y}]$ be polynomials with distinct degrees, no constant terms and coefficients in a general local field $\mathbb {K}$. We give a quantitative count of the number of polynomial progressions $x, x+P_1(y), \ldots , x + P_m(y)$ lying in a set $S\subseteq \mathbb {K}$ of positive density. The proof relies on a general $L^{\infty }$ inverse theorem which is of independent interest. This inverse theorem implies a Sobolev improving estimate for multilinear polynomial averaging operators which in turn implies our quantitative estimate for polynomial progressions. This general Sobolev inequality has the potential to be applied in a number of problems in real, complex and p-adic analysis.

We show that every finite coloring of the rationals contains monochromatic sets of the form $\{x,y,xy,x+y\}$.

For a subset $A$ of an abelian group $G$, given its size $|A|$, its doubling $\kappa =|A+A|/|A|$, and a parameter $s$ which is small compared to $|A|$, we study the size of the largest sumset $A+A'$ that can be guaranteed for a subset $A'$ of $A$ of size at most $s$. We show that a subset $A'\subseteq A$ of size at most $s$ can be found so that $|A+A'| = \Omega (\!\min\! (\kappa ^{1/3},s)|A|)$. Thus, a sumset significantly larger than the Cauchy–Davenport bound can be guaranteed by a bounded size subset assuming that the doubling $\kappa$ is large. Building up on the same ideas, we resolve a conjecture of Bollobás, Leader and Tiba that for subsets $A,B$ of $\mathbb{F}_p$ of size at most $\alpha p$ for an appropriate constant $\alpha \gt 0$, one only needs three elements $b_1,b_2,b_3\in B$ to guarantee $|A+\{b_1,b_2,b_3\}|\ge |A|+|B|-1$. Allowing the use of larger subsets $A'$, we show that for sets $A$ of bounded doubling, one only needs a subset $A'$ with $o(|A|)$ elements to guarantee that $A+A'=A+A$. We also address another conjecture and a question raised by Bollobás, Leader and Tiba on high-dimensional analogues and sets whose sumset cannot be saturated by a bounded size subset.

For an integer $b\geq 2$, a positive integer is called a b-Niven number if it is a multiple of the sum of the digits in its base-b representation. In this article, we show that every arithmetic progression contains infinitely many b-Niven numbers.

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 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)$.

In 1946, Erdős and Niven proved that no two partial sums of the harmonic series can be equal. We present a generalisation of the Erdős–Niven theorem by showing that no two partial sums of the series $\sum _{k=0}^\infty {1}/{(a+bk)}$ can be equal, where a and b are positive integers. The proof of our result uses analytic and p-adic methods.

In this paper we study the existence of higher dimensional arithmetic progressions in Meyer sets. We show that the case when the ratios are linearly dependent over ${\mathbb Z}$ is trivial and focus on arithmetic progressions for which the ratios are linearly independent. Given a Meyer set $\Lambda $ and a fully Euclidean model set with the property that finitely many translates of cover $\Lambda $ , we prove that we can find higher dimensional arithmetic progressions of arbitrary length with k linearly independent ratios in $\Lambda $ if and only if k is at most the rank of the ${\mathbb Z}$ -module generated by . We use this result to characterize the Meyer sets that are subsets of fully Euclidean model sets.

In this paper I argue for an association between impurity and explanatory power in contemporary mathematics. This proposal is defended against the ancient and influential idea that purity and explanation go hand-in-hand (Aristotle, Bolzano) and recent suggestions that purity/impurity ascriptions and explanatory power are more or less distinct (Section 1). This is done by analyzing a central and deep result of additive number theory, Szemerédi’s theorem, and various of its proofs (Section 2). In particular, I focus upon the radically impure (ergodic) proof due to Furstenberg (Section 3). Furstenberg’s ergodic proof is striking because it utilizes intuitively foreign and infinitary resources to prove a finitary combinatorial result and does so in a perspicuous fashion. I claim that Furstenberg’s proof is explanatory in light of its clear expression of a crucial structural result, which provides the “reason why” Szemerédi’s theorem is true. This is, however, rather surprising: how can such intuitively different conceptual resources “get a grip on” the theorem to be proved? I account for this phenomenon by articulating a new construal of the content of a mathematical statement, which I call structural content (Section 4). I argue that the availability of structural content saves intuitive epistemic distinctions made in mathematical practice and simultaneously explicates the intervention of surprising and explanatorily rich conceptual resources. Structural content also disarms general arguments for thinking that impurity and explanatory power might come apart. Finally, I sketch a proposal that, once structural content is in hand, impure resources lead to explanatory proofs via suitably understood varieties of simplification and unification (Section 5).

Let $\mathrm{AP}_k=\{a,a+d,\ldots,a+(k-1)d\}$ be an arithmetic progression. For $\varepsilon>0$ we call a set $\mathrm{AP}_k(\varepsilon)=\{x_0,\ldots,x_{k-1}\}$ an $\varepsilon$ -approximate arithmetic progression if for some a and d, $|x_i-(a+id)|<\varepsilon d$ holds for all $i\in\{0,1\ldots,k-1\}$ . Complementing earlier results of Dumitrescu (2011, J. Comput. Geom.2(1) 16–29), in this paper we study numerical aspects of Van der Waerden, Szemerédi and Furstenberg–Katznelson like results in which arithmetic progressions and their higher dimensional extensions are replaced by their $\varepsilon$ -approximation.

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.

We show that for infinitely many primes p there exist dual functions of order k over ${\mathbb{F}}_p^n$ that cannot be approximated in $L_\infty $-distance by polynomial phase functions of degree $k-1$. This answers in the negative a natural finite-field analogue of a problem of Frantzikinakis on $L_\infty $-approximations of dual functions over ${\mathbb{N}}$ (a.k.a. multiple correlation sequences) by nilsequences.

The level of distribution of a complex-valued sequence $b$ measures the quality of distribution of $b$ along sparse arithmetic progressions $nd+a$. We prove that the Thue–Morse sequence has level of distribution $1$, which is essentially best possible. More precisely, this sequence gives one of the first nontrivial examples of a sequence satisfying a Bombieri–Vinogradov-type theorem for each exponent $\theta <1$. This result improves on the level of distribution $2/3$ obtained by Müllner and the author. As an application of our method, we show that the subsequence of the Thue–Morse sequence indexed by $\lfloor n^c\rfloor$, where $1 < c < 2$, is simply normal. This result improves on the range $1 < c < 3/2$ obtained by Müllner and the author and closes the gap that appeared when Mauduit and Rivat proved (in particular) that the Thue–Morse sequence along the squares is simply normal.

For a compact abelian group G, a corner in G × G is a triple of points (x, y), (x, y+d), (x+d, y). The classical corners theorem of Ajtai and Szemerédi implies that for every α > 0, there is some δ > 0 such that every subset A ⊂ G × G of density α contains a δ fraction of all corners in G × G, as x, y, d range over G.

Recently, Mandache proved a “popular differences” version of this result in the finite field case $G = {\mathbb{F}}_p^n$, showing that for any subset A ⊂ G × G of density α, one can fix d ≠ 0 such that A contains a large fraction, now known to be approximately α4, of all corners with difference d, as x, y vary over G. We generalise Mandache’s result to all compact abelian groups G, as well as the case of corners in $\mathbb{Z}^2$.

We study the average error term in the usual approximation to the number of y-friable integers congruent to a modulo q, where a ≠ 0 is a fixed integer. We show that in the range exp{(log log x)5/3+ɛ} ⩽ y ⩽ x and on average over q ⩽ x/M with M → ∞ of moderate size, this average error term is asymptotic to −|a| Ψ(x/|a|, y)/2x. Previous results of this sort were obtained by the second author for reasonably dense sequences, however the sequence of y-friable integers studied in the current paper is thin, and required the use of different techniques, which are specific to friable integers.

We consider sequences of the form $(a_{n}\unicode[STIX]{x1D6FC})_{n}$ mod 1, where $\unicode[STIX]{x1D6FC}\in [0,1]$ and where $(a_{n})_{n}$ is a strictly increasing sequence of positive integers. If the asymptotic distribution of the pair correlations of this sequence follows the Poissonian model for almost all $\unicode[STIX]{x1D6FC}$ in the sense of Lebesgue measure, we say that $(a_{n})_{n}$ has the metric pair correlation property. Recent research has revealed a connection between the metric theory of pair correlations of such sequences, and the additive energy of truncations of $(a_{n})_{n}$. Bloom, Chow, Gafni and Walker speculated that there might be a convergence/divergence criterion which fully characterizes the metric pair correlation property in terms of the additive energy, similar to Khintchine’s criterion in the metric theory of Diophantine approximation. In the present paper we give a negative answer to such speculations, by showing that such a criterion does not exist. To this end, we construct a sequence $(a_{n})_{n}$ having large additive energy which, however, maintains the metric pair correlation property.

A subset $A$ of a finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ never equals the sum of $l$ (not necessarily distinct) elements of $A$. We find an explicit formula for the maximum size of a $(k,l)$-sum-free subset in $G$ for all $k$ and $l$ in the case when $G$ is cyclic by proving that it suffices to consider $(k,l)$-sum-free intervals in subgroups of $G$. This simplifies and extends earlier results by Hamidoune and Plagne [‘A new critical pair theorem applied to sum-free sets in abelian groups’, Comment. Math. Helv. 79(1) (2004), 183–207] and Bajnok [‘On the maximum size of a $(k,l)$-sum-free subset of an abelian group’, Int. J. Number Theory 5(6) (2009), 953–971].

We prove that the exponent of distribution of $\unicode[STIX]{x1D70F}_{3}$ in arithmetic progressions can be as large as $\frac{1}{2}+\frac{1}{34}$, provided that the moduli is squarefree and has only sufficiently small prime factors. The tools involve arithmetic exponent pairs for algebraic trace functions, as well as a double $q$-analogue of the van der Corput method for smooth bilinear forms.

The main result in Y. O. Hamidoune's paper ‘Adding distinct congruence classes' (Combin. Probab. Comput.7 (1998) 81–87) is as follows. If S is a generating subset of a cyclic group G such that 0 ∉ S and |S| ⩾ 5, then the number of sums of the subsets of S is at least min(|G|, 2|S|). Unfortunately, the argument of the author, who, sadly, passed away in 2011, relies on a lemma whose proof is incorrect; in fact, the lemma is false for all cyclic groups of even order. In this short note we point out this mistake, correct the proof, and discuss why the main result is actually true for all finite abelian groups.

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}$$

$c>0$

$1/7$

$1/2$

$A+A+A$

$A\subset \{1,\ldots ,N\}$

$A\subset \mathbb{F}_{q}^{n}$

$A$