Skip to content
Preprint

On the hyperbolic prime number theorem

Sep 2026 · 0 citations · 10 references
Mathematics

Abstract

Friedlander and Iwaniec proved that the number of points of the orbit $\{\gamma i \colon \gamma\in\SL_2(\Z)\}$ lying at a distance $p-2$ from the origin $i$ of the upper half-plane, with $p\le x$ prime, is of order $x/\log x$; the upper bound is unconditional, while the lower one rests on a strong hypothesis concerning the distribution of primes in arithmetic progressions. We consider instead square-free distances and prove unconditionally an asymptotic formula, whose main term is of order $x$. Employing the weighted linear sieve, we also show unconditionally that the square-free distances $n$ with at most $7$ prime factors contribute $\gg x/\log x$. Finally, assuming that the sequence $r(n-2)r(n+2)$ has level of distribution $x^{\theta}$ in arithmetic progressions, where $r(n)$ is the number of ways to write $n$ as a sum of two squares, we obtain the same lower bound for the distances with at most $N$ prime factors (the value $7$ corresponds to $\theta=1/6$).

View source

Similar papers

Preprint Oct 2026

Square-root logarithmic bounds for the arithmetic complexity of factorial multiples

Assume that the Riemann zeta function has no zeros in $\Re(s)>1-\delta$, $s\neq1$, for some fixed $0<\delta\leq1/2$. We prove that, for every sufficiently large integer $k$, a positive multiple $m_k k!$ has arithmetic complexity $\tau(m_k k!)\leq\exp(C\sqrt{\log k\log\log k})$, where $C$ depends only on $\delta$. We fi...

Liang Zhang · 1 citation
Preprint Oct 2026

Metric Diophantine approximation with primes on irrational lines

Let $c>1$ be irrational. We prove that, for almost every $x>0$ and every $\varepsilon>0$, there are infinitely many triples $(p,r,s)$, with $p$ and $r$ prime and $s$ an integer, for which \[ 0<px-r<p^{-1/3+\varepsilon},\qquad 0<pcx-s<p^{-1/3+\varepsilon}. \] This improves the exponent $1/5$ in the homogeneous-line case...

Zi-Rui Jiang · 0 citations
Preprint Oct 2026

On the Hardy--Littlewood--Chowla conjecture

An old conjecture dating back at least to Hildebrand's work in 1989, asserts that the M\"obius function exhibits cancellation on shifted primes; that is, $$\sum_{p\le x}\mu(p+2)=o(\pi(x)),\quad \text{or equivalently}\quad \sum_{n\le x}\Lambda(n)\mu(n+2)=o(x).$$ This is also a well-known model case for the parity proble...

Guang-Shi Lu, Zhi-Wei Wang, Jie Wu · 3 citations · ⚡2
Preprint Oct 2026

Strichartz estimates on two-dimensional irrational tori

We prove an $L^4$ Strichartz estimate for the dispersion $n_1^2+\alpha n_2^2$ on $\mathbb T^2$, for every $\alpha>0$. The loss is controlled by the Shannon entropy of the normalized squared Fourier coefficients and the cardinality of their support $S$. In particular, we obtain a norm loss of $(\log\#S)^{1/2}$ on fixed...

Ming Wang, Yuan Xiong · 0 citations
Sep 2026

Proof of the Kahn Saks Conjecture

Let $\mathbb{P}(x\prec y)$ be the probability that $x$ precedes $y$ in a uniformly random linear extension of an $n$-element poset $P$, and define the balancing coefficient to be $\delta(x,y)=\min(\mathbb{P}(x\prec y),\mathbb{P}(y\prec x))$ with $\delta(P)=\max_{x,y}\delta(x,y)$. We prove (Theorem 1) that sufficiently...

Max Aires · 1 citation
Preprint Sep 2026

On a Tur\'an's theorem for small primes

Denote by $\omega(n)$ the number of distinct prime divisors of the natural number $n$. In 2007, Granville and Soundararajan gave a quite new method to compute the higher moments $\sum_{n\leq x}(\omega(n)-\log\log x)^{k}$, for a wide range of integers $k\geq 2$. In this notes, we shall apply the method for $\omega_{z}(n...

T. Minamide, Haruka Sakai, Y. Tanigawa · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.