Euler noted the relation $6^{3}\,=\,3^{3}+4^{3}+5^{3}$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and Zhongfeng Zhang. In particular, Stroeker determined all squares that can be written as a sum of at most 50 consecutive cubes. We generalize Stroeker’s work by determining all perfect powers that are sums of at most 50 consecutive cubes. Our methods include descent, linear forms in two logarithms and Frey–Hellegouarch curves.

Let $\unicode[STIX]{x1D703}$ be an arithmetic function and let ${\mathcal{B}}$ be the set of positive integers $n=p_{1}^{\unicode[STIX]{x1D6FC}_{1}}\cdots p_{k}^{\unicode[STIX]{x1D6FC}_{k}}$ which satisfy $p_{j+1}\leqslant \unicode[STIX]{x1D703}(p_{1}^{\unicode[STIX]{x1D6FC}_{1}}\cdots p_{j}^{\unicode[STIX]{x1D6FC}_{j}})$ for $0\leqslant j<k$ . We show that ${\mathcal{B}}$ has a natural density, provide a criterion to determine whether this density is positive, and give various estimates for the counting function of ${\mathcal{B}}$ . When $\unicode[STIX]{x1D703}(n)/n$ is non-decreasing, the set ${\mathcal{B}}$ coincides with the set of integers $n$ whose divisors $1=d_{1}<d_{2}<\cdots <d_{\unicode[STIX]{x1D70F}(n)}=n$ satisfy $d_{j+1}\leqslant \unicode[STIX]{x1D703}(d_{j})$ for $1\leqslant j<\unicode[STIX]{x1D70F}(n)$ .

Assuming the Riemann Hypothesis, Soundararajan [Ann. of Math. (2) 170 (2009), 981–993] showed that $\int _{0}^{T}|\unicode[STIX]{x1D701}(1/2+\text{i}t)|^{2k}\ll T(\log T)^{k^{2}+\unicode[STIX]{x1D716}}$ . His method was used by Chandee [Q. J. Math.62 (2011), 545–572] to obtain upper bounds for shifted moments of the Riemann Zeta function. Building on these ideas of Chandee and Soundararajan, we obtain, conditionally, upper bounds for shifted moments of Dirichlet $L$ -functions which allow us to derive upper bounds for moments of theta functions.

Consider a system of polynomials in many variables over the ring of integers of a number field  $K$ . We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any smooth and geometrically integral variety $X\subseteq \mathbb{P}_{K}^{m}$ satisfies the Hasse principle, weak approximation, and the Manin–Peyre conjecture if only its dimension is large enough compared to its degree. This generalizes work of Skinner, who considered the case where all polynomials have the same degree, and recent work of Browning and Heath-Brown, who considered the case where $K=\mathbb{Q}$ . Our main tool is Skinner’s number field version of the Hardy–Littlewood circle method. As a by-product, we point out and correct an error in Skinner’s treatment of the singular integral.

We generalize to higher dimensions the Bavard–Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex $d$ -dimensional polyhedra with fixed directions of facet normals has a decomposition into type cones that correspond to different combinatorial types of polyhedra. This decomposition is a subfan of the secondary fan of a vector configuration and can be analyzed with the help of Gale diagrams. We construct a family of quadratic forms on each of the type cones using the theory of mixed volumes. The Alexandrov–Fenchel inequalities ensure that these forms have exactly one positive eigenvalue. This introduces a piecewise hyperbolic structure on the space of similarity classes of polyhedra with fixed directions of facet normals. We show that some of the dihedral angles on the boundary of the resulting cone-manifold are equal to $\unicode[STIX]{x1D70B}/2$ .

We say that a planar set $A$ has the Kakeya property if there exist two different positions of $A$ such that $A$ can be continuously moved from the first position to the second within a set of arbitrarily small area. We prove that if $A$ is closed and has the Kakeya property, then the union of the non-trivial connected components of $A$ can be covered by a null set which is either the union of parallel lines or the union of concentric circles. In particular, if $A$ is closed, connected and has the Kakeya property, then $A$ can be covered by a line or a circle.

We say a graph is (Q n ,Q m )-saturated if it is a maximal Q m -free subgraph of the n-dimensional hypercube Q n . A graph is said to be (Q n ,Q m )-semi-saturated if it is a subgraph of Q n and adding any edge forms a new copy of Q m . The minimum number of edges a (Q n ,Q m )-saturated graph (respectively (Q n ,Q m )-semi-saturated graph) can have is denoted by sat(Q n ,Q m ) (respectively s-sat(Q n ,Q m )). We prove that

