betaFeedback

WorksMathematics

The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane ℜs>7/8\Re s>7/8

Abstract

We prove that all finite-order Hecke LL-functions over Q(−3)\mathbb Q(\sqrt{-3}) and all Dirichlet LL-functions are zero-free in the half-plane ℜs>7/8\Re s>7/8, with the principal pole at s=1s=1 allowed. In particular, the Riemann zeta function is zero-free in this half-plane, proving the quasi-Riemann hypothesis.

1 Introduction

Let F=Q(−3)F=\mathbb{Q}(\sqrt{-3}), let O\mathcal{O} be its ring of integers, and write Na=∣O/a∣N\mathfrak a=|\mathcal O/\mathfrak a| for the norm of a nonzero integral ideal. A finite-order Hecke character η\eta modulo a nonzero integral ideal f\mathfrak{f} is a character of the ray class group modulo f\mathfrak{f}, extended by zero to ideals not coprime to f\mathfrak{f}. This agrees with the usual finite-order idelic definition: the complex place contributes no nontrivial finite-order continuous character [22 Chapter VI, Section 1]. For ℜs>1\Re s>1, put

LF(s,η)=∑a≠0η(a)(Na)s=∏p(1−η(p)(Np)−s)−1.L_F(s,\eta)=\sum_{\mathfrak a\ne0} \frac{\eta(\mathfrak a)}{(N\mathfrak a)^s} =\prod_{\mathfrak p} \left(1-\eta(\mathfrak p)(N\mathfrak p)^{-s}\right)^{-1}.

The same notation denotes its meromorphic continuation. For a Dirichlet character χ\chi modulo qq, extended by zero on nonunits, we likewise write

L(s,χ)=∑n≥1χ(n)ns(ℜs>1).L(s,\chi)=\sum_{n\ge1}\frac{\chi(n)}{n^s}\qquad(\Re s>1).

and then continue meromorphically; the character modulo 11 gives the Riemann zeta function ζ(s)\zeta(s). The problem here is uniform exclusion: to find a constant σ0<1\sigma_0<1, independent of the character, its conductor, and the height, such that these functions have no zeros in ℜs>σ0\Re s>\sigma_0.

For ζ\zeta alone, the existence of a fixed σ0<1\sigma_0<1 for which ζ(s)≠0\zeta(s)\ne0 in ℜs>σ0\Re s>\sigma_0 is called the quasi-Riemann hypothesis [3 Section 1]. It asks for one gap valid at every height, not merely nonvanishing on ℜs=1\Re s=1. The corresponding uniform formulation over all Dirichlet characters appears in [9 p. 288, Equation (1.4) and the following paragraph].

The connection between these functions and prime distribution has a long history. Dirichlet’s 1837 proof of infinitude of primes in every reduced arithmetic progression introduced the character LL-series that separate residue classes [7]. Riemann’s 1859 memoir related the zeros of ζ\zeta to the distribution of primes and formulated the critical-line conjecture [25]. Hadamard and de la Vallée Poussin independently proved in 1896 that ζ\zeta has no zero on ℜs=1\Re s=1, obtaining the prime number theorem [15, 28]. Hecke subsequently developed the character zeta functions and their analytic theory over number fields [18].

Classical zero-free regions for Hecke LL-functions approach the line ℜs=1\Re s=1 as the conductor or height increases and can allow one simple real exceptional zero; a precise form for abelian extensions is given by [27 Theorem 3.1]. Such regions do not give uniform exclusion in a fixed half-plane. Zero-density estimates address a different question: they bound the number of zeros to the right of a given vertical line. For example, Guth and Maynard’s large-value estimates improve zero-density bounds for ζ\zeta [14 Theorem 1.2], but these zero-density bounds do not exclude every zero.

Theorem 1.1. Every finite-order Hecke LL-function over F=Q(−3)F=\mathbb{Q}(\sqrt{-3}) has no zero in ℜs>7/8\Re s>7/8. The same holds for every Dirichlet LL-function, including ζ(s)\zeta(s). A pole at s=1s=1 for a principal character is allowed.

