The Gaussian Moat problem asks whether one can walk to infinity in the Gaussian integers using the Gaussian primes as stepping stones and taking bounded length steps or not. In this paper, we have analyzed the Gaussian primes and also developed an algorithm to find the primes on the $\mathbb{R}^2$ plane which will help us to calculate the moat for higher value. We have also reduced a lot of computation with this algorithm to find the Gaussian prime though their distribution on the $\mathbb{R}^2$ plane is not so regular. A moat of value $\sqrt{26}$ is already an existing result done by Genther et.al. The focus of the problem is to show that primes are getting lesser as we are approaching infinity. We have shown this result with the help of our algorithm. We have calculated the moat and also calculated the time complexity of our algorithm and compared it with Genther-Wagon-Wick's algorithm. As a new ingredient, we have defined the notion of primality for the plane $\mathbb{R}^3$ and proposed a problem on it.
We study analogies between the rational integers on the real line and the Gaussian integers on other lines in the complex plane. This includes a Gaussian analog of Bertrands Postulate, the Chinese Remainder Theorem, and the periodicity of divisibility. We also computationally investigate the distribution of Gaussian primes along these lines and leave the reader with several open problems.
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…
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 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.
{\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…
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.
In 1998 Friedlander and Iwaniec proved that there are infinitely many primes of the form $a^2+b^4$. To show this they defined the spin of Gaussian integers by the Jacobi symbol, and one of the key ingredients in the proof was to show that the spin becomes equidistributed along Gaussian primes. To generalize this we define the cubic spin of ideals of $\mathbb{Z}[ζ_{12}]=\mathbb{Z}[ζ_3,i]$ by using the cubic residue character on the Eisenstein integers $\mathbb{Z}[ζ_3]$. Our main theorem says that the cubic spin is equidistributed along prime ideals of $\mathbb{Z}[ζ_{12}]$. The proof of this fol…
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…
The remainder $E_Γ(X)$ in the Prime Geodesic Theorem for the Picard group $Γ= \mathrm{PSL}(2,\mathbb{Z}[i])$ is known to be bounded by $O(X^{3/2+ε})$ under the assumption of the Lindelöf hypothesis for quadratic Dirichlet $L$-functions over Gaussian integers. By studying the second moment of $E_Γ(X)$, we show that on average the same bound holds unconditionally.
Quotient sets have attracted the attention of mathematicians in the past three decades. The set of quotients of primes is dense in the positive real numbers and the set of all quotients of Gaussian primes is also dense in the complex plane. Sittinger has proved that the set of quotients of primes in an imaginary quadratic ring is dense in the complex plane and the set of quotients of primes in a real quadratic number ring is dense in R. An interesting open question is introduced by Sittinger: Is the set of quotients of Hurwitz primes dense in the quaternions? In this paper, we answer the quest…
We generalize the Gaussian moat problem to the finitely many imaginary quadratic fields exhibiting unique factorization in their integers. We map this problem to the Euclidean minimum spanning tree problem and use Delaunay triangulation and Kruskal's algorithm to find moats in these fields in $O(|\mathbf{P}| \log |\mathbf{P}|)$ time, where $\mathbf{P}$ denotes the set of primes we are searching through. Our algorithm uses symmetry and boundaries to correctly and efficiently identify all moats, in order of increasing length, along with the farthest prime reached for each moat, in an underlying …
We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with sparse sets of moduli. We then use this result to obtain large sieve bounds for the cases when $\mathcal{S}$ consists of squares of Gaussian integers and of Gaussian primes. Our bound for the case of square moduli improves a recent result by the authors.
Let p be an odd prime. In 1984, Greene introduced the notion of hypergeometric functions over finite fields. Special values of these functions have been of interest as they are related to the number of F_p points on algebraic varieties and to Fourier coefficients of modular forms. In this paper, we explicitly determine these functions modulo higher powers of p and discuss an application to supercongruences. This application uses two non-trivial generalized Harmonic sum identities discovered using the computer summation package Sigma. We illustrate the usage of Sigma in the discovery and proof …
In this manuscript we discuss the notion of (statistical) independence embedded in its historical context. We focus in particular on its appearance and role in number theory, concomitantly exploring the intimate connection of independence and the famous Gaussian law of errors. As we shall see, this at times requires us to go adrift from the celebrated Kolmogorov axioms, which give the appearance of being ultimate ever since they have been introduced in the $1930$s. While these insights are known to many a mathematician, we feel it is time for both a reminder and renewed awareness. We present t…
Let $q \in \mathbb{Z} [i]$ be prime and $χ$ be the primitive quadratic Hecke character modulo $q$. Let $π$ be a self-dual Hecke automorphic cusp form for $\mathrm{SL}_3 (\mathbb{Z} [i] )$ and $f$ be a Hecke cusp form for $Γ_0 (q) \subset \mathrm{SL}_2 (\mathbb{Z} [i])$. Consider the twisted $L$-functions $ L (s, π\otimes f \otimes χ) $ and $L (s, π\otimes χ)$ on $\mathrm{GL}_3 \times \mathrm{GL}_2$ and $\mathrm{GL}_3$. We prove the subconvexity bounds \begin{equation*} L \big(\tfrac 1 2, π\otimes f \otimes χ\big) \ll_{\, \varepsilon, π, f } \mathrm{N} (q)^{5/4 + \varepsilon}, L \big(\tfrac 1 2…
Let $q$ be a prime power and $\mathbb{F}_q$ be a finite field with $q$ elements. Let $e$ and $d$ be positive integers. In this paper, for $d\geq2$ and $q\equiv1(\mathrm{mod}~ed(d-1))$, we calculate the number of points on an algebraic curve $E_{e,d}:y^e=x^d+ax+b$ over a finite field $\mathbb{F}_q$ in terms of $_dF_{d-1}$ Gaussian hypergeometric series with multiplicative characters of orders $d$ and $e(d-1)$, and in terms of $_{d-1}F_{d-2}$ Gaussian hypergeometric series with multiplicative characters of orders $ed(d-1)$ and $e(d-1)$. This helps us to express the trace of Frobenius endomorphis…
In this paper we derive a formula for the number of $N$-free elements over a finite field $\mathbb{F}_q$ with prescribed trace, in particular trace zero, in terms of Gaussian periods. As a consequence, we derive a simple explicit formula for the number of primitive elements, in quartic extensions of Mersenne prime fields, having absolute trace zero. We also give a simple formula in the case when $Q = (q^m-1)/(q-1)$ is prime. More generally, for a positive integer $N$ whose prime factors divide $Q$ and satisfy the so called semi-primitive condition, we give an explicit formula for the number of…
Our aim is to study topological minimality of some natural matrix groups. We show that the special upper triangular group $SUT(n,\mathbb{F})$ is minimal for every local field $\mathbb{F}$ of characteristic $\neq 2$. This result is new even for the field $\mathbb{R}$ of reals and it leads to some important consequences. We prove criteria for the minimality and total minimality of the special linear group $SL(n,\mathbb{F})$, where $\mathbb{F}$ is a subfield of a local field. This extends some known results of Remus-Stoyanov (1991) and Bader-Gelander (2017). One of our main applications is a char…
