We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
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.
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.
Let $[t]$ be the integral part of the real number t and let $\mathbb {1}_{{\mathbb P}}$ be the characteristic function of the primes. Denote by $\pi _{\mathcal {S}}(x)$ the number of primes in the floor function set $\mathcal {S}(x) := \{[{x}/{n}] : 1\leqslant n\leqslant x\}$ and by $S_{\mathbb {1}_{{\mathbb P}}}(x)$ the number of primes in the sequence $\{[{x}/{n}]\}_{n\geqslant 1}$. Improving a result of Heyman [‘Primes in floor function sets’, Integers22 (2022), Article no. A59], we show
for $x\to \infty $, where $C_{\mathbb {1}_{{\mathbb P}}} := \sum _{p} {1}/{p(p+1)}$, $c>0$ is a positive constant and $\varepsilon $ is an arbitrarily small positive number.
has appreciably fewer solutions in the subcritical range
$s < \tfrac 12k(k+1)$
than its homogeneous counterpart, provided that
$a_{\ell } \neq 0$
for some
$\ell \leqslant k-1$
. Our methods use Vinogradov’s mean value theorem in combination with a shifting argument.
We consider sums involving the divisor function over nonhomogeneous (
$\beta \neq 0$
) Beatty sequences
$ \mathcal {B}_{\alpha ,\beta }:=\{[\alpha n+\beta ]\}_{n=1}^{\infty } $
and show that
where N is a sufficiently large integer,
$\alpha $
is of finite type
$\tau $
and
$\beta \neq 0$
. Previously, such estimates were only obtained for homogeneous Beatty sequences or for almost all
$\alpha $
.
In this paper, we consider an equivalence relation on the space
$AP(\mathbb {R},X)$
of almost periodic functions with values in a prefixed Banach space X. In this context, it is known that the normality or Bochner-type property, which characterizes these functions, is based on the relative compactness of the family of translates. Now, we prove that every equivalence class is sequentially compact and the family of translates of a function belonging to this subspace is dense in its own class, i.e., the condition of almost periodicity of a function
$f\in AP(\mathbb {R},X)$
yields that every sequence of translates of f has a subsequence that converges to a function equivalent to f. This extends previous work by the same authors on the case of numerical almost periodic functions.
The previous chapters represented a linear time based progression of ideas. This chapter departs from that sequence in several ways. Here we report on the enhancements of Zhang’s work made by Polymath8a which showed Zhang’s original prime gap bound of 70 million could be significantly reduced. They introduced new concepts and optimized over parameter and function spaces, but fell short of Maynard’s bound of 600. Their ideas are valuable – for example Polymath8a’s variations of Bombieri–Vinogradov based on multiple dense divisibility. This generalizes the smoothness requirement of Motohashi, Pintz and Zhang, imposing a weaker parametric condition, multiple dense divisibility, extracting the essence of smoothness.Polymath8a completed their work in an unbelievably short period of time. This chapter is not to be taken lightly and goes into great technical detail. There are major mathematical tools and intricate estimates. A complete proof of the derivation of their bound 14950 is given, including proofs of supporting material in appendices. This is not their best bound of 4680, which relies on results of Deligne and is outside the scope of this book. However, we do give information and references on how readers if necessary might access background material from algebraic geometry for example.
By combining classical techniques together with two novel asymptotic identities derived in recent work by Lenells and one of the authors, we analyse certain single sums of Riemann-zeta type. In addition, we analyse Euler-Zagier double exponential sums for particular values of Re{u} and Re{v} and for a variety of sets of summation, as well as particular cases of Mordell-Tornheim double sums.
The cardinality of the set of $D\leqslant x$ for which the fundamental solution of the Pell equation $t^{2}-Du^{2}=1$ is less than $D^{1/2+\unicode[STIX]{x1D6FC}}$ with $\unicode[STIX]{x1D6FC}\in [\frac{1}{2},1]$ is studied and certain lower bounds are obtained, improving previous results of Fouvry by introducing the $q$-analogue of van der Corput method to algebraic exponential sums with smooth moduli.
We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences, such as the sum of digits in base $q$ modulo $m$, the Rudin–Shapiro sequence, and some generalizations. This gives, for any base, a class of explicit normal numbers that can be efficiently generated.
In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as ‘Birch sums’. Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the distribution of large values of this maximum, that hold in a wide uniform range. This improves a recent result of Kowalski and Sawin. The proofs use a blend of probabilistic methods, harmonic analysis techniques, and deep tools from algebraic geometry. The results can also be generalized to other types of $\ell$-adic trace functions. In particular, the lower bound of our result also holds for partial sums of Kloosterman sums. As an application, we show that there exist $x\in [1,p]$ and $a\in \mathbb{F}_{p}^{\times }$ such that $|\sum _{n\leqslant x}\exp (2\unicode[STIX]{x1D70B}i(n^{3}+an)/p)|\geqslant (2/\unicode[STIX]{x1D70B}+o(1))\sqrt{p}\log \log p$. The uniformity of our results suggests that this bound is optimal, up to the value of the constant.
We establish bounds for triple exponential sums with mixed exponential and linear terms. The method we use is by Shparlinski [‘Bilinear forms with Kloosterman and Gauss sums’, Preprint, 2016, arXiv:1608.06160] together with a bound for the additive energy from Roche-Newton et al. [‘New sum-product type estimates over finite fields’, Adv. Math.293 (2016), 589–605].
Let $b$ be an integer larger than 1. We give an asymptotic formula for the exponential sum
$$\begin{eqnarray}\mathop{\sum }_{\substack{ p\leqslant x \\ g(p)=k}}\exp \big(2\text{i}\unicode[STIX]{x1D70B}\unicode[STIX]{x1D6FD}p\big),\end{eqnarray}$$
where the summation runs over prime numbers $p$ and where $\unicode[STIX]{x1D6FD}\in \mathbb{R}$, $k\in \mathbb{Z}$, and $g:\mathbb{N}\rightarrow \mathbb{Z}$ is a strongly $b$-additive function such that $\operatorname{pgcd}(g(1),\ldots ,g(b-1))=1$.
We investigate exponential sums over those numbers ${\leqslant}x$ all of whose prime factors are ${\leqslant}y$. We prove fairly good minor arc estimates, valid whenever $\log ^{3}x\leqslant y\leqslant x^{1/3}$. Then we prove sharp upper bounds for the $p$th moment of (possibly weighted) sums, for any real $p>2$ and $\log ^{C(p)}x\leqslant y\leqslant x$. Our proof develops an argument of Bourgain, showing that this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$-smooth integers less than $x$ whenever $\log ^{C}x\leqslant y\leqslant x$. Previously this was only known assuming the generalised Riemann hypothesis. Combining them with transference machinery of Green, we prove Roth’s theorem for subsets of the $y$-smooth numbers whenever $\log ^{C}x\leqslant y\leqslant x$. This provides a deterministic set, of size ${\approx}x^{1-c}$, inside which Roth’s theorem holds.
We prove a subconvexity bound for the central value $L(\frac{1}{2},{\it\chi})$ of a Dirichlet $L$-function of a character ${\it\chi}$ to a prime power modulus $q=p^{n}$ of the form $L(\frac{1}{2},{\it\chi})\ll p^{r}q^{{\it\theta}+{\it\epsilon}}$ with a fixed $r$ and ${\it\theta}\approx 0.1645<\frac{1}{6}$, breaking the long-standing Weyl exponent barrier. In fact, we develop a general new theory of estimation of short exponential sums involving $p$-adically analytic phases, which can be naturally seen as a $p$-adic analogue of the method of exponent pairs. This new method is presented in a ready-to-use form and applies to a wide class of well-behaved phases including many that arise from a stationary phase analysis of hyper-Kloosterman and other complete exponential sums.
It is known that $\zeta (1+ it)\ll \mathop{(\log t)}\nolimits ^{2/ 3} $ when $t\gg 1$. This paper provides a new explicit estimate $\vert \zeta (1+ it)\vert \leq \frac{3}{4} \log t$, for $t\geq 3$. This gives the best upper bound on $\vert \zeta (1+ it)\vert $ for $t\leq 1{0}^{2\cdot 1{0}^{5} } $.
We give new bounds on sums of the form ∑ n≤NΛ(n)exp (2πiagn/m) and ∑ n≤NΛ(n)χ(gn+a), where Λ is the von Mangoldt function, m is a natural number, a and g are integers coprime to m, and χ is a multiplicative character modulo m. In particular, our results yield bounds on the sums ∑ p≤Nexp (2πiaMp/m) and ∑ p≤Nχ(Mp) with Mersenne numbers Mp=2p−1, where p is prime.
We investigate the number of integral solutions possessed by a pair of diagonal cubic equations in a large box. Provided that the number of variables in the system is at least fourteen, and in addition the number of variables in any non-trivial linear combination of the underlying forms is at least eight, we obtain an asymptotic formula for the number of integral solutions consistent with the product of local densities associated with the system.
Given a finite field 𝔽p={0,…,p−1} of p elements, where p is a prime, we consider the distribution of elements in the orbits of a transformation ξ↦ψ(ξ) associated with a rational function ψ∈𝔽p(X). We use bounds of exponential sums to show that if N≥p1/2+ε for some fixed ε then no N distinct consecutive elements of such an orbit are contained in any short interval, improving the trivial lower bound N on the length of such intervals. In the case of linear fractional functions we use a different approach, based on some results of additive combinatorics due to Bourgain, that gives a nontrivial lower bound for essentially any admissible value of N.