In particular, Theorem 1.1 resolves the quasi-Riemann hypothesis affirmatively: the supremum of the real parts of the nontrivial zeros of ζ\zeta, namely its zeros in 0<ℜs<10<\Re s<1, is at most 7/87/8. The boundary ℜs=7/8\Re s=7/8 is not included, while any exceptional real zero in (7/8,1)(7/8,1) is excluded. The theorem does not establish the Riemann hypothesis or its generalized versions, which place nontrivial zeros on ℜs=1/2\Re s=1/2. The Riemann hypothesis remains open [5].

Kubota’s metaplectic theory and Patterson’s cubic theta series provide the automorphic setting [20, 24]. We use the unconditional explicit cusp expansions recorded by Dunn and Radziwiłł [8 Section 5 and Appendix A]; their GRH-conditional prime asymptotic is not an input. The corresponding first-moment asymptotic is proved unconditionally in an independent manuscript [23 Theorem 1.1]; that result is also not used here. Proposition 5.1 derives the reflection used here while retaining the characters’ zero-on-nonunit restrictions.

The character large-sieve arguments build on the quadratic Hecke-family estimate of Goldmakher and Louvel [13 Definition 1 and Theorem 1.1], the higher-order norm recursion of Blomer, Goldmakher, and Louvel [4 Theorem 1.3 and Section 3], and Heath-Brown’s cubic estimate [17 Theorem 2]. We prove the precise sextic specialization needed here in Lemma 9.1, using paired residue characters to carry out that recursion in the primary-generator convention. An Eisenstein-integer form is also recorded by Gao and Zhao [12 Lemma 2.9]. The recursive moment arguments are related to the framework of Heath-Brown’s quadratic method [16 Section 2]. We also use the ordinary Hecke functional equation [11 Equation (1.1)] and prime counting in a fixed ray class [27 Theorem 1.1].

The planar additive large sieve used in the first stage is classical; compare Huxley’s multivariable and number-field inequality [19] and the Poisson proof in [1 Section 3, Theorem 3]. We include a direct Eisenstein-lattice proof to record the normalization needed for the reduced-fraction expansion. David, de Faveri, Dunn, and Stucky combine Patterson’s coefficients, the cubic large sieve, and mollified moments to prove nonvanishing at s=1/2s = 1/2 for a positive proportion of a cubic Hecke family [6 Theorem 1.1 and Section 1.2]. The zero detector below uses the classical truncated-inverse mechanism; compare [21 Appendix C], and for a higher-order-character density application [4 Corollary 1.6 and Section 5].

The proof has two stages, each comparing two representations of a completed cubic-theta sum but using a different normalized sum in the continuation argument. Part I proves the corresponding 11/1211/12 assertion in Theorem 3.1, already obtaining a fixed zero-free half-plane for both families. Part II starts from that conclusion and introduces prime compensation, asymmetric scales, and two additional moment estimates. The contribution developed here is the construction of these compatible reflected and Poisson comparisons, including the principal residues, with positive exponent margins chosen independently of the target character.

Proof overview

A common continuation principle. The analytic argument begins with the family of primitive finite-order Hecke characters over FF. Let β∗\beta_* be the supremum of 1/21/2 and the real parts of their zeros in 1/2≤ℜs≤11/2 \le\Re s \le1; poles are not included. Imprimitive characters have the same possible zeros in ℜs>0\Re s > 0, because the finitely omitted Euler factors are nonzero there. If β∗\beta_* exceeds a proposed boundary σ0\sigma_0, the task is to continue every target reciprocal across a common positive distance to the left of β∗\beta_*.

