Let $\unicode[STIX]{x1D6E4}\subseteq \operatorname{PSL}(2,\mathbf{R})$ be a finite-volume Fuchsian group. The hyperbolic circle problem is the estimation of the number of elements of the $\unicode[STIX]{x1D6E4}$ -orbit of $z$ in a hyperbolic circle around $w$ of radius $R$ , where $z$ and $w$ are given points of the upper half plane and $R$ is a large number. An estimate with error term $\text{e}^{(2/3)R}$ is known, and this has not been improved for any group. Recently, Risager and Petridis proved that in the special case $\unicode[STIX]{x1D6E4}=\operatorname{PSL}(2,\mathbf{Z})$ taking $z=w$ and averaging over $z$ in a certain way the error term can be improved to $\text{e}^{(7/12+\unicode[STIX]{x1D716})R}$ . Here we show such an improvement for a general $\unicode[STIX]{x1D6E4}$ ; our error term is $\text{e}^{(5/8+\unicode[STIX]{x1D716})R}$ (which is better than $\text{e}^{(2/3)R}$ but weaker than the estimate of Risager and Petridis in the case $\unicode[STIX]{x1D6E4}=\operatorname{PSL}(2,\mathbf{Z})$ ). Our main tool is our generalization of the Selberg trace formula proved earlier.

We prove an exact formula for the second moment of Rankin–Selberg $L$-functions $L(\frac{1}{2},f\times g)$ twisted by $\unicode[STIX]{x1D706}_{f}(p)$, where $g$ is a fixed holomorphic cusp form and $f$ is summed over automorphic forms of a given level $q$. The formula is a reciprocity relation that exchanges the twist parameter $p$ and the level $q$. The method involves the Bruggeman–Kuznetsov trace formula on both ends; finally the reciprocity relation is established by an identity of sums of Kloosterman sums.

Let $\unicode[STIX]{x1D713}:\mathbb{R}_{+}\rightarrow \mathbb{R}_{+}$ be a non-increasing function. A real number $x$ is said to be $\unicode[STIX]{x1D713}$ -Dirichlet improvable if it admits an improvement to Dirichlet’s theorem in the following sense: the system

$$\begin{eqnarray}|qx-p|<\unicode[STIX]{x1D713}(t)\quad \text{and}\quad |q|<t\end{eqnarray}$$

$t$

$D(\unicode[STIX]{x1D713})$

$D(\unicode[STIX]{x1D713})^{c}$

$\unicode[STIX]{x1D713}$

We prove asymptotic formulas for the number of integers at most $x$ that can be written as the product of $k~({\geqslant}2)$ distinct primes $p_{1}\cdots p_{k}$ with each prime factor in an arithmetic progression $p_{j}\equiv a_{j}\hspace{0.2em}{\rm mod}\hspace{0.2em}q$ , $(a_{j},q)=1$   $(q\geqslant 3,1\leqslant j\leqslant k)$ . For any $A>0$ , our result is uniform for $2\leqslant k\leqslant A\log \log x$ . Moreover, we show that there are large biases toward certain arithmetic progressions $(a_{1}\hspace{0.2em}{\rm mod}\hspace{0.2em}q,\ldots ,a_{k}\hspace{0.2em}{\rm mod}\hspace{0.2em}q)$ , and such biases have connections with Mertens’ theorem and the least prime in arithmetic progressions.

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

Let $s(\cdot )$ denote the sum-of-proper-divisors function, that is, $s(n)=\sum _{d\mid n,~d<n}d$ . Erdős, Granville, Pomerance, and Spiro conjectured that for any set $\mathscr{A}$ of asymptotic density zero, the preimage set $s^{-1}(\mathscr{A})$ also has density zero. We prove a weak form of this conjecture: if $\unicode[STIX]{x1D716}(x)$ is any function tending to $0$ as $x\rightarrow \infty$ , and $\mathscr{A}$ is a set of integers of cardinality at most $x^{1/2+\unicode[STIX]{x1D716}(x)}$ , then the number of integers $n\leqslant x$ with $s(n)\in \mathscr{A}$ is $o(x)$ , as $x\rightarrow \infty$ . In particular, the EGPS conjecture holds for infinite sets with counting function $O(x^{1/2+\unicode[STIX]{x1D716}(x)})$ . We also disprove a hypothesis from the same paper of EGPS by showing that for any positive numbers $\unicode[STIX]{x1D6FC}$ and $\unicode[STIX]{x1D716}$ , there are integers $n$ with arbitrarily many $s$ -preimages lying between $\unicode[STIX]{x1D6FC}(1-\unicode[STIX]{x1D716})n$ and $\unicode[STIX]{x1D6FC}(1+\unicode[STIX]{x1D716})n$ . Finally, we make some remarks on solutions $n$ to congruences of the form $\unicode[STIX]{x1D70E}(n)\equiv a~(\text{mod}~n)$ , proposing a modification of a conjecture appearing in recent work of the first two authors. We also improve a previous upper bound for the number of solutions $n\leqslant x$ , making it uniform in $a$ .