$$\begin{linenomath}\lim_{n\to\infty}\ffrac{\sat(Q_n,Q_m)}{e(Q_n)}=0,\end{linenomath}$$

$$\begin{linenomath}\ssat(Q_n,Q_m)\geq \ffrac{m+1}{2}\cdot 2^n,\end{linenomath}$$

A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one might expect from comparison with random graphs. We give an alternative construction for such graphs.

Let G be an abelian group of cardinality n, where hcf(n, 6) = 1, and let A be a random subset of G. Form a graph ΓA on vertex set G by joining x to y if and only if x + y ∈ A. Then, with high probability as n → ∞, the chromatic number χ(ΓA ) is at most $(1 + o(1))\tfrac{n}{2\log_2 n}$ . This is asymptotically sharp when G = ℤ/nℤ, n prime.

For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G obtained by retaining each edge independently with probability p = p(k). We prove that if p ⩾ (logk + loglogk + ωk (1))/k, where ωk (1) is any function tending to infinity with k, then Gp asymptotically almost surely contains a cycle of length at least k + 1. When we take G to be the complete graph on k + 1 vertices, our theorem coincides with the classic result on the threshold probability for the existence of a Hamilton cycle in the binomial random graph.

We prove that triangular configurations are plentiful in large subsets of Cartesian squares of finite quasirandom groups from classes having the quasirandom ultraproduct property, for example the class of finite simple groups. This is deduced from a strong double recurrence theorem for two commuting measure-preserving actions of a minimally almost periodic (not necessarily amenable or locally compact) group on a (not necessarily separable) probability space.

We study the lower tail large deviation problem for subgraph counts in a random graph. Let X H denote the number of copies of H in an Erdős–Rényi random graph $\mathcal{G}(n,p)$ . We are interested in estimating the lower tail probability $\mathbb{P}(X_H \le (1-\delta) \mathbb{E} X_H)$ for fixed 0 < δ < 1.

Thanks to the results of Chatterjee, Dembo and Varadhan, this large deviation problem has been reduced to a natural variational problem over graphons, at least for p ≥ n −α H (and conjecturally for a larger range of p). We study this variational problem and provide a partial characterization of the so-called ‘replica symmetric’ phase. Informally, our main result says that for every H, and 0 < δ < δH for some δH > 0, as p → 0 slowly, the main contribution to the lower tail probability comes from Erdős–Rényi random graphs with a uniformly tilted edge density. On the other hand, this is false for non-bipartite H and δ close to 1.

Judicious partitioning problems on graphs and hypergraphs ask for partitions that optimize several quantities simultaneously. Let k ≥ 2 be an integer and let G be a hypergraph with m i edges of size i for i=1,2. Bollobás and Scott conjectured that G has a partition into k classes, each of which contains at most $m_1/k+m_2/k^2+O(\sqrt{m_1+m_2})$ edges. In this paper, we confirm the conjecture affirmatively by showing that G has a partition into k classes, each of which contains at most

$$m_1/k+m_2/k^2+\ffrac{k-1}{2k^2}\sqrt{2(km_1+m_2)}+O(1)$$.

We consider the Widom–Rowlinson model of two types of interacting particles on d-regular graphs. We prove a tight upper bound on the occupancy fraction, the expected fraction of vertices occupied by a particle under a random configuration from the model. The upper bound is achieved uniquely by unions of complete graphs on d + 1 vertices, K d+1. As a corollary we find that K d+1 also maximizes the normalized partition function of the Widom–Rowlinson model over the class of d-regular graphs. A special case of this shows that the normalized number of homomorphisms from any d-regular graph G to the graph HWR , a path on three vertices with a loop on each vertex, is maximized by K d+1. This proves a conjecture of Galvin.

We study the problem of Diophantine approximation on lines in $\mathbb{R}^{d}$ under certain primality restrictions.

We study two-weight norm inequalities for a vector-valued operator from a weighted $L^{p}(\unicode[STIX]{x1D70E})$ -space to mixed norm $L_{l^{s}}^{q}(\unicode[STIX]{x1D707})$ spaces, $1<p<\infty$ , $0<q<p$ . We apply these results to the boundedness of Wolff’s potentials.