Section 2 gives the precise criterion. For each target η\eta and large real scale ZZ, it compares a normalized character sum with a Mellin integral containing 1/LF(s,η)1/L_F(s,\eta), after deletion of finitely many Euler factors and multiplication by a holomorphic factor bounded away from zero. A direct bound for the sum and a power-saving bound for its difference from that integral imply the required continuation. The two parts use this same principle with different affine powers of ZZ in the Mellin integral:

CI(s)=s−23,CII(s)=s−1116.C_{\mathrm{I}}(s)=s-\frac{2}{3}, \qquad C_{\mathrm{II}}(s)=s-\frac{11}{16}.

Thus the common analytic principle does not identify the two normalized sums. Only the positive power margins must be independent of η\eta; fixed-character constants and lower thresholds may depend on it.

The completed sum. Section 4 sets up the sextic residue characters over O\mathcal{O}, always retaining their zero values on nonunits. The base sum in Section 6 averages smoothed cubic-theta Fourier coefficients against these characters and a fixed target η\eta. After the fixed rescaling in the theta expansion, the completed indices are cn3cn^3, where c,n∈Oc,n \in\mathcal{O} are congruent to 1 modulo 3 and cc is squarefree. The variables cc and nn may share prime factors. Here completion means retaining the full cubic factor n3n^3, rather than restricting the index to its squarefree part. The target character and a finite ray-class phase act on the whole product cn3cn^3, rather than separately on its two factors.

The resulting completed base sum has two exact representations. The reflection in Proposition 5.1 transforms its theta coefficients while retaining the character zeros in the resulting formula. Poisson summation transforms the averaging variable. Its nonzero frequencies have the form ua6ua^6, where u,a∈Ou,a \in\mathcal{O} and uu is sixth-power-free: every prime valuation of uu is at most five. Section 7.2 then expresses the contribution of each such row through a quotient of Hecke LL-functions and a controlled Euler product. For u=1u=1, this quotient contains the reciprocal of the target function.

The balanced first stage. In Part I, the two averaging scales are both Z1/2Z^{1/2}. On the reflected side, the base sum separates into a completed theta row and an additive polynomial. The quadratic large sieve bounds the mean square of the reflected rows. Expanding the additive polynomial produces reduced fractions in C/O\mathbb{C}/\mathcal{O}; their separation and coefficient mass give the required planar large-sieve bound. The Cauchy–Schwarz inequality combines the two norms in Proposition 6.3. This direct estimate does not use the later inverse-moment recursion.

On the Poisson side, the intermediate rows are grouped by their norm and by the location of zeros in bounded-height rectangles for the finite family of Hecke twists that each row determines. Section 8 assigns zero-free rectangles to these families. When a row has a selected zero above the detector’s fixed floor for the real part, it produces two large Dirichlet polynomials: one with ideal Möbius coefficients, representing a truncated reciprocal, and one without those coefficients. They have one common row character and one common twist height. Part I uses only the inverse polynomial in its row count. After the part of the row with prime valuations at least two is fixed, the sextic large sieve applies to its squarefree factor; Proposition 9.2 gives the resulting count. Rows at the floor and the remaining small and large norm ranges are bounded directly.

The principal row is treated separately. Its residues, together with the local Euler identity, give a nonzero scalar multiple of the target Mellin integral. After normalization, the direct estimate and the remaining-row estimate verify the common continuation criterion with CI(s)=s−2/3C_{\mathrm{I}}(s)=s-2/3. This proves Theorem 3.1. The entire family is needed even for the consequence about ζ\zeta, because the Poisson rows introduce finite-order Hecke twists of the target.

The refined second stage. Part II retains the completed support and the shared arithmetic identities, but it modifies the base sum. Selected prime factors provide a local compensation that cancels an unwanted Euler contribution, and the two averaging scales are no longer equal. After the new residue calculation and scalar normalization, the corresponding Mellin signal uses CII(s)=s−11/16C_{\mathrm{II}}(s)=s-11/16. The low estimate for the normalized sum again follows directly from reflected energy and an additive mean-square estimate; Section 15 proves it for the modified sum.