We first show that every algebraic torus over any field, not necessarily split, can be realized as the special fiber of a semi-abelian scheme whose generic fiber is an absolutely simple abelian variety. Then we investigate which algebraic tori can be thus obtained, when we require the generic fiber of the semi-abelian scheme to carry non-trivial endomorphism structures.

We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$ , $(x,0)$ , and $(0,y)$ and fixed area, which one encloses the most lattice points from $\mathbb{Z}_{{>}0}^{2}$ ? Moreover, does its shape necessarily converge to the isosceles triangle $(x=y)$ as the area becomes large? Laugesen and Liu suggested that, in contrast to similar problems, there might not be a limiting shape. We prove that the limiting set is indeed non-trivial and contains infinitely many elements. We also show that there exist “bad” areas where no triangle is particularly good at capturing lattice points and show that there exists an infinite set of slopes $y/x$ such that any associated triangle captures more lattice points than any other fixed triangle for infinitely many (and arbitrarily large) areas; this set of slopes is a fractal subset of $[1/3,3]$ and has Minkowski dimension of at most $3/4$ .

For a positive integer $n$ let

$$\begin{eqnarray}\mathfrak{P}_{n}=\mathop{\prod }_{\substack{ p \\ s_{p}(n)\geqslant p}}p,\end{eqnarray}$$

$p$

$s_{p}(n)$

$p$

$n$

$n$

$\mathfrak{P}_{n}$

$\mathfrak{P}_{n}$

$\sqrt{n}$

$n^{20/37}$

$\sqrt{n}$

$\unicode[STIX]{x1D705}\sqrt{n}/\text{log}\,n$

$\unicode[STIX]{x1D705}$

$\unicode[STIX]{x1D705}=2$

$\mathfrak{P}_{n}$

$\mathfrak{P}_{n+1}$

$\mathfrak{P}_{n}$

$n$

$\mathfrak{P}_{n}>\mathfrak{P}_{n+1}$

We study the minimal gap statistic for fractional parts of sequences of the form ${\mathcal{A}}^{\unicode[STIX]{x1D6FC}}=\{\unicode[STIX]{x1D6FC}a(n)\}$, where ${\mathcal{A}}=\{a(n)\}$ is a sequence of distinct integers. Assuming that the additive energy of the sequence is close to its minimal possible value, we show that for almost all $\unicode[STIX]{x1D6FC}$, the minimal gap $\unicode[STIX]{x1D6FF}_{\min }^{\unicode[STIX]{x1D6FC}}(N)=\min \{\unicode[STIX]{x1D6FC}a(m)-\unicode[STIX]{x1D6FC}a(n)\hspace{0.2em}{\rm mod}\hspace{0.2em}1:1\leqslant m\neq n\leqslant N\}$ is close to that of a random sequence.

While the distribution of the non-trivial zeros of the Riemann zeta function constitutes a central theme in Mathematics, nothing is known about the algebraic nature of these non-trivial zeros. In this article, we study the transcendental nature of sums of the form

$$\begin{eqnarray}\mathop{\sum }_{\unicode[STIX]{x1D70C}}R(\unicode[STIX]{x1D70C})x^{\unicode[STIX]{x1D70C}},\end{eqnarray}$$

$\unicode[STIX]{x1D70C}$

$\unicode[STIX]{x1D701}(s)$

$R(x)\in \overline{\mathbb{Q}}(x)$

$x>0$

$$\begin{eqnarray}f(x)=\mathop{\sum }_{\unicode[STIX]{x1D70C}}\frac{x^{\unicode[STIX]{x1D70C}}}{\unicode[STIX]{x1D70C}}\end{eqnarray}$$

$(1,\infty )$

$f(x)$

$x<1$

$x>1$

$x<1$

$d\geqslant 1$

$f(\unicode[STIX]{x1D70B}\sqrt{d}x)$

$(0,1/\unicode[STIX]{x1D70B}\sqrt{d})$

$$\begin{eqnarray}L^{\prime }(1,\unicode[STIX]{x1D712}_{-d})\neq 0,\end{eqnarray}$$

$\unicode[STIX]{x1D712}_{-d}$

