We study the analogue of the Bombieri–Vinogradov theorem for $\operatorname{SL}_{m}(\mathbb{Z})$ Hecke–Maass form $F(z)$. In particular, for $\operatorname{SL}_{2}(\mathbb{Z})$ holomorphic or Maass Hecke eigenforms, symmetric-square lifts of holomorphic Hecke eigenforms on $\operatorname{SL}_{2}(\mathbb{Z})$, and $\operatorname{SL}_{3}(\mathbb{Z})$ Maass Hecke eigenforms under the Ramanujan conjecture, the levels of distribution are all equal to $1/2,$ which is as strong as the Bombieri–Vinogradov theorem. As an application, we study an automorphic version of Titchmarch’s divisor problem; namely for $a\neq 0,$

$$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}\unicode[STIX]{x1D6EC}(n)\unicode[STIX]{x1D70C}(n)d(n-a)\ll x\log \log x,\end{eqnarray}$$

$\unicode[STIX]{x1D70C}(n)$

$\unicode[STIX]{x1D706}_{f}(n)$

$f$

$\operatorname{SL}_{2}(\mathbb{Z})$

$A_{F}(n,1)$

$F$

$$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}\unicode[STIX]{x1D6EC}(n)\unicode[STIX]{x1D706}_{f}^{2}(n)d(n-a)=E_{1}(a)x\log x+O(x\log \log x),\end{eqnarray}$$

$E_{1}(a)$

$a$

$\unicode[STIX]{x1D70C}(n)d(n-a)$

We prove a lower bound for the large sieve with square moduli.

In this note, we provide refined estimates of two sums involving the Euler totient function,

$$\begin{eqnarray}\mathop{\sum }_{n\leq x}\unicode[STIX]{x1D719}\biggl(\biggl[\frac{x}{n}\biggr]\biggr)\quad \text{and}\quad \mathop{\sum }_{n\leq x}\frac{\unicode[STIX]{x1D719}([x/n])}{[x/n]},\end{eqnarray}$$

$[x]$

$x$

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.

In this note we give a characterization of $\ell ^{p}\times \cdots \times \ell ^{p}\rightarrow \ell ^{q}$ boundedness of maximal operators associated with multilinear convolution averages over spheres in $\mathbb{Z}^{n}$.

We establish Diophantine inequalities for the fractional parts of generalized polynomials, in particular for sequences $\unicode[STIX]{x1D708}(n)=\lfloor n^{c}\rfloor +n^{k}$ with $c>1$ a non-integral real number and $k\in \mathbb{N}$, as well as for $\unicode[STIX]{x1D708}(p)$ where $p$ runs through all prime numbers. This is related to classical work of Heilbronn and to recent results of Bergelson et al.

We generalize the work of Sarnak and Tsimerman to twisted sums of Kloosterman sums and thus give evidence towards the twisted Linnik–Selberg conjecture.

We obtain a non-trivial bound for cancellations between the Kloosterman sums modulo a large prime power with a prime argument running over very short intervals, which in turn is based on a new estimate on bilinear sums of Kloosterman sums. These results are analogues of those obtained by various authors for Kloosterman sums modulo a prime. However, the underlying technique is different and allows us to obtain non-trivial results starting from much shorter ranges.

We study Piatetski-Shapiro sequences $(\lfloor n^{c}\rfloor )_{n}$ modulo $m$, for non-integer $c>1$ and positive $m$, and we are particularly interested in subword occurrences in those sequences. We prove that each block $\in \{0,1\}^{k}$ of length $k<c+1$ occurs as a subword with the frequency $2^{-k}$, while there are always blocks that do not occur. In particular, those sequences are not normal. For $1<c<2$, we estimate the number of subwords from above and below, yielding the fact that our sequences are deterministic and not morphic. Finally, using the Daboussi–Kátai criterion, we prove that the sequence $\lfloor n^{c}\rfloor$ modulo $m$ is asymptotically orthogonal to multiplicative functions bounded by 1 and with mean value 0.

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.

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 study logarithmically averaged binary correlations of bounded multiplicative functions $g_{1}$ and $g_{2}$. A breakthrough on these correlations was made by Tao, who showed that the correlation average is negligibly small whenever $g_{1}$ or $g_{2}$ does not pretend to be any twisted Dirichlet character, in the sense of the pretentious distance for multiplicative functions. We consider a wider class of real-valued multiplicative functions $g_{j}$, namely those that are uniformly distributed in arithmetic progressions to fixed moduli. Under this assumption, we obtain a discorrelation estimate, showing that the correlation of $g_{1}$ and $g_{2}$ is asymptotic to the product of their mean values. We derive several applications, first showing that the numbers of large prime factors of $n$ and $n+1$ are independent of each other with respect to logarithmic density. Secondly, we prove a logarithmic version of the conjecture of Erdős and Pomerance on two consecutive smooth numbers. Thirdly, we show that if $Q$ is cube-free and belongs to the Burgess regime $Q\leqslant x^{4-\unicode[STIX]{x1D700}}$, the logarithmic average around $x$ of the real character $\unicode[STIX]{x1D712}\hspace{0.6em}({\rm mod}\hspace{0.2em}Q)$ over the values of a reducible quadratic polynomial is small.

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].

