Discrepancies in the distribution of Gaussian primes
Lucile Devin
备注：
29 pages, 4 figures, new version after referee's suggestions : changes in the presentation of section 4, appendix added to present pari/gp codes to check for the vanishing at the central point
Motivated by questions of Fouvry and Rudnick on the distribution of Gaussian primes, we develop a very general setting in which one can study inequities in the distribution of analogues of primes through analytic properties of infinitely many $L$-functions. In particular, we give a heuristic argument for the following claim : for more than half of the prime numbers that can be written as a sum of two square, the odd square is the square of a positive integer congruent to $1 \bmod 4$.
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime number theory, their generalizations, and an extensive list of references on both historical and current progresses.
We study the problem of writing Gaussian primes as the sum of two squares, both of which are interesting arithmetically, in particular, when one is the square of a prime and the other the square of an almost-prime.
We generalize a Theorem of Ricci and count Gaussian primes $\mathfrak{p}$ with short interval restrictions on both the norm and the argument of $\mathfrak{p}$.
We study Gaussian primes lying in narrow sectors, and show that almost all such sectors contain the expected number of primes, if the sectors are not too narrow.
We investigate the distribution of $pθ$ modulo 1, where $θ$ is a complex number which is not contained in $\mathbb{Q}(i)$, and $p$ runs over the Gaussian primes.
It has been observed many times, both in the Monthly and elsewhere, that the set of all quotients of prime numbers is dense in the positive real numbers. In this short note we answer the related question: "Is the set of all quotients of Gaussian primes dense in the complex plane?"
We study the problem of Diophantine approximation on lines in $\mathbb{C}^2$ with numerators and denominators restricted to Gaussian primes. To this end, we develop analogs of well-known results on small fractional parts of $pγ$, $p$ running over the primes and $γ$ being a fixed irrational, for Gaussian primes.
In this paper we study Gaussian ring $\Z[i]$ with a focus on representing Gaussian Mersenne primes $G_p$ in the form $x^2+7y^2$. Interestingly when such a form exists, one can observe that, $x\equiv \pm 1\pmod{8}$ and $y\equiv 0\pmod{8}$. To prove this property of Gaussian Mersenne primes, we show that Gaussian Mersenne primes splits completely in the cyclic quartic unramified extension of $\Q(\sqrt{-14})$ and have a trivial Artin symbol in this extension. We generalize this result for $d\equiv 7\pmod{24}$. We also attempt to give an alternate proof using Artin's reciprocity law, which was ear…
We study the first and second mollified moments of central values of a quadratic family of Hecke $L$-functions of prime moduli to show that more than nine percent of the members of this family do not vanish at the central values.
We prove a version of the Bombieri--Vinogradov Theorem with certain products of Gaussian primes as moduli, making use of their special form as polynomial expressions in several variables. Adapting Vaughan's proof of the classical Bombieri--Vinogadov Theorem to this setting, we apply the polynomial large sieve inequality that has been recently proved and which includes recent progress in Vinogradov's mean value theorem due to Parsell et al. From the benefit of these improvements, we obtain an extended range for the variables compared to the range obtained from standard arguments only.
One aspect of Chebyshev's bias is the phenomenon that a prime number, $ q $, modulo another prime number, $ p$, experimentally seems to be slightly more likely to be a nonquadratic residue than a quadratic residue. We thought it would be interesting to model this residue bias as a "random" walk using Legendre symbol values as steps. Such a model would allow us to easily visualize the bias. In addition, we would be able to extend our model to other number fields. In this report, we first outline underlying theory and some motivations for our research. In the second section, we present our findi…
We derive a refined conjecture for the variance of Gaussian primes across sectors, with a power saving error term, by applying the L-functions Ratios Conjecture. We observe a bifurcation point in the main term, consistent with the Random Matrix Theory (RMT) heuristic previously proposed by Rudnick and Waxman. Our model also identifies a second bifurcation point, undetected by the RMT model, that emerges upon taking into account lower order terms. For sufficiently small sectors, we moreover prove an unconditional result that is consistent with our conjecture down to lower order terms.
Fermat showed that every prime p = 1 mod 4 is a sum of two squares: $p = a^2 + b^2$. To any of the 8 possible representations (a,b) we associate an angle whose tangent is the ratio b/a. In 1919 Hecke showed that these angles are uniformly distributed as p varies, and in the 1950's Kubilius proved uniform distribution in somewhat short arcs. We study fine scale statistics of these angles, in particular the variance of the number of such angles in a short arc. We present a conjecture for this variance, motivated both by a random matrix model, and by a function field analogue of this problem, for…
An interesting question, known as the Gaussian moat problem, asks whether it is possible to walk to infinity on Gaussian primes with steps of bounded length. Our work examines a similar situation in the real quadratic integer ring $\mathbb{Z}[\sqrt{2}]$ whose primes cluster near the asymptotes $y = \pm x/\sqrt{2}$ as compared to Gaussian primes, which cluster near the origin. We construct a probabilistic model of primes in $\mathbb{Z}[\sqrt{2}]$ by applying the prime number theorem and a combinatorial theorem for counting the number of lattice points whose absolute values of their norms are at…
We formulate Goldbach type questions for Gaussian, Hurwitz, Octavian and Eisenstein primes. They are different from Goldbach type statements by Takayoshi Mitsui from 1960 for number fields or C.A. Holben and James Jordan from 1968 for Gaussian integers. Here is what we meeasure: 1) Every even Gaussian integer a+ib satisfying a>2, b>2 is a sum of two Gaussian primes with positive coefficients. 2) Every Eisenstein integer a+bw with a>3,b>3 and w=(1+sqrt(-3))/2 is the sum of two Eisenstein primes with positive coefficients. Note that no evenness condition is asked in the Eisenstein case. 3) Every…
Negative correlations in the distribution of prime numbers are found to display a scale invariance. This occurs in conjunction with a nonstationary behavior. We compare the prime number series to a type of fractional Brownian motion which incorporates both the scale invariance and the nonstationary behavior. Interesting discrepancies remain. The scale invariance also appears to imply the Riemann hypothesis and we study the use of the former as a test of the latter.
Romanov proved that a positive proportion of the integers have a representation as a sum of a prime and a power of an arbitrary fixed positive integer. Rieger proved the analogous result for number fields. We will determine an explicit lower bound for the proportion of algebraic integers in a given number field, which are sums of a power of a fixed non-unit and a prime. Furthermore, we give an improved lower bound for the lower density of Gaussian integers that have a representation as a sum of a Gaussian prime and a power of $1+i$. Finally, similar to Erdős, we construct an explicit arithmeti…
Let $e \geq 2$ be an integer, $p^r$ be a prime power with $p^r \equiv 1\ ({\rm mod}\ e)$ and $η_r(i)$ be Gaussian periods of degree $e$ for ${\mathbb F}_{p^r}$. By the dual form of Davenport and Hasse's lifting theorem on Gauss sums, we establish lifts of the multiplication matrices of the Gaussian periods $η_r(0),\ldots,η_r(e-1)$ which are defined by F. Thaine. We also give some examples of the explicit lifts for prime degree $e$ with $3\leq e\leq 23$ which also illustrate relations among lifts of Jacobi sums, Gaussian periods and multiplication matrices of Gaussian periods.
We experiment with some topics in elementary number theory. For matrices defined by Gaussian primes we observe a circular spectral law for the eigenvalues. We look at matrices defined by Gaussian primes and look at the growth of the determinant, trace. We experiment with various Goldbach conjectures for Gaussian primes, Eisenstein primes, Hurwitz primes or Octavian primes. These conjectures relate with Landau or Bunyakovsky or Andrica type conjectures for rational primes. We also look at some graphs finite simple defined by primes. Finally we look at some spectra of almost periodic pseudo rand…
We prove mod-Gaussian convergence for a Dirichlet polynomial which approximates $\operatorname{Im}\logζ(1/2+it)$. This Dirichlet polynomial is sufficiently long to deduce Selberg's central limit theorem with an explicit error term. Moreover, assuming the Riemann hypothesis, we apply the theory of the Riemann zeta-function to extend this mod-Gaussian convergence to the complex plane. From this we obtain that $\operatorname{Im}\logζ(1/2+it)$ satisfies a large deviation principle on the critical line. Results about the moments of the Riemann zeta-function follow.
We provide formulas for traces of p-th Hecke operators in level 1 in terms of values of finite field 2F1-hypergeometric functions, extending previous work of the author to all odd primes p, instead of only those p=1 (mod 12). We first give a general level 1 trace formula in terms of the trace of Frobenius on a family of elliptic curves, and then we draw on recent work of Lennon to produce level 1 trace formulas in terms of hypergeometric functions for all primes p >3.
We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely many sets $\{a+rv_0,...,a+rv_{k-1}\}$, with $a \in \Z[i]$ and $r \in \Z \backslash \{0\}$, all of whose elements are Gaussian primes. The proof is modeled on a recent paper by Green and Tao and requires three ingredients. The first is a hypergraph removal lemma of Gowers and Rödl-Skokan; this hypergraph removal lemma can be thought of as a generalization of the…
Corentin Perret-Gentil proved, under some very general conditions, that short sums of $\ell$-adic trace functions over finite fields of varying center converges in law to a Gaussian random variable or vector. The main inputs are P.~Deligne's equidistribution theorem, N.~Katz' works and the results surveyed in \cite{MR3338119}. In particular, this applies to $2$-dimensional Kloosterman sums $\mathsf{Kl}_{2,\mathbb{F}_q}$ studied by N.~Katz in \cite{MR955052} and in \cite{MR1081536} when the field $\mathbb{F}_q$ gets large. \par This article considers the case of short sums of normalized classic…
{\em The Liouville number}, denoted $l$, is defined by $$l:=0.100101011101101111100...,$$ where the $n$th bit is given by ${1/2}(1+\gl(n))$; here $\gl$ is the Liouville function for the parity of prime divisors of $n$. Presumably the Liouville number is transcendental, though at present, a proof is unattainable. Similarly, define {\em the Gaussian Liouville number} by $$γ:=0.110110011100100111011...$$ where the $n$th bit reflects the parity of the number of rational Gaussian primes dividing $n$, 1 for even and 0 for odd. In this paper, we prove that the Gaussian Liouville number and its relati…
Let $\{p_j(n)\}_{j=1}^{ω(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform convergence, with almost optimal effective estimate of the speed, of the distribution of $G(n;z)$ on $\{n:1\leqslant n\leqslant N\}$ to a Gaussian limit law with mean ${\rm e}^{-z}\log_2n$ and variance $\{{\rm e}^{-z}-2z{\rm e}^{-2z}\}\log_2n$, and we establish an asymptotic formula with remainder for all centered moments.
n this paper, we state several conjectures regarding distribution of primes and of pairs of primes represented by irreducible homogeneous polynomial in two variables $f(a,b)$. We formulate conjectures with respect to the slope $t=b/a$ for any irreducible polynomial $f$. Here, we formulate a conjecture for all irreducible polynomials. We also consider conjectures for distribution of pairs of primes. It show unexpected relation to multiple Dedekind zeta function - at $s=2$ for one prime and at $(s_1,s_2)=(2,2)$ for pairs of primes. We tested the conjecture for pairs of primes for several quadrat…
We provide a new proof of Hua's result that every sufficiently large integer N\equiv 5(mod\,24) can be written as the sum of the five prime squares. Hua's original proof relies on the circle method and uses results from the theory of $L$-functions. Here, we present a proof based on the transference principle first introduced by Green. Using a sieve theoretic approach similar to the work by Shao, we do not require any results related to the distributions of zeros of L- functions. The main technical difficulty of our approach lies in proving the pseudorandomness of the majorant of the characteri…
We show that, in a restricted range, the divisor function of integers in residue classes modulo a prime follows a Gaussian distribution, and a similar result for Hecke eigenvalues of classical holomorphic cusp forms. Furthermore, we obtain the joint distribution of these arithmetic functions in two related residue classes. These results follow from asymptotic evaluations of the relevant moments, and depend crucially on results on the independence of monodromy groups related to products of Kloosterman sums.
