We prove the convergence of moments of the number of directions of affine lattice vectors that fall into a small disc, under natural Diophantine conditions on the shift. Furthermore, we show that the pair correlation function is Poissonian for any irrational shift in dimension 3 and higher, including well-approximable vectors. Convergence in distribution was already proved in the work of Strömbergsson and the second author [The distribution of free path lengths in the periodic Lorentz gas and related lattice point problems. Ann. of Math. (2) 172 (2010), 1949–2033], and the principal step in the extension to convergence of moments is an escape of mass estimate for averages over embedded $\operatorname {SL}(d,\mathbb {R})$-horospheres in the space of affine lattices.

We introduce a new class of generalised quadratic forms over totally real number fields, which is rich enough to capture the arithmetic of arbitrary systems of quadrics over the rational numbers. We explore this connection through a version of the Hardy–Littlewood circle method over number fields.

We consider spectral projectors associated to the Euclidean Laplacian on the two-dimensional torus, in the case where the spectral window is narrow. Bounds for their L2 to Lp operator norm are derived, extending the classical result of Sogge; a new question on the convolution kernel of the projector is introduced. The methods employed include $\ell^2$ decoupling, small cap decoupling and estimates of exponential sums.

We prove the Hasse principle for a smooth projective variety $X\subset \mathbb {P}^{n-1}_\mathbb {Q}$ defined by a system of two cubic forms $F,G$ as long as $n\geq 39$. The main tool here is the development of a version of Kloosterman refinement for a smooth system of equations defined over $\mathbb {Q}$.

A set of complex numbers $S$ is called invariant if it is closed under addition and multiplication, namely, for any $x, y \in S$ we have $x+y \in S$ and $xy \in S$. For each $s \in {\mathbb {C}}$ the smallest invariant set ${\mathbb {N}}[s]$ containing $s$ consists of all possible sums $\sum _{i \in I} a_i s^i$, where $I$ runs over all finite nonempty subsets of the set of positive integers ${\mathbb {N}}$ and $a_i \in {\mathbb {N}}$ for each $i \in I$. In this paper, we prove that for $s \in {\mathbb {C}}$ the set ${\mathbb {N}}[s]$ is everywhere dense in ${\mathbb {C}}$ if and only if $s \notin {\mathbb {R}}$ and $s$ is not a quadratic algebraic integer. More precisely, we show that if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is a transcendental number, then there is a positive integer $n$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for either $t=s$ or $t=s+s^2$. Similarly, if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is an algebraic number of degree $d \ne 2, 4$, then there are positive integers $n, m$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for $t=ms+s^2$. For quadratic and some special quartic algebraic numbers $s$ it is shown that a similar sumset of three sets cannot be dense. In each of these two cases the density of ${\mathbb {N}}[s]$ in ${\mathbb {C}}$ is established by a different method: for those special quartic numbers, it is possible to take a sumset of four sets.

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.

Ranks of partitions play an important role in the theory of partitions. They provide combinatorial interpretations for Ramanujan’s famous congruences for partition functions. We establish a family of congruences modulo powers of $5$ for ranks of partitions.

We show that certain sums of partition numbers are divisible by multiples of 2 and 3. For example, if $p(n)$ denotes the number of unrestricted partitions of a positive integer n (and $p(0)=1$, $p(n)=0$ for $n<0$), then for all nonnegative integers m,

$$ \begin{align*}\sum_{k=0}^\infty p(24m+23-\omega(-2k))+\sum_{k=1}^\infty p(24m+23-\omega(2k))\equiv 0~ (\text{mod}~144),\end{align*} $$

where $\omega (k)=k(3k+1)/2$.

Noting a curious link between Andrews’ even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is twofold. Firstly, we derive results for certain restricted partitions with even parts below odd parts. These include a Franklin-type involution proving a parametrized identity that generalizes Andrews’ bivariate generating function, and two families of Andrews–Beck type congruences. Secondly, we introduce several new subsets of partitions that are stable (i.e. invariant under conjugation) and explore their connections with three third-order mock theta functions $\omega (q)$, $\nu (q)$, and $\psi ^{(3)}(q)$, introduced by Ramanujan and Watson.

In 2007, Andrews introduced Durfee symbols and k-marked Durfee symbols so as to give a combinatorial interpretation for the symmetrized moment function $\eta _{2k}(n)$ of ranks of partitions. He also considered the relations between odd Durfee symbols and the mock theta function $\omega (q)$, and proved that the $2k$th moment function $\eta _{2k}^0(n)$ of odd ranks of odd Durfee symbols counts $(k+1)$-marked odd Durfee symbols of n. In this paper, we first introduce the definition of symmetrized positive odd rank moments $\eta _k^{0+}(n)$ and prove that for all $1\leq i\leq k+1$, $\eta _{2k-1}^{0+}(n)$ is equal to the number of $(k+1)$-marked odd Durfee symbols of n with the ith odd rank equal to zero and $\eta _{2k}^{0+}(n)$ is equal to the number of $(k+1)$-marked Durfee symbols of n with the ith odd rank being positive. Then we calculate the generating functions of $\eta _{k}^{0+}(n)$ and study its asymptotic behavior. Finally, we use Wright’s variant of the Hardy–Ramanujan circle method to obtain an asymptotic formula for $\eta _{k}^{0+}(n)$.