The high estimate uses both polynomials supplied by the zero detector. For a smooth compactly supported WW on (0,∞)(0,\infty), a scale D>0D>0, and a finite-order Hecke character ψ\psi, their basic forms are

D−1/2∑a≠0μ(a)ψ(a)W(Na/D),D−1/2∑a≠0ψ(a)W(Na/D),D^{-1/2}\sum_{\mathfrak a\ne0}\mu(\mathfrak a)\psi(\mathfrak a) W(N\mathfrak a/D),\qquad D^{-1/2}\sum_{\mathfrak a\ne0}\psi(\mathfrak a)W(N\mathfrak a/D),

where μ\mu is the ideal Möbius function. In the specified intermediate norm ranges above the detector floor, each retained row has a large inverse polynomial and a large plain polynomial with one common row character and twist height. Bounds for their moments limit the number of such rows. Section 19 combines the two bounds, using integer powers and selected prime factors in the larger intermediate norm ranges. Small and large norm ranges, and the floor class, remain direct estimates.

The two moment bounds require separate inductions. Section 17 proves the second-moment estimate for an inverse polynomial multiplied by sums over disjoint prime sets (Lemma 17.1). Its recursive step uses two finite Poisson transformations to shorten the row range, with reflected energy providing the terminal bound. Section 18 proves a mean-square estimate for products of two plain polynomials, again with permitted prime factors (Lemma 18.1). Ordinary Hecke reflection reduces the length ranges at each stage; the recursive step uses two finite Poisson transformations.

The plain estimate retains different row families according to whether prime factors are present. With them, it excludes rows whose primitive inducing character belongs to the fixed finite group generated by the target and the auxiliary ray characters; without them, it excludes only principal inducing characters. Transformed rows in that finite family are treated separately within the induction. Direct volume bounds handle uncentered products. For a difference of two products with the same two profiles and equal products of scales, the common main terms cancel. This cancellation is used only for that centered expression, not for every row in the finite inducing-character family.

Section 20 combines the resulting row counts with the compensated expansion, its local errors, the contour tails, and the principal residue. After normalization, their bound verifies the second comparison in the continuation criterion at 7/87/8.

Transfer to Dirichlet LL-functions. The final transfer is the same at both boundaries. Composing a Dirichlet character χ\chi with the ideal norm gives a Hecke character over FF. Away from finitely many Euler factors, quadratic factorization writes its LL-function as the product of the Dirichlet LL-functions attached to χ\chi and to χχ−3\chi\chi_{-3}, where χ−3\chi_{-3} is the quadratic character of F/QF/\mathbb{Q}. The omitted factors are nonzero in ℜs>0\Re s > 0, and the principal pole is handled separately. Thus each Hecke half-plane transfers to all Dirichlet characters, completing the two stages.

Least nonresidues and square roots over prime fields

The fixed Dirichlet zero-free half-plane also makes the following classical consequences unconditional.

Corollary 1.2. There are absolute constants A,C>0A,C>0 such that, for every odd prime pp, the least positive quadratic nonresidue n(p)n(p) satisfies

n(p)≤C(log⁡p)A.n(p) \le C(\log p)^A.

In particular, n(p)≪δpδn(p) \ll_{\delta} p^{\delta} for every δ>0\delta>0, proving Vinogradov’s least quadratic nonresidue conjecture [26 Conjecture 1.1] . Given an odd prime pp and a∈Fpa \in\mathbb{F}_p in binary representation, there is a deterministic algorithm, with running time polynomial in log⁡p\log p, that returns a square root of aa or reports that none exists.

