SearcharxivSearch

arXiv subjects

Reginald M. Simpson

Publications and source records attributed to Reginald M. Simpson.

2 recordsLinked to original sources

Correlations of error terms for weighted prime counting functions

Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) = \sum_{p\le x} \frac1p$ and $\pi_\ell(x) = \sum_{p\le x} \log(1-\frac1p)^{-1}$, that were studied by Mertens. These limiting distributions are all identical, but passing to the limit loses information about how these error terms are correlated with one another. In this paper, we examine these correlations, showing, for example, that persistent inequalities between certain pairs of normalized error terms are equivalent to the Riemann hypothesis (RH). Assuming both RH and LI, the linear independence of the positive imaginary parts of the zeros of $\zeta(s)$, we calculate the logarithmic densities of the set of real numbers for which two different error terms have prescribed signs. For example, we conditionally show that $\psi(x) - x$ and $\sum_{n\le x} \frac{\Lambda(n)}n - (\log x - C_0)$ have the same sign on a set of logarithmic density $\approx 0.9865$.

math.NT

The universal profile of the invariant factors of $({\mathbb Z}/n{\mathbb Z})^\times$

The structure of the multiplicative group $M_n = ({\mathbb Z}/n{\mathbb Z})^\times$ encodes a great deal of arithmetic information about the integer $n$ (examples include $\phi(n)$, the Carmichael function $\lambda(n)$, and the number $\omega(n)$ of distinct prime factors of $n$). We examine the invariant factor structure of $M_n$ for typical integers $n$, that is, the decomposition $M_n \cong {\mathbb Z}/d_1{\mathbb Z} \times {\mathbb Z}/d_2{\mathbb Z} \times \cdots \times {\mathbb Z}/d_k{\mathbb Z}$ where $d_1\mid d_2\mid\cdots\mid d_k$. We show that almost all integers have asymptotically the same invariant factors for all but the largest factors; for example, asymptotically $1/2$ of the invariant factors equal ${\mathbb Z}/2{\mathbb Z}$, asymptotically $1/4$ of them equal ${\mathbb Z}/12{\mathbb Z}$, asymptotically $1/12$ of them equal ${\mathbb Z}/120{\mathbb Z}$, and so on. Furthermore, for positive integers $k$, we establish a theorem of Erd\H{o}s-Kac type for the number of invariant factors of $M_n$ that equal ${\mathbb Z}/k{\mathbb Z}$, except that the distribution is not a normal distribution but rather a skew-normal or related distribution.

math.NT