We prove convergence in norm and pointwise almost everywhere on $L^p$, $p\in (1,\infty )$, for certain multi-parameter polynomial ergodic averages by establishing the corresponding multi-parameter maximal and oscillation inequalities. Our result, in particular, gives an affirmative answer to a multi-parameter variant of the Bellow–Furstenberg problem. This paper is also the first systematic treatment of multi-parameter oscillation semi-norms which allows an efficient handling of multi-parameter pointwise convergence problems with arithmetic features. The methods of proof of our main result develop estimates for multi-parameter exponential sums, as well as introduce new ideas from the so-called multi-parameter circle method in the context of the geometry of backwards Newton diagrams that are dictated by the shape of the polynomials defining our ergodic averages.

We prove discrete restriction estimates for a broad class of hypersurfaces arising in seminal work of Birch. To do so, we use a variant of Bourgain’s arithmetic version of the Tomas–Stein method and Magyar’s decomposition of the Fourier transform of the indicator function of the integer points on a hypersurface.

In 2019, Andrews and Newman [‘Partitions and the minimal excludant’, Ann. Comb. 23(2) (2019), 249–254] introduced the arithmetic function $\sigma \textrm {mex}(n)$, which denotes the sum of minimal excludants over all the partitions of n. Baruah et al. [‘A refinement of a result of Andrews and Newman on the sum of minimal excludants’, Ramanujan J., to appear] showed that the sum of minimal excludants over all the partitions of n is the same as the number of partition pairs of n into distinct parts. They proved three congruences modulo $4$ and $8$ for two functions appearing in this refinement and conjectured two further congruences modulo $8$ and $16$. We confirm these two conjectures by using q-series manipulations and modular forms.

We prove quantitative bounds for the inverse theorem for Gowers uniformity norms $\mathsf {U}^5$ and $\mathsf {U}^6$ in $\mathbb {F}_2^n$. The proof starts from an earlier partial result of Gowers and the author which reduces the inverse problem to a study of algebraic properties of certain multilinear forms. The bulk of the work in this paper is a study of the relationship between the natural actions of $\operatorname {Sym}_4$ and $\operatorname {Sym}_5$ on the space of multilinear forms and the partition rank, using an algebraic version of regularity method. Along the way, we give a positive answer to a conjecture of Tidor about approximately symmetric multilinear forms in five variables, which is known to be false in the case of four variables. Finally, we discuss the possible generalization of the argument for $\mathsf {U}^k$ norms.

We study fluctuations of the error term for the number of integer lattice points lying inside a three-dimensional Cygan–Korányi ball of large radius. We prove that the error term, suitably normalized, has a limiting value distribution which is absolutely continuous, and we provide estimates for the decay rate of the corresponding density on the real line. In addition, we establish the existence of all moments for the normalized error term, and we prove that these are given by the moments of the corresponding density.

Formulas evaluating differences of integer partitions according to the parity of the parts are referred to as Legendre theorems. In this paper we give some formulas of Legendre type for overpartitions.

We establish analogues for trees of results relating the density of a set ${E \subset \mathbb {N}}$, the density of its set of popular differences and the structure of E. To obtain our results, we formalize a correspondence principle of Furstenberg and Weiss which relates combinatorial data on a tree to the dynamics of a Markov process. Our main tools are Kneser-type inverse theorems for sets of return times in measure-preserving systems. In the ergodic setting, we use a recent result of the first author with Björklund and Shkredov and a stability-type extension (proved jointly with Shkredov); we also prove a new result for non-ergodic systems.

When $k\geqslant 4$ and $0\leqslant d\leqslant (k-2)/4$, we consider the system of Diophantine equations

\begin{align*}x_1^j+\ldots +x_k^j=y_1^j+\ldots +y_k^j\quad (1\leqslant j\leqslant k,\, j\ne k-d).\end{align*}

$d=o\!\left(k^{1/4}\right)$

Let $Q(n)$ denote the number of partitions of n into distinct parts. Merca [‘Ramanujan-type congruences modulo 4 for partitions into distinct parts’, An. Şt. Univ. Ovidius Constanţa 30(3) (2022), 185–199] derived some congruences modulo $4$ and $8$ for $Q(n)$ and posed a conjecture on congruences modulo powers of $2$ enjoyed by $Q(n)$. We present an approach which can be used to prove a family of internal congruence relations modulo powers of $2$ concerning $Q(n)$. As an immediate consequence, we not only prove Merca’s conjecture, but also derive many internal congruences modulo powers of $2$ satisfied by $Q(n)$. Moreover, we establish an infinite family of congruence relations modulo $4$ for $Q(n)$.

Lin introduced the partition function $\text {PDO}_t(n)$, which counts the total number of tagged parts over all the partitions of n with designated summands in which all parts are odd. Lin also proved some congruences modulo 3 and 9 for $\text {PDO}_t(n)$, and conjectured certain congruences modulo $3^{k+2}$ for $k\geq 0$. He proved the conjecture for $k=0$ and $k=1$ [‘The number of tagged parts over the partitions with designated summands’, J. Number Theory 184 (2018), 216–234]. We prove the conjecture for $k=2$. We also study the lacunarity of $\text {PDO}_t(n)$ modulo arbitrary powers of 2 and 3. Using nilpotency of Hecke operators, we prove that there exists an infinite family of congruences modulo any power of 2 satisfied by $\text {PDO}_t(n)$.