Proof. By Theorem 1.1 and the functional equation, the nontrivial zeros of every primitive Dirichlet LL-function lie in 1/8≤ℜs≤7/81/8 \le\Re s \le7/8. They therefore lie in the strictly larger strip 1/16<ℜs<15/161/16 < \Re s < 15/16. This supplies the weak-GRH hypothesis of Bhargava, Ivanyos, Mittal, and Saxena [2 Conjecture 6.3 and Theorem 6.7] with ϵ=7/16\epsilon=7/16. Their bound for the least quadratic nonresidue gives the asserted inequality, for example with A=32A=32; no optimization is needed here. The assertion for each δ>0\delta>0 follows because every fixed power of log⁡p\log p is Oδ(pδ)O_{\delta}(p^{\delta}).

For the algorithm, first handle a=0a=0 and test a nonzero aa by Euler’s criterion. If aa is a square, scan 2,3,…2,3,\ldots until a quadratic nonresidue is found, testing each candidate by its Legendre symbol. The bound just proved makes this a polynomial-time deterministic search; its stopping rule does not require knowing CC. Use the resulting nonresidue in the Tonelli–Shanks algorithm [10 Section 2.9, Algorithm 3 and Lemma 2.9.5]. All remaining steps are deterministic and polynomial in log⁡p\log p. Writing p−1=2eup-1=2^e u with uu odd only requires removing factors of two, not factoring uu. □\square

2 From a common signal to a zero-free half-plane

Both parts of the proof use the same analytic principle. A character sum is bounded directly and is also compared with a Mellin integral containing the reciprocal of a target LL-function. A power saving in both comparisons then continues that reciprocal across the rightmost possible zeros. We prove this principle for a variable boundary, so that it can be applied at 11/1211/12 and at 7/87/8 without repeating the argument.

Throughout the paper, F=Q(−3)F = \mathbb{Q}(\sqrt{-3}). It suffices to consider primitive target characters. Indeed, a character induced from a primitive character η\eta has LL-function differing from LF(s,η)L_F(s,\eta) by finitely many factors 1−η(p)Np−s1-\eta(\mathfrak{p})N\mathfrak{p}^{-s}, all nonzero for ℜs>0\Re s > 0. Define

β∗=sup⁡({1/2}∪{ℜρ:1/2≤ℜρ≤1,LF(ρ,η)=0for some primitive finite-order Hecke character η}).(2.1)\beta_* = \sup\left(\{1/2\}\cup \left\{\Re\rho:\begin{array}{l} 1/2\le\Re\rho\le1,\quad L_F(\rho,\eta)=0\\ \text{for some primitive finite-order Hecke character }\eta \end{array}\right\}\right). \tag*{(2.1)}

Poles are not included. Absolute convergence of the Euler product excludes zeros in ℜs>1\Re s > 1, so 1/2≤β∗≤11/2\le\beta_*\le1.

For a finite set S\mathcal{S} of prime ideals, a superscript S\mathcal{S} means that the corresponding Euler factors have been deleted:

LFS(s,η)=LF(s,η)∏p∈S(1−η(p)Np−s).L_F^{\mathcal{S}}(s,\eta)=L_F(s,\eta)\prod_{\mathfrak{p}\in\mathcal{S}}\left(1-\eta(\mathfrak{p})N\mathfrak{p}^{-s}\right).

The local value is zero at a ramified prime. Each displayed factor is nonzero for ℜs>0\Re s > 0, so deleting finitely many factors neither creates nor removes a zero there.

Proposition 2.1 (Continuation from a common signal). Fix σ0∈(1/2,1)\sigma_0\in(1/2,1) and suppose Δ0=β∗−σ0>0\Delta_0=\beta_*-\sigma_0>0. Let C(s)=s+cC(s)=s+c, where c∈Rc\in\mathbb{R} is fixed. Suppose that numbers ω,σ\omega,\sigma satisfying

0<ω<Δ0,σ>00<\omega<\Delta_0,\qquad\sigma>0

can be chosen independently of the target character. For every primitive finite-order Hecke character η\eta, suppose there exist a finite set S\mathcal{S}, a holomorphic function HηH_\eta on ℜs>σ0\Re s>\sigma_0, and a function Jη(Z)J_\eta(Z) defined for all sufficiently large real ZZ, such that