$K:=\mathbb{Q}(\sqrt{-d})$

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 generalize Skriganov’s notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such as aligned boxes. Our result improves on Skriganov’s celebrated counting result if the box is sufficiently distorted, the lattice is not admissible, and, e.g., symplectic or orthogonal. We establish a criterion under which our error term is sharp, and we provide examples in dimensions $2$ and $3$ using continued fractions. We also establish a similar counting result for primitive lattice points, and apply the latter to the classical problem of Diophantine approximation with primitive points as studied by Chalk, Erdős, and others. Finally, we use o-minimality to describe large classes of sets to which our counting results apply.

It has been known since Vinogradov that, for irrational $\unicode[STIX]{x1D6FC}$ , the sequence of fractional parts $\{\unicode[STIX]{x1D6FC}p\}$ is equidistributed in $\mathbb{R}/\mathbb{Z}$ as $p$ ranges over primes. There is a natural second-order equidistribution property, a pair correlation of such fractional parts, which has recently received renewed interest, in particular regarding its relation to additive combinatorics. In this paper we show that the primes do not enjoy this stronger equidistribution property.

We investigate the approximation of quadratic Dirichlet $L$ -functions over function fields by truncations of their Euler products. We first establish representations for such $L$ -functions as products over prime polynomials times products over their zeros. This is the hybrid formula in function fields. We then prove that partial Euler products are good approximations of an $L$ -function away from its zeros and that, when the length of the product tends to infinity, we recover the original $L$ -function. We also obtain explicit expressions for the arguments of quadratic Dirichlet $L$ -functions over function fields and for the arguments of their partial Euler products. In the second part of the paper we construct, for each quadratic Dirichlet $L$ -function over a function field, an auxiliary function based on the approximate functional equation that equals the $L$ -function on the critical line. We also construct a parametrized family of approximations of these auxiliary functions and prove that the Riemann hypothesis holds for them and that their zeros are related to those of the associated $L$ -function. Finally, we estimate the counting function for the zeros of this family of approximations, show that these zeros cluster near those of the associated $L$ -function, and that, when the parameter is not too large, almost all the zeros of the approximations are simple.

Let $A$ be a set of natural numbers. Recent work has suggested a strong link between the additive energy of $A$ (the number of solutions to $a_{1}+a_{2}=a_{3}+a_{4}$ with $a_{i}\in A$) and the metric Poissonian property, which is a fine-scale equidistribution property for dilates of $A$ modulo $1$. There appears to be reasonable evidence to speculate a sharp Khinchin-type threshold, that is, to speculate that the metric Poissonian property should be completely determined by whether or not a certain sum of additive energies is convergent or divergent. In this article, we primarily address the convergence theory, in other words the extent to which having a low additive energy forces a set to be metric Poissonian.

We study the Goldbach problem for primes represented by the polynomial $x^{2}+y^{2}+1$ . The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even integers $n$ satisfying certain necessary local conditions are representable as the sum of two primes of the form $x^{2}+y^{2}+1$ . This improves a result of Matomäki, which tells us that almost all even $n$ satisfying a local condition are the sum of one prime of the form $x^{2}+y^{2}+1$ and one generic prime. We also solve the analogous ternary Goldbach problem, stating that every large odd $n$ is the sum of three primes represented by our polynomial. As a byproduct of the proof, we show that the primes of the form $x^{2}+y^{2}+1$ contain infinitely many three-term arithmetic progressions, and that the numbers $\unicode[STIX]{x1D6FC}p~(\text{mod}~1)$ , with $\unicode[STIX]{x1D6FC}$ irrational and $p$ running through primes of the form $x^{2}+y^{2}+1$ , are distributed rather uniformly.

Let $P^{+}(n)$ denote the largest prime factor of the integer $n$ and $P_{y}^{+}(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$ . In this paper, first we show that the triple consecutive integers with the two patterns $P^{+}(n-1)>P^{+}(n)<P^{+}(n+1)$ and $P^{+}(n-1)<P^{+}(n)>P^{+}(n+1)$ have a positive proportion respectively. More generally, with the same methods we can prove that for any$J\in \mathbb{Z}$ , $J\geqslant 3$ , the $J$ -tuple consecutive integers with the two patterns $P^{+}(n+j_{0})=\min _{0\leqslant j\leqslant J-1}P^{+}(n+j)$ and $P^{+}(n+j_{0})=\max _{0\leqslant j\leqslant J-1}P^{+}(n+j)$ also have a positive proportion, respectively. Second, for $y=x^{\unicode[STIX]{x1D703}}$ with $0<\unicode[STIX]{x1D703}\leqslant 1$ we show that there exists a positive proportion of integers $n$ such that $P_{y}^{+}(n)<P_{y}^{+}(n+1)$ . Specifically, we can prove that the proportion of integers $n$ such that $P^{+}(n)<P^{+}(n+1)$ is larger than 0.1356, which improves the previous result “0.1063” of the author.

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$