On the hyperbolic prime number theorem

Source abstract

Friedlander and Iwaniec proved that the number of points of the orbit $\{γi \colon γ\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^θ$ 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 $θ=1/6$).