We prove that for any positive integers $k,n$ with $n>\frac{3}{2}(k^{2}+k+2)$, prime $p$, and integers $c,a_{i}$, with $p\nmid a_{i}$, $1\leqslant i\leqslant n$, there exists a solution $\text{}\underline{x}$ to the congruence

$$\begin{eqnarray}\mathop{\sum }_{i=1}^{n}a_{i}x_{i}^{k}\equiv c\hspace{0.6em}({\rm mod}\hspace{0.2em}p)\end{eqnarray}$$

$1\leqslant {x_{i}\ll }_{k}p^{1/k}$

$1\leqslant i\leqslant n$

$n$

$\unicode[STIX]{x1D700}>0$

$c_{\unicode[STIX]{x1D700}}$

$n>c_{\unicode[STIX]{x1D700}}k$

$1\leqslant {x_{i}\ll }_{\unicode[STIX]{x1D700},k}p^{1/k+\unicode[STIX]{x1D700}}$

We show that integral monodromy groups of Kloosterman $\ell$-adic sheaves of rank $n\geqslant 2$ on $\mathbb{G}_{m}/\mathbb{F}_{q}$ are as large as possible when the characteristic $\ell$ is large enough, depending only on the rank. This variant of Katz’s results over $\mathbb{C}$ was known by works of Gabber, Larsen, Nori and Hall under restrictions such as $\ell$ large enough depending on $\operatorname{char}(\mathbb{F}_{q})$ with an ineffective constant, which is unsuitable for applications. We use the theory of finite groups of Lie type to extend Katz’s ideas, in particular the classification of maximal subgroups of Aschbacher and Kleidman–Liebeck. These results will apply to study hyper-Kloosterman sums and their reductions in forthcoming work.

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.

Let $\Vert \cdots \Vert$ denote distance from the integers. Let $\unicode[STIX]{x1D6FC}$, $\unicode[STIX]{x1D6FD}$, $\unicode[STIX]{x1D6FE}$ be real numbers with $\unicode[STIX]{x1D6FC}$ irrational. We show that the inequality

$$\begin{eqnarray}\Vert \unicode[STIX]{x1D6FC}p^{2}+\unicode[STIX]{x1D6FD}p+\unicode[STIX]{x1D6FE}\Vert <p^{-3/17+\unicode[STIX]{x1D700}}\end{eqnarray}$$

$p$

$\unicode[STIX]{x1D6FC}p$

$\unicode[STIX]{x1D6FD}=0$

We give an asymptotic formula for correlations

$$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}f_{1}(P_{1}(n))f_{2}(P_{2}(n))\cdots f_{m}(P_{m}(n)),\end{eqnarray}$$

$f,\ldots ,f_{m}$

$f:\mathbb{N}\rightarrow \{-1,+1\}$

$1957$

$f(n)=n^{s}$

$\operatorname{Re}(s)<1$

$|f(n)|$

$n=a+b$

$a,b$

$\mathbb{N}$

We study the $1$-level density of low-lying zeros of Dirichlet $L$-functions attached to real primitive characters of conductor at most $X$. Under the generalized Riemann hypothesis, we give an asymptotic expansion of this quantity in descending powers of $\log X$, which is valid when the support of the Fourier transform of the corresponding even test function $\unicode[STIX]{x1D719}$ is contained in $(-2,2)$. We uncover a phase transition when the supremum $\unicode[STIX]{x1D70E}$ of the support of $\widehat{\unicode[STIX]{x1D719}}$ reaches $1$, both in the main term and in the lower order terms. A new lower order term appearing at $\unicode[STIX]{x1D70E}=1$ involves the quantity $\widehat{\unicode[STIX]{x1D719}}(1)$, and is analogous to a lower order term which was isolated by Rudnick in the function field case.

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

$p$

$\unicode[STIX]{x1D6FD}\in \mathbb{R}$

$k\in \mathbb{Z}$

$g:\mathbb{N}\rightarrow \mathbb{Z}$

$b$

$\operatorname{pgcd}(g(1),\ldots ,g(b-1))=1$