The discrepancy function measures the deviation of the empirical distribution of a point set in $[0,1]^{d}$ from the uniform distribution. In this paper, we study the classical discrepancy function with respect to the bounded mean oscillation and exponential Orlicz norms, as well as Sobolev, Besov and Triebel–Lizorkin norms with dominating mixed smoothness. We give sharp bounds for the discrepancy function under such norms with respect to infinite sequences.

Introduced in Schmidt and Summerer [Parametric geometry of numbers and applications. Acta Arith.140 (2009), 67–91], approximation exponents $\text{}\underline{\unicode[STIX]{x1D711}}_{i},\overline{\unicode[STIX]{x1D711}}_{i}$ , $(i=1,2,3)$ , attached to points $\boldsymbol{\unicode[STIX]{x1D709}}=(\unicode[STIX]{x1D709}_{1},\unicode[STIX]{x1D709}_{2})$ in $\mathbb{R}^{2}$ , give information on Diophantine approximation properties of these points. Laurent [Exponents of Diophantine approximation in dimension two. Canad. J. Math.61 (2009), 165–189] had described all possible quadruples $(\text{}\underline{\unicode[STIX]{x1D711}}_{1},\overline{\unicode[STIX]{x1D711}}_{1},\text{}\underline{\unicode[STIX]{x1D711}}_{3},\overline{\unicode[STIX]{x1D711}}_{3})$ arising in this way. Our emphasis here will be on $\text{}\underline{\unicode[STIX]{x1D711}}_{2},\overline{\unicode[STIX]{x1D711}}_{2}$ and the construction of suitable “ $3$ -systems”.

The multiplicative group generated by a certain sequence of rationals is determined, settling a 30-year conjecture.

Recently, an analogue over $\mathbb{F}_{q}[T]$ of Landau’s theorem on sums of two squares was considered by Bary-Soroker, Smilansky and Wolf. They counted the number of monic polynomials in $\mathbb{F}_{q}[T]$ of degree $n$ of the form $A^{2}+TB^{2}$ , which we denote by $B(n,q)$ . They studied $B(n,q)$ in two limits: fixed $n$ and large $q$ ; and fixed $q$ and large $n$ . We generalize their result to the most general limit $q^{n}\rightarrow \infty$ . More precisely, we prove

$$\begin{eqnarray}B(n,q)\sim K_{q}\cdot \binom{n-\frac{1}{2}}{n}\cdot q^{n},\quad q^{n}\rightarrow \infty ,\end{eqnarray}$$

$K_{q}=1+O(1/q)$

The paper is devoted to the study of Fefferman–Stein inequalities for stochastic integrals. If $X$ is a martingale, $Y$ is the stochastic integral, with respect to $X$ , of some predictable process taking values in $[-1,1]$ , then for any weight $W$ belonging to the class $A_{1}$ we have the estimates $\Vert Y_{\infty }\Vert _{L^{p}(W)}\leqslant 8pp^{\prime }[W]_{A_{1}}\Vert X_{\infty }\Vert _{L^{p}(W)},$ $1<p<\infty ,$ and $\Vert Y_{\infty }\Vert _{L^{1,\infty }(W)}\leqslant c[W]_{A_{1}}(1+\log [W]_{A_{1}})\Vert X_{\infty }\Vert _{L^{1}(W)}.$ The proofs rest on the Bellman function method: the inequalities are deduced from the existence of certain special functions, enjoying appropriate majorization and concavity. As an application, related statements for Haar multipliers are indicated. The above estimates can be regarded as probabilistic counterparts of the recent results of Lerner, Ombrosi and Pérez concerning singular integral operators.

We prove that if $k$ and $\ell$ are sufficiently large, then all the zeros of the weight $k+\ell$ cusp form $E_{k}(z)E_{\ell }(z)-E_{k+\ell }(z)$ in the standard fundamental domain lie on the boundary. We, moreover, find formulas for the number of zeros on the bottom arc with $|z|=1$ , and those on the sides with $Re(z)=\pm 1/2$ . One important ingredient of the proof is an approximation of the Eisenstein series in terms of the Jacobi theta function.

Let $E$ be a finite-dimensional normed space and $\unicode[STIX]{x1D6FA}$ a non-empty convex open set in $E$ . We show that the Lipschitz-free space of $\unicode[STIX]{x1D6FA}$ is canonically isometric to the quotient of $L^{1}(\unicode[STIX]{x1D6FA},E)$ by the subspace consisting of vector fields with zero divergence in the sense of distributions on $E$ .

We obtain explicit inversion formulas for the Radon-like transform that assigns to a function on the unit sphere the integrals of that function over hemispheres lying in lower-dimensional central cross-sections. The results are applied to the determination of star bodies from the volumes of their central half-sections.

We consider the minimization of Dirichlet eigenvalues $\unicode[STIX]{x1D706}_{k}$ , $k\in \mathbb{N}$ , of the Laplacian on cuboids of unit measure in $\mathbb{R}^{3}$ . We prove that any sequence of optimal cuboids in $\mathbb{R}^{3}$ converges to a cube of unit measure in the sense of Hausdorff as $k\rightarrow \infty$ . We also obtain an upper bound for that rate of convergence.

We prove bounds for the truncated directional Hilbert transform in $L^{p}(\mathbb{R}^{2})$ for any $1<p<\infty$ under a combination of a Lipschitz assumption and a lacunarity assumption. It is known that a lacunarity assumption alone is not sufficient to yield boundedness for $p=2$ , and it is a major question in the field whether a Lipschitz assumption alone suffices, at least for some $p$ .

We investigate the number of 4-edge paths in graphs with a given number of vertices and edges, proving an asymptotically sharp upper bound on this number. The extremal construction is the quasi-star or the quasi-clique graph, depending on the edge density. An easy lower bound is also proved. This answer resembles the classic theorem of Ahlswede and Katona about the maximal number of 2-edge paths, and a recent theorem of Kenyon, Radin, Ren and Sadun about k-edge stars.

We apply multigrade efficient congruencing to estimate Vinogradov’s integral of degree $k$ for moments of order $2s$ , establishing strongly diagonal behaviour for $1\leqslant s\leqslant \frac{1}{2}k(k+1)-\frac{1}{3}k+o(k)$ . In particular, as $k\rightarrow \infty$ , we confirm the main conjecture in Vinogradov’s mean value theorem for a proportion asymptotically approaching $100\%$ of the critical interval $1\leqslant s\leqslant \frac{1}{2}k(k+1)$ .

We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique $3$ -sphere with the parameters $(f_{0},f_{1},f_{2},f_{3};f_{02})=(12,40,40,12;120)$ , but this sphere is not realizable by a convex $4$ -polytope. The $3$ -sphere, which is $2$ -simple and $2$ -simplicial, was found by Werner [Linear constraints on face numbers of polytopes. PhD Thesis, TU Berlin, Germany, 2009]; we present results of a computer enumeration which imply that the sphere with these parameters is unique. We prove that it is non-polytopal in two ways: first, we show that it has no oriented matroid, and thus it is not realizable; this proof was found by computer, but can be verified by hand. The second proof is again a computer-based oriented matroid proof and shows that for exactly one of the facets this sphere does not even have a diagram based on this facet. Using the non-polytopality, we finally prove that the sphere is not even embeddable as a polytopal complex.

A graph G is H-saturated if it contains no copy of H as a subgraph but the addition of any new edge to G creates a copy of H. In this paper we are interested in the function satt (n,p), defined to be the minimum number of edges that a Kp -saturated graph on n vertices can have if it has minimum degree at least t. We prove that satt (n,p) = tn − O(1), where the limit is taken as n tends to infinity. This confirms a conjecture of Bollobás when p = 3. We also present constructions for graphs that give new upper bounds for satt (n,p).

We provide new quantitative versions of Helly’s theorem. For example, we show that for every family $\{P_{i}:i\in I\}$ of closed half-spaces in $\mathbb{R}^{n}$ such that $P=\bigcap _{i\in I}P_{i}$ has positive volume, there exist $s\leqslant \unicode[STIX]{x1D6FC}n$ and $i_{1},\ldots ,i_{s}\in I$ such that

$$\begin{eqnarray}\operatorname{vol}_{n}(P_{i_{1}}\cap \cdots \cap P_{i_{s}})\leqslant (Cn)^{n}\operatorname{vol}_{n}(P),\end{eqnarray}$$

$\unicode[STIX]{x1D6FC},C>0$

Let ℱ be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning ℱ-free subgraph of G with large minimum degree. This problem is well understood if ℱ does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs. To prove these results, we study a locally injective analogue of the question.