sup⁡ℜs>σ0∣Hη(s)−1∣≤12.(2.2)\sup_{\Re s>\sigma_0}|H_\eta(s)-1|\le\frac{1}{2}. \tag*{(2.2)}

For Z>0Z>0, define

References

  1. [1]S. Baier and A. Bansal, The large sieve with power moduli for ℤ[i], International Journal of Number Theory 14 (2018), no. 10, 2737–2756. doi:10.1142/S1793042118501658; arXiv:1802.08964.DOI
  2. [2]V. Bhargava, G. Ivanyos, R. Mittal, and N. Saxena, Irreducibility and deterministic r-th root finding over finite fields, Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), ACM, 2017, 37–44. doi:10.1145/3087604.3087620; author manuscript.DOI
  3. [3]K. Billington, M. Cheng, J. Schettler, and A. I. Suriajaya, The average number of Goldbach representations and zero-free regions of the Riemann zeta-function, International Journal of Number Theory 21 (2025), no. 2, 289–316. doi:10.1142/S1793042125500150; arXiv:2306.09102.DOI
  4. [4]V. Blomer, L. Goldmakher, & B. Louvel. (2014). L-functions with n-th-order twists. In International Mathematics Research Notices (Vol. 2014, Number 7, pp. 1925–1955). https://doi.org/10.1093/imrn/rns257
  5. [5]Clay Mathematics Institute. (n.d.). Riemann Hypothesis. In Millennium Prize Problems. Retrieved https://www.claymath.org/millennium/riemann-hypothesis/claymath.org/millennium/riemann-hypothesis
  6. [6]C. David, A. de Faveri, A. Dunn, and J. Stucky, Non-vanishing for cubic Hecke L-functions, preprint, arXiv:2410.03048v2 (2026). arXiv:2410.03048.arxiv.org/abs/2410.03048
  7. [7]P. G. L. Dirichlet. (1837). Beweis des Satzes, daß jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält. In Abhandlungen der Königlichen Preussischen Akademie der Wissenschaften zu Berlin (pp. 45–81). https://arxiv.org/abs/0808.1408
  8. [8]A. Dunn and M. Radziwiłł, Bias in cubic Gauss sums: Patterson's conjecture, Annals of Mathematics 200 (2024), no. 3, 967–1057. doi:10.4007/annals.2024.200.3.3; arXiv:2109.07463.DOI
  9. [9]J. B. Friedlander and D. A. Goldston, Sums of three or more primes, Transactions of the American Mathematical Society 349 (1997), no. 1, 287–310. doi:10.1090/S0002-9947-97-01652-8.DOI
  10. [10]S. D. Galbraith, Mathematics of Public Key Cryptography, Cambridge University Press, 2012. doi:10.1017/CBO9781139012843. Section and algorithm references use the author's extended and corrected version 2.0, Chapter 2.DOI
  11. [11]P. Gao and L. Zhao, Moments of quadratic Hecke L-functions of imaginary quadratic number fields, Journal of Number Theory 209 (2020), 359–377. doi:10.1016/j.jnt.2019.09.002; arXiv:1707.00091.DOI
  12. [12]P. Gao and L. Zhao, Moments and one level density of sextic Hecke L-functions, Functiones et Approximatio Commentarii Mathematici 70 (2024), no. 1, 7–28. doi:10.7169/facm/2057; arXiv:2201.01885.DOI
  13. [13]L. Goldmakher and B. Louvel, A quadratic large sieve inequality over number fields, Mathematical Proceedings of the Cambridge Philosophical Society 154 (2013), no. 2, 193–212. doi:10.1017/S0305004112000370; arXiv:1112.1642.DOI
  14. [14]L. Guth and J. Maynard, New large value estimates for Dirichlet polynomials, Annals of Mathematics 203 (2026), no. 2, 623–675. doi:10.4007/annals.2026.203.2.6; arXiv:2405.20552.DOI
  15. [15]J. Hadamard, Sur la distribution des zéros de la fonction ζ(s) et ses conséquences arithmétiques, Bulletin de la Société Mathématique de France 24 (1896), 199–220. doi:10.24033/bsmf.545.DOI
  16. [16]D. R. Heath-Brown. (1995). A mean value estimate for real character sums. In Acta Arithmetica (Vol. 72, Number 3, pp. 235–275). https://doi.org/10.4064/aa-72-3-235-275
  17. [17]D. R. Heath-Brown. (2000). Kummer's conjecture for cubic Gauss sums. In Israel Journal of Mathematics (Vol. 120, Number part A, pp. 97–124). https://doi.org/10.1007/s11856-000-1273-y
  18. [18]E. Hecke. (1918). Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen. Erste Mitteilung. In Mathematische Zeitschrift (Vol. 1, pp. 357–376). https://doi.org/10.1007/BF01465095
  19. [19]M. N. Huxley, The large sieve inequality for algebraic number fields, Mathematika 15 (1968), no. 2, 178–187. doi:10.1112/S0025579300002540.DOI
  20. [20]T. Kubota. (1969). On automorphic functions and the reciprocity law in a number field. In Lectures in Mathematics, Department of Mathematics, Kyoto University (Number 2). Kinokuniya Book-Store. http://hdl.handle.net/2433/84907hdl.handle.net/2433/84907
  21. [21]J. Maynard and K. Pratt, Half-isolated zeros and zero-density estimates, International Mathematics Research Notices 2024 (2024), no. 19, 12978–13014. doi:10.1093/imrn/rnae191; arXiv:2206.11729.DOI
  22. [22]J. S. Milne. (2020). Class Field Theory. https://www.jmilne.org/math/CourseNotes/CFT.pdfjmilne.org/math/CourseNotes/CFT.pdf
  23. [23]OpenAI. (2026). An unconditional first moment for cubic Gauss sums. In OpenAI Math Release preprint. https://github.com/openai/math/blob/main/preprints/An-unconditional-first-moment-for-cubic-Gauss-sums-September-25-2026/paper.pdfgithub.com/openai/math/blob/main/preprints/An-unconditional-first-moment-for-cubic-Gauss-sums-September-25-2026/paper.pdf
  24. [24]S. J. Patterson, A cubic analogue of the theta series, Journal für die reine und angewandte Mathematik 296 (1977), 125–161. doi:10.1515/crll.1977.296.125.DOI
  25. [25]B. Riemann. (1859). Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse. In Monatsberichte der Königlichen Preussischen Akademie der Wissenschaften zu Berlin (pp. 671–680). https://www.claymath.org/library/historical/riemann/r.htmlclaymath.org/library/historical/riemann/r.html
  26. [26]T. Tao, The Elliott–Halberstam conjecture implies the Vinogradov least quadratic nonresidue conjecture, Algebra & Number Theory 9 (2015), no. 4, 1005–1034. doi:10.2140/ant.2015.9.1005; publisher PDF.DOI
  27. [27]J. Thorner and A. Zaman, A unified and improved Chebotarev density theorem, Algebra & Number Theory 13 (2019), no. 5, 1039–1068. doi:10.2140/ant.2019.13.1039; arXiv:1803.02823.DOI
  28. [28]C.-J. de la Vallée Poussin. (1896). Recherches analytiques sur la théorie des nombres premiers. Première partie: La fonction ζ(s) de Riemann et les nombres premiers en général. In Annales de la Société scientifique de Bruxelles (Vol. 20, Number deuxième partie, pp. 183–256). https://books.google.com/books?id=7e0GAAAAYAAJbooks.google.com/books?id=7e0GAAAAYAAJ

Paper details

vlnc:W_sj8ks5ag
Version
v1 · latest
Published
License
LicenseRef-OpenAI-public
Usage

views · 468

downloads · 29

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

unreleased internal OpenAI model

View statement
Looking for related papers…
Contents