Unconditional implications of the Quasi-Riemann Hypothesis

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Shubhrajit Bhattacharya ↗

Version 1 / Oct 11, 2026 / CC BY 4.0

Abstract

This record identifies published conclusions formerly obtained under RH or GRH whose proofs require only a fixed zero-free half-plane for Dirichlet LL-functions, with further applications of finite-order Hecke LL-functions over Q(−3)\mathbb Q(\sqrt{-3}). The input is the 7/87/8 theorem stated in the recent OpenAI manuscript claiming to prove the quasi-Riemann Hypothesis. We give the uniform analytic deductions explicitly and distinguish them from previously established algebraic and combinatorial results used in the proofs. An accompanying audit records the source verification and rejected candidates. No theorem about all number-field or automorphic LL-functions is inferred from the Dirichlet statement; the pure cubic and cubic-nonresidue applications separately identify the precise fixed-field Hecke input.

Provenance statement

This was generated by a single prompt from me to GPT-6 Astra, out of curiosity. It is quite natural to consider how the newly claimed proof of the quasi-Riemann Hypothesis will impact results that have assumed RH/GRH. I myself have worked with many such situations. So, I had a natural curiosity about the implications. I let GPT run uninterrupted for two days, and it produced this PDF. No human involvement or scrutiny has been performed. But I felt that some of the results might attract people who are interested in analytic number theory in general!

Tools used

OpenAI
ChatGPTVersion GPT-6 Astra

References

  1. O. Klurman, A. P. Mangerel, and J. Teräväinen, Fourier uniformity in intervals longer than every fixed logarithmic power sec:walsh-fourier Walsh's published Fourier-cancellation conclusion i̧te WalshScaling assumes GRH and allows intervals longer than every fixed power of X X. Its analytic input is a twisted prime estimate with some positive power saving. The value of that saving is not part of the conclusion. We prove that estimate, including its uniformity in the real twist, and use the published inverse argument only in the short-interval range needed here. The remaining interval lengths are covered by a previous unconditional theorem. References to intermediate numbered results are to the full author version linked from Walsh's publication page. For a complex multiplicative function gg with ∣g(n)∣1|g(n)| 1, put \[ D(g;T,Q)= _ |t| T\\ ḩi\ ( mod \ q),\ q Q ( _ p T 1- (g(p)p^ it ḩi(p)) p )^ 1/2 . \] Characters in this definition need not be primitive. Write e(u)=(2iu)e(u)= (2 i u). e̱gin theorem [Walsh's Fourier-cancellation conclusion] thm:walsh-fourier If H=H(X)XH=H(X) X and H/X H/ X , then, for g=g= or g=g= , \[ _X^ 2X _ R/ Z | _ x n x+H g(n)e( n) |\,dx=o(HX). \] Here $ $ and $ $ are respectively the Möbius and Liouville functions. The frequency inside the supremum may vary with xx. Equivalently, for every >0 >0 there are K>1K>1 and X0X_0 such that the integral is less than HX HX whenever XX0X X_0 and (X)KHX( X)^K H X. theorem e̱gin lemma [The precise twisted prime input] lem:walsh-prime-input There are absolute constants c>0c>0 and A>1A>1 such that, for every Dirichlet character $ḩi$ modulo qq, every real tt, and P((3q(2+∣t∣)))AP ( (3q(2+|t|)))^A, \[ 1P | _ n P (n)ḩi(n)n^ it | ẹlta_ḩi 1+|t| +P^ -c , \] where $ẹlta_ḩi=1$ for a principal character and is zero otherwise. More precisely, uniformly for P2P 2, e̱gin equation eq:walsh-twisted-perron _ n P (n)ḩi(n)n^ it =ẹlta_ḩi P^ 1+it 1+it +O (P^ 15/16 ^2(3qP(2+|t|)) ). equation The same constants, after alteration, give e̱gin equation eq:walsh-prime
  2. B. Green and T. Tao,
  3. B. Green and T. Tao, Power decay in Möbius correlations with polynomial nilsequences sec:green-tao-power Green--Tao's unconditional nilsequence theorem has decay faster than every fixed negative power of N N. Their published remarks immediately after Theorem 1.1 explicitly assert a stronger conclusion under GRH: decay N−cN^ -c , with c>0c>0 depending only on dimension and filtration degree i̧te[p. 543] GreenTaoMobius2012 . We prove that complete power-decay conclusion. The logarithmic theorem and its mere effectivity are not the assertion being counted here. We specify the terminology. A nilmanifold is G/G/ , where GG is a connected, simply connected nilpotent Lie group and $ $ is a discrete cocompact subgroup. A degree-dd filtration $G_u̱llet$ is a descending sequence of closed connected subgroups $G=G_0=G_1 ḑots G_ d+1 =\ 1\ $ with [Gi,Gj]Gi+j[G_i,G_j] G_ i+j . A sequence g:ZGg: Z G is polynomial relative to this filtration if every iterated multiplicative difference $ _ h_i ḑots _ h_1 g$ takes values in GiG_i, where hg(n)=g(n+h)g(n)−1 _hg(n)=g(n+h)g(n)^ -1 . A Mal'cev basis X=(X1,,Xm) X=(X_1, ,X_m) identifies GG with Rm R^m by $ (t_1X_1)ḑots (t_mX_m)$, identifies $ $ with integer coordinates, and satisfies that span(Xj+1,,Xm) span (X_ j+1 , ,X_m) is a Lie algebra ideal for each 0j<m0 j<m. It is adapted to $G_u̱llet$ if each filtration subgroup is spanned by an appropriate final segment of the basis, and QQ-rational if all its Lie-bracket structure constants are rational of height at most QQ, where the height of a reduced fraction a/ba/b is  ∣a∣,∣b∣  \ |a|,|b|\ . We use the right-invariant coordinate metric and induced quotient metric dXd_ X of i̧te[Definitions 2.1--2.4] GreenTaoOrbits2012 . For a function FF on this quotient, write \[ \|F\|_ Lip =\|F\|_ + _ x y |F(x)-F(y)| d_ X (x,y) . \] e̱gin theorem [Green--Tao's published GRH improvement] thm:green-tao-power For every pair of positive integers m,dm,d there are effective constants c=c(m,d)>0c=c(m,d)>0 and C=C(m,d)>0C=C(m,d)>0 such that the following holds. Suppose G/G/ has di
  4. A. P. Mangerel, On a rigidity property for
  5. A. Granville and K. Soundararajan, The spectrum Rigidity from approximate quadratic Gauss-sum symmetries sec:gauss-rigidity Mangerel's Theorem 1.3(b) in i̧te MangerelRigidity extends a rigidity statement to arbitrarily small fixed powers of the prime modulus, assuming a specified zero-free region for its Dirichlet LL-functions. Theorem thm:input supplies that region for all sufficiently large moduli. We prove its entire conditional conclusion below. The author's unconditional Theorem 1.1 and the converse in Theorem 1.3(a) are not counted as additional transfers. Write e(t)=(2it)e(t)= (2 it). If NN is an odd prime and f:N −1,1 f: N \ -1,1\ , define \[ S_f(a)= _ 1 n<N f(n)e(an/N), a Z/N Z. \] Here ``multiplicative'' means multiplicative on coprime arguments; complete multiplicativity of ff is not required. e̱gin theorem [Mangerel's conditional rigidity conclusion] thm:gauss-rigidity Fix 0<c<10<c<1 and constants B1,B2>0B_1,B_2>0. There are constants M0,N0,C>0M_0,N_0,C>0, depending only on c,B1,B2c,B_1,B_2, with the following property. Let NN0N N_0 be prime, let M0MNM_0 M N, and let f:N −1,1 f: N \ -1,1\ be multiplicative. Suppose that A A is a set of primes less than NN and that signs g(p) −1,1 g(p) \ -1,1\ are specified for the primes pNcp N^c, with e̱gin align 1N _ am̱od N |S_f(ap)-g(p)S_f(a)|^2 & B_1 NM &&(p A,\ p N^c), eq:gauss-small-dilations \\ _ p<N\ A 1p & B_2 \ M, N\ . eq:gauss-missing-primes align Then a real Dirichlet character $ $ modulo NN satisfies \[ #\ 1 n<N:f(n) (n)\ C N M . \] The principal character and the Legendre symbol are the two possibilities for $ $. theorem e̱gin proof We first state the two published inputs and check the analytic hypothesis of the one that was conditional. Mangerel calls a prime NN of AA-Littlewood type when every nonprincipal character modulo NN has a nonvanishing LL-function throughout e̱gin equation eq:gauss-littlewood s>1-A N N , | s| N. equation For each fixed AA, choose NN so large that AN/N<1/8A N/ N<1/8. The region in eq:gauss-littlewood is then contained in $ s
  6. E. Sofos, Statistics of small prime quadratic
  7. R. Mrazović, A random model for the Paley graph,
  8. H. L. Montgomery, Topics in multiplicative Large first prime nonresidues and gaps between them sec:large-nonresidue-gaps For a prime pp, write $n_1(p)<n_2(p)<ḑots$ for the primes that are quadratic nonresidues modulo pp. In particular, pp itself is not in this list. Sofos's Theorem 4 in i̧te SofosNonresidues proves a lower bound of order p p unconditionally, and a lower bound of order pp p p under GRH, for the simultaneous largeness of n1(p)n_1(p) and n2(p)−n1(p)n_2(p)-n_1(p). Its entire conditional conclusion follows here. e̱gin theorem [Sofos's conditional large-gap conclusion] thm:large-nonresidue-gaps There is an absolute constant c0>0c_0>0 such that \[ \ n_1(p),\ n_2(p)-n_1(p)\ >c_0( p)( p) \] for infinitely many primes pp. theorem e̱gin proof We prove the prime sign-pattern estimate used in the argument, including its conductor and uniformity details. All logarithms in this proof are natural. Fix \[ ąppa= 1 32 2 , y=ąppa( x)( x), k= (y), \] where xx tends to infinity. Assign any signs $ǎrepsilon_ \ -1,1\ $ to the primes y y. We will count primes p(x,2x]p (x,2x] with all $i̱gl( pi̱gr)=ǎrepsilon_ $, and, for later use, also impose p14p 1 4. Put \[ Q=8 _ 3 y\\ prime . \] The quadratic symbol $i̱gl( pi̱gr)$ on primes p>yp>y is the value at pp of a real Dirichlet character modulo QQ. Indeed, one can first take the primitive character of fundamental discriminant 88 for =2 =2, and of fundamental discriminant $ $ or 44 for an odd prime $ $, and then induce it modulo QQ. Denote this character by $ḩi_ $. Also write $ḩi_ -4 $ for the character giving the sign of −1-1, induced modulo QQ. For a subset SS of the primes at most yy, set dS=Sd_S= _ S , $ḩi_S= _ S ḩi_ $, and $ǎrepsilon_S= _ S ǎrepsilon_ $. The empty products are the principal character modulo QQ and 11, respectively. On primes coprime to QQ, $ḩi_S$ is the quadratic character of the positive squarefree integer dSd_S. It is principal precisely when SS is empty. Moreover, $ḩi_ -4 ḩi_S$ is always nonprincipal: its qua
  9. M. Mourtada and V. Kumar Murty, Extreme Euler--Kronecker constants of quadratic fields sec:extreme-quadratic-euler-kronecker For a number field KK, its Euler--Kronecker constant is \[ _K= _ s 1 ( _K' _K (s)+ 1 s-1 ). \] For a fundamental discriminant DD, the factorization $ _ Q( D) (s)= (s)L(s,ḩi_D)$ gives \[ _ Q( D) = + L' L(1,ḩi_D), \] where $ $ is Euler's constant. Mourtada--Murty i̧te MourtadaMurtyOmega proved unconditionally that both signs attain the lower order ∣D∣+O(1) |D|+O(1) infinitely often. Their GRH result adds the term ∣D∣ |D|. We recover that complete conditional lower bound, including the coefficient one on both logarithms and the published x x abundance. For the full statement and proof in an accessible author source, see i̧te[Chapter 4, Theorem 17] MourtadaThesis ; that chapter is explicitly identified as the work published in i̧te MourtadaMurtyOmega . e̱gin theorem [Mourtada--Murty's conditional omega conclusions] thm:extreme-quadratic-euler-kronecker There are absolute constants C+,C−C_+,C_- such that, for every sufficiently large xx, there are x x primes pxp x, p14p 1 4, separately for each sign, such that \[ L' L(1,ḩi_p) x+ x-C_+, \] and x x such primes for which \[ - L' L(1,ḩi_p) x+ x-C_-. \] Consequently the same two lower bounds hold for Q(p) _ Q( p) and −Q(p)- _ Q( p) , after altering the constants. theorem e̱gin proof We give the full averaging argument. Let XX tend to infinity, and put \[ ąppa= 1 32 2 , y=ąppa( X)( X), Z=( X)^ 32 , k= (y). \] For sufficiently large XX one has 2<y<Z<X2<y<Z<X. For  −1,1  \ -1,1\ let $ P_ $ consist of the primes p(X,2X]p (X,2X] satisfying p14p 1 4 and \[ ( p )= for every prime y. \] Write $W_ = _ p P_ p$. The prime-pattern computation eq:nonresidue-pattern-projector -- eq:nonresidue-pattern-asymptotic gives e̱gin equation eq:ek-pattern-mass W_ = X 2^ k+1 +O\! (X^ 7/8 ^2(3QX) ), Q=8 _ 3 y\\ prime . equation Indeed, the characters in the projector are the quadratic characters of the squareclasses dSd_S and −dS-d_S, where $d_S= _ S
  10. A. I. Badzyan, The Euler--Kronecker constant,
  11. K. Ford, F. Luca and P. Moree, Cyclotomic Euler--Kronecker constants and a second asymptotic coefficient sec:cyclotomic-euler-kronecker Write Km=Q(m)K_m= Q( _m), where m _m is a primitive mmth root of unity, and define \[ _m= _ s 1 ( _ K_m ' _ K_m (s)+ 1 s-1 ). \] Badzyan's published conditional conclusion i̧te[Section 2] Badzyan2010 concerns every positive integer mm, including composite conductors. We retain that scope and its full order of magnitude. The second conclusion below is the GRH clause of Ford--Luca--Moree's Theorem 2 i̧te FordLucaMoree2014 . e̱gin theorem [Badzyan's bound] thm:cyclotomic-euler-kronecker There is an effective absolute constant CC such that, for every integer m3m 3, \[ | _m| C m (3m). \] theorem We prove the sieve estimate needed for the prime-power terms explicitly. This also avoids applying a prime-only Brun--Titchmarsh estimate to a sum containing higher powers. e̱gin lemma lem:cyclotomic-prime-power-sieve For m3m 3, put \[ M_m=\ j N:mj+1 m^ 32 , mj+1 is a prime power \ . \] Uniformly for 1Tm311 T m^ 31 , \[ A_m(T):=#\ j M_m:j T\ m ǎrphi(m) T (2T) . \] Consequently \[ _ j M_m 1j m ǎrphi(m) (3m). \] All implied constants are effective and absolute. lemma e̱gin proof It suffices first to treat large TT; bounded TT follows by enlarging the absolute constant. Put z=T1/8z=T^ 1/8 and \[ G_m(z)= _ d z\\(d,m)=1 ^2(d) ǎrphi(d) . \] Here $ $ is the Möbius function. For a squarefree dd, the sum of 1/n1/n over all positive integers with radical dd is $1/ǎrphi(d)$. Therefore \[ G_m(z) H_m(z):= _ n z\\(n,m)=1 1n. \] Every positive integer factors uniquely as abab, where every prime factor of aa divides mm and (b,m)=1(b,m)=1. Writing $a m^ $ for the first condition, we obtain \[ _ n z 1n = _ a m^ 1a H_m(z/a) H_m(z) _ p m (1-p^ -1 )^ -1 . \] In particular e̱gin equation eq:cyclotomic-sieve-denominator G_m(z) ǎrphi(m) m z. equation For completeness, the required upper sieve follows by minimizing a finite quadratic form. Use real weights d _d supported on sq
  12. J. Hoffstein and P. Lockhart,
  13. D. Goldfeld, J. Hoffstein, and D. Lieman, The exponent of imaginary quadratic class groups sec:exponent For a negative fundamental discriminant DD, let E(D)E(D) be the exponent of the ideal class group of K=Q(D)K= Q( D): the least positive integer annihilating every ideal class. Boyd and Kisilevsky i̧te BK proved under ERH that E(D)E(D) . The following recovers that exact qualitative conclusion, and the published order of magnitude recorded in i̧te[Introduction] EKN . The sharper asymptotic coefficient 1/21/2 obtained under ERH is not asserted. e̱gin lemma [A small split prime] lem:split-prime There is an effective absolute constant C1C_1 such that for every negative fundamental discriminant DD, some rational prime pp satisfies \[ p D, ( Dp )=1, p C_1( (3|D|))^8. \] Here the symbol is the Kronecker symbol, including at p=2p=2. lemma e̱gin proof Put Q=∣D∣Q=|D| and $ḩi=ḩi_D$. This is a real primitive nonprincipal Dirichlet character modulo QQ. Add the principal smoothed sum to eq:smoothed . The estimates proved there give \[ _ n x (n)(1+ḩi(n))(1-n/x) = x2+Oi̱gl(x^ 7/8 (3Q) +x^ 7/8 ^2(2x)+ (Qx)i̱gr). \] If there were no split prime at most xx, all contributions with n=pn=p and pDp D would vanish. The terms supported on prime powers with pDp D are O((3Q)x)O( (3Q) x): each such prime contributes at most 2x2 x, and there are at most Q/2 Q/ 2 such primes. The remaining prime-power terms with exponent at least two have total absolute value O(x2(2x))O( x ^2(2x)). Indeed, there are at most x x possible underlying primes, at most x/2 x/ 2 exponents per prime, and each von Mangoldt weight is at most x x; the slightly sharper stated bound also follows by summing a2(x1/a) _ a 2 (x^ 1/a ) and the elementary bound (t)t (t) t. Consequently the entire left side would be bounded by these two errors. Take x=C1((3Q))8x=C_1( (3Q))^8. The ratio of the character-zero error to xx is O(C1−1/8)O(C_1^ -1/8 ), while each other displayed error is o(x)o(x) as QQ . Choosing C1C_1 large gives a contradiction for all sufficiently large QQ. The
  14. J.-H. Ahn and S.-H. Kwon, The complete Richaud--Degert class-number-two classification sec:rd-class-two For this section, a squarefree integer D>1D>1 is of extended Richaud--Degert type if there are integers m1m 1 and r0r 0 such that \[ D=m^2+r, r 4m. \] This is the divisibility definition in i̧te[Introduction] MollinRD2009 ; no additional normalization of rr is imposed. We use DD for the squarefree radicand and =D =D if D14D 1 4, and =4D =4D otherwise, for the fundamental discriminant. The class number is the ordinary ideal class number, without a positivity condition on generators. e̱gin theorem [Mollin's complete list] thm:rd-class-two There are exactly 107107 real quadratic fields of extended Richaud--Degert type with ordinary class number two. Their squarefree radicands are precisely the following: \[ e̱gin array rrrrrrr 10&15&26&30&34&35&39\\ 42&51&65&66&78&85&87\\ 95&102&105&110&119&122&123\\ 138&143&146&165&182&194&203\\ 205&215&221&222&230&258&285\\ 287&318&327&357&362&365&395\\ 402&429&447&482&485&527&533\\ 623&629&635&645&678&741&782\\ 843&885&902&957&965&1022&1085\\ 1157&1173&1205&1245&1298&1469&1517\\ 1533&1605&1685&1853&1965&2013&2037\\ 2045&2085&2093&2117&2301&2373&2397\\ 2613&2717&2813&3005&3237&3365&3597\\ 3605&3813&4245&4277&4773&4893&5645\\ 5757&5885&5957&6573&7157&7733&8333\\ 9005&14405&&&&& array \] The list is the one in i̧te[Theorems 3.1--3.13 and Remark 3.1] MollinRD2009 ; its completeness now requires no GRH. theorem e̱gin lemma [A regulator bound for the full divisibility family] lem:rd-regulator If D3D 3 is of extended Richaud--Degert type and RDR_D denotes the logarithm of its fundamental unit greater than one, then \[ R_D (16D). \] lemma e̱gin proof Fix a representation D=m2+rD=m^2+r as above and put \[ = (m+ D)^2 |r| . \] Its norm is one, and its trace is \[ 4m^2 |r| +2 sgn (r) Z, \] because ∣r∣4m|r| 4m. Thus $ $ is an algebraic integer unit. It is greater than one: equivalently, (m+D)2>∣m2−D∣(m+ D)^2>|m^2-D|, which holds for m,D>0m,D>0. Consequently RDR_D ,
  15. S. Louboutin, Prime producing quadratic
  16. A. Biró and K. Lapkova, The class number
  17. J. Lee, The complete determination of wide The complete class-number-one list in the same family The same finite enumeration also settles the earlier conditional class-number-one list. Louboutin i̧te[pp. 315--316] LouboutinPrime1990 records the following 4343 radicands, attributing the classification under the extended Riemann hypothesis to his work and to Mollin--Williams. That source normalizes rr by −m<rm-m<r m or permits r=4m/3r= 4m/3. Here we prove the identical list for the full divisibility definition of extended Richaud--Degert type from the beginning of this section, which contains that family. e̱gin corollary [The complete extended Richaud--Degert class-number-one list] cor:rd-class-one There are exactly 4343 real quadratic fields of extended Richaud--Degert type with ordinary class number one. Their squarefree radicands are precisely \[ e̱gin array rrrrrrr 2&3&5&6&7&11&13\\ 14&17&21&23&29&33&37\\ 38&47&53&62&69&77&83\\ 93&101&141&167&173&197&213\\ 227&237&293&398&413&437&453\\ 573&677&717&1077&1133&1253&1293\\ 1757&&&&&& array \] corollary e̱gin proof The cutoff proof for Lemma lem:rd-class-two-cutoff actually excludes every field with hD2h_D 2 and D108D 10^8. Indeed, its only use of the class-number value is \[ L(1,ḩi_ )=2h_D R_D 4R_D 4 (16D), \] which holds for all such hDh_D. The same Tatuzawa lower bound contradicts this inequality for D108D 10^8. Thus every field in this corollary is among the 149024149024 candidates already enumerated and unconditionally verified in the proof of Theorem thm:rd-class-two . Selecting the records with class number one gives exactly the 4343 displayed radicands. This selected list has been compared, entry by entry, with the published list on pp. 315--316 of i̧te LouboutinPrime1990 ; the two lists agree. All positive entries and all exclusions use the same complete arithmetic verification as the class-number-two classification. This proves both directions without a further hypothesis or a new enumeration. proof This corollary concerns
  18. A. Bourdon and P. Pollack, Torsion subgroups of CM
  19. P. T. Joshi, The size of L(1,chi) for real
  20. P. L. Clark, T. Genao, P. Pollack and F. Saia, The typical least degree of a CM point on a modular curve sec:typical-cm-degrees For a modular curve X/QX/ Q, let dCM(X)d_ CM (X) be the least residue-field degree over Q Q of a noncuspidal closed point represented by an elliptic curve with complex multiplication. For a negative quadratic-order discriminant $ $, let d,CM(X)d_ , CM (X) denote the corresponding minimum with endomorphism order of discriminant $ $. The curves X0(N)X_0(N) and X1(N)X_1(N) classify, respectively, elliptic curves with a cyclic subgroup of order NN and with a point of order NN. All orders, including nonmaximal orders, are permitted. Clark--Genao--Pollack--Saia proved the following two assertions under GRH i̧te[Theorem 1.7] CGPS2022 . The proof below preserves their exact typical exponent. Their sharper maximal-order estimates in Theorems 1.3 and 1.5 are separate assertions and are not being transferred here. e̱gin theorem [The published typical-degree conclusions] thm:typical-cm-degrees For every >0 >0, all but o(x)o(x) positive integers NxN x satisfy both \[ 2^ (1/2- ) x d_ CM (X_0(N)) 2^ (1/2+ ) x \] and \[ N\,2^ (1/2- ) x d_ CM (X_1(N)) N\,2^ (1/2+ ) x . \] theorem e̱gin proof We reproduce the counting argument of i̧te[ 5.6] CGPS2022 , with the analytic estimates replaced explicitly. All logarithms in this proof are natural. It suffices by monotonicity to prove the assertions for 0<<1/40< <1/4. The algebraic inputs. Write $h_ $ for the proper class number of the order. For squarefree BB, put B−=pB,  (/p)=−1pB_-= _ p B,\;( /p)=-1 p, where the symbols are Kronecker symbols, and put 0(B)=BpB(1+1/p) _0(B)=B _ p B (1+1/p). The unconditional algebraic results i̧te[Lemma 4.4 and Proposition 4.6] CGPS2022 give e̱gin align d_ , CM (X_0(B)) & h_ _0(B_-), B\ squarefree , eq:cmtyp-algebra \\ (N) 6d_ CM (X_0(N)) & d_ CM (X_1(N)) (N) 2d_ CM (X_0(N)), N 3. eq:cmtyp-tower align The constants in the first line are absolute and uniform in $ $ and BB. Also, if $ $ is fundamental and (/p)=1( /p)=1 for every $
  21. H. Pasten, Shimura curves and the abc conjecture, Wei's height bound for adjacent CM types sec:wei-height Wei's published Theorem 1.4 i̧te Wei assumes the absence of certain Siegel zeros for relative LL-functions of CM fields, a consequence of GRH. Its hypothesis can be removed even though the imported zero-free theorem does not cover these relative LL-functions: Stark's theorem reduces the particular exceptional zeros in question to imaginary quadratic Dirichlet LL-functions. The argument uses the proved averaged Colmez formula, not the full Colmez conjecture. For a number field FF, set dF=∣disc(F)∣d_F=| disc (F)| and rF=[F:Q]−1dFr_F=[F: Q]^ -1 d_F, the logarithm of its root discriminant. A CM field EE of degree 2g2g is a totally imaginary quadratic extension of its maximal totally real subfield E+E^+. A CM type $ $ chooses one embedding from each complex-conjugate pair of embeddings ECE C. Write h(E,)h(E, ) for the stable Faltings height of an abelian variety with multiplication by the full ring OE O_E and type $ $, using Wei's normalization. It depends only on (E,)(E, ). e̱gin theorem thm:wei-height For each positive integer gg, there are effective constants C1(g)>0C_1(g)>0 and C2(g)C_2(g) with the following property. Let EE be any CM field of degree 2g2g. Let Ai/KiA_i/K_i, for i=1,2i=1,2, be abelian varieties of dimension gg with embeddings \[ O_E End _ K_i (A_i), \] and let their CM types be i _i. If ∣1a\cp2∣=g−1| _1a̧p _2|=g-1, then \[ h_ Falt ^ st (A_1) +h_ Falt ^ st (A_2) 2 C_1(g) r_ K_1 +r_ K_2 2+C_2(g). \] theorem e̱gin proof We first remove the exceptional-zero hypothesis, then reconstruct the height and discriminant comparisons. Exceptional zeros. Put F=E+F=E^+ and $ḩi=ḩi_ E/F $, so that $L(s,ḩi)= _E(s)/ _F(s)$ is the entire quadratic Hecke LL-function attached to E/FE/F. The usual Dedekind zero-free-region theorem, in the form used by Wei, states that this function has at most one zero in \[ Re s 1- 1 4 d_E , | Im s| 1 4 d_E , \] and a zero there is real and simple. This follows also from Stark
  22. X. Wei, Smallness of Faltings heights of CM abelian
  23. X. Wei, arXiv:2111.00617v1 (2021),arXiv
  24. H. M. Stark, Some effective cases of the Fully effective André--Oort for powers of the modular curve sec:effective-ao Identify Y(1)Y(1) with the affine jj-line. A special point is a singular modulus, the jj-invariant of an elliptic curve with complex multiplication. Its discriminant is the negative discriminant of its endomorphism order, which need not be maximal. A special subvariety of Y(1)nY(1)^n is an irreducible component of a locus defined by fixing some coordinates to singular moduli and imposing modular equations N(xi,xj)=0 _N(x_i,x_j)=0 among the remaining coordinates. Here N _N is the classical modular polynomial for cyclic NN-isogenies, and 1(X,Y)=X−Y _1(X,Y)=X-Y. Equivalently, partition the nonconstant coordinates into blocks, choose one distinguished coordinate per block, and impose such a modular relation between it and each other coordinate of the block. For a special subvariety VV, let D(V)D(V) be the largest absolute discriminant of its constant coordinates, with D(V)=0D(V)=0 if there are none. A special subvariety of XX is maximal if it is not contained in a larger special subvariety of XX. The result below is the fully effective conclusion described in i̧te[Section 1.2 and Theorem 1] BinyaminiAO under GRH for imaginary quadratic fields. It is stronger than the unconditional assertion that there are finitely many maximal special subvarieties: the bound and a terminating enumeration are computable from the input. e̱gin lemma [Effective class numbers for every imaginary quadratic order] lem:order-siegel-effective For every rational 0<<1/20< <1/2, an effectively computable positive constant $c_ $ satisfies \[ h( ) c_ | |^ 1/2- \] for every negative quadratic-order discriminant $ $. lemma e̱gin proof Write =f2D =f^2D, where DD is fundamental. Corollary cor:class gives an effective positive constant cc with h(D)c∣D∣/(∣D∣)h(D) c |D| / (|D|). Since t/(t)t^ / (t) has an effectively computable positive lower bound for t3t 3, this implies h(D)c∣′D∣1/2−h(D) c'_ |D|^ 1/2- effectively. The order class-number
  25. F. Balestrieri, A. Johnson, and R. Newton,
  26. E. Gaudron and G. Remond,
  27. A. Kresch and Y. Tschinkel,
  28. B. Poonen, D. Testa, and R. van Luijk, Joint equidistribution of CM points sec:joint-cm-equidistribution Khayutin's published Theorems 1.3 and 3.10 i̧te Khayutin2019 assume the absence of exceptional Landau--Siegel zeros of the quadratic CM fields. We remove this analytic assumption. The two fixed splitting primes, the stated restrictions on the orders, and the genericity conditions are retained. The maximal-order case of the second statement is the published Theorem 1.4. e̱gin theorem [Khayutin's joint-packet and Galois-orbit conclusions] thm:joint-cm-equidistribution The following statements hold without an RH or GRH assumption. e̱gin enumerate Let GG be a Q Q-form of PGL2 PGL _2, let KfG(Af)K_f G( A_f) be compact open, and fix a compact real torus KG(R)K_ G( R). Put \[ Y=G( Q)a̱ckslash G( A)/(K_ K_f). \] Let PiP_i be $K_ $-invariant toral packets with negative fundamental discriminants DiD_i, and also write PiP_i for their finite images in YY. Here a toral packet is the image of an adelic orbit of an anisotropic rational torus, as in i̧te[ 2.4.1--2.4.2] Khayutin2019 . The finite packet is a principal homogeneous space for a finite abelian group CiC_i, with a canonical surjection $C_i Pic ( O_ E_i )$, where Ei=Q(Di)E_i= Q( D_i ). Choose iCi _i C_i and put \[ N_i= \ N a: 0 a O_ E_i ,\ [ a]=[ _i]\ , _i= 1 |P_i| _ z P_i ẹlta_ (z, _i z) . \] Assume NiN_i and that two fixed distinct primes p1,p2p_1,p_2 split in every EiE_i. Every weak-∗* limit point of (i)( _i) is a convex combination of the uniform probability measures on the connected components of YYY Y. Let GG be a Q Q-form of PGL2 PGL _2 split over R R, and let XX be a finite product of indefinite Shimura curves relative to this same GG, at fixed levels. Let xiXx_i X be special points such that all coordinates of xix_i have CM by the same imaginary quadratic order OiEi O_i E_i. Assume that its conductor $f_i=[ O_ E_i : O_i]$ is bounded independently of ii. Let i _i be the normalized counting measure on the finite Galois orbit o
  29. I. Khayutin, Effective bounds for Campagna's singular SS S -units sec:singular-s-units A singular modulus is the jj-invariant of a complex elliptic curve with complex multiplication. It is an algebraic integer. For a set SS of rational primes, a nonzero algebraic integer $ $ is an SS-unit if every prime divisor of ∣NQ()/Q()∣|N_ Q( )/ Q ( )| belongs to SS. The set SS is allowed to be infinite. e̱gin theorem [Campagna's effective singular-SS-unit conclusion] thm:singular-s-units Let 5 5 be a rational prime, and put \[ S_0=\ p prime :p 1 3\ , S_ =S_0u̧p\ \ . \] There is an effectively computable B()B( ) such that every singular modulus jj which is an $S_ $-unit has order discriminant $ $ satisfying ∣∣B()| | B( ). All these singular moduli can consequently be determined by a finite algorithm. theorem This is the precise effective conclusion of i̧te[Theorem 1.4] CampagnaBounds , published under GRH for the Dirichlet LL-functions of imaginary quadratic fields. Mere finiteness was already unconditional. The point here is the computability of a bound valid for every discriminant. e̱gin proof We first verify the analytic hypothesis isolated in i̧te[Definition 5.1 and Theorem 5.5] CampagnaBounds . That hypothesis asks for one effective k0k 0 such that, for every negative fundamental discriminant DD, e̱gin equation eq:campagna-P L' L (1,ḩi_D) -0.2485 |D|-k. equation Corollary cor:dirichlet-logderiv gives an effective absolute AA with $|L'/L(1,ḩi_D)| A (|D|)$. Because A(t)−0.2485tA (t)-0.2485 t tends to −- effectively, its positive part has an effectively bounded supremum for t3t 3. Any effective upper bound for that supremum is a valid kk. Thus the hypothesis in Campagna's stronger Theorem 5.5 is satisfied. We spell out the remaining transfer, including why its height comparison has a strict positive margin. Write d=∣∣d=| | and =f2D =f^2D. In the normalization used in i̧te[Proposition 5.4] CampagnaBounds , the unconditional Chowla--Selberg and Nakkajima--Taguchi formulas give \[ h_F(E)=
  30. E. Jeřábek, Integer factoring and modular square roots, Miller's equivalences between factoring and arithmetic functions sec:miller-equivalence Theorems 3--5 of Miller's published paper i̧te Miller1976 concern deterministic reductions between arithmetic functions and recognition of their graphs. These are separate from the primality-testing conclusion of that paper, which has long had an unconditional replacement. We recover the full qualitative conclusions of those three theorems. For n1n 1, let (n) (n) be the exponent of the finite group $( Z/n Z)^ $, and put \[ '(n)= lcm _ p n (p-1), '(1)=1. \] Write Fac(n) Fac (n) for the complete prime factorization of nn, including its exponents. All integers are supplied in binary. e̱gin theorem [Miller's functional-equivalence and recognition conclusions] thm:miller-equivalence The functions Fac Fac , $ǎrphi$, $ $, and ′ ' are deterministically polynomial-time equivalent in the following strong sense: given nn and the single value of any one of these functions at nn, one can compute the values of all the others in time polynomial in (2n) (2n). Moreover, complete integer factorization is deterministically polynomial-time Turing equivalent to computing the eventual period of the base-bb expansion of 1/a1/a, for integers a1a 1, b2b 2. Finally, the graphs of $ǎrphi$, $ $, ′ ', and Fac Fac are recognizable in deterministic polynomial time. theorem e̱gin proof We first give a uniform version of Miller's splitting argument that also explains why a single supplied value suffices. Suppose that n3n 3 is odd and that a positive integer MM satisfying e̱gin equation eq:miller-multiple '(n) M equation is supplied. There is a deterministic algorithm factoring nn in time polynomial in (2n)+(2M) (2n)+ (2M). It does not require the prime factorization of MM. Write M=2suM=2^s u with uu odd, and set B=C0((3n))8B= C_0( (3n))^8 , with C0C_0 from Lemma lem:witness . For every composite factor dnd n encountered during recursion, first test whether dd is a prime pow
  31. M. Agrawal, N. Kayal, and N. Saxena,
  32. G. L. Miller,
  33. F. Morain, G. Renault, and B. Smith,
  34. A. Dabrowski, J. Pomykala, and I. E. Shparlinski,
  35. N. Gupta, A. Sikarov, and I. Volkovich, Deterministic extraction of roots sec:roots Adleman, Manders, and Miller i̧te AMM , Theorems I and III, proved under ERH that the least square root, and more generally the least nnth root for every fixed positive integer nn, can be found modulo a prime in deterministic polynomial time. Their Theorem II(a) gives deterministic polynomial-time square-root extraction modulo a supplied fully factored integer. These qualitative statements survive replacing ERH by a uniform effective polylogarithmic bound for the least power nonresidue. We give the algebraic argument, including the distinction between fixed nn and nn supplied in binary. e̱gin theorem [Adleman--Manders--Miller root-extraction conclusions] There is a deterministic algorithm that, given a prime pp, an integer aa, and a positive integer nn, finds all roots of Xn−aX^n-a in Fp F_p in time polynomial in nn and p+(2+∣a∣) p+ (2+|a|). In particular, for each fixed nn, the least nonnegative root can be found, or nonexistence decided, in deterministic polynomial time in the bit length of (p,a)(p,a). There is also a deterministic polynomial-time algorithm for finding a square root of aa modulo an integer MM whose complete prime factorization is supplied, or deciding that no such root exists. theorem e̱gin proof Reduce aa modulo pp. If a=0a=0, its only root is 00; hence assume a0a 0. The case p=2p=2 is immediate. Write N=p−1N=p-1, and factor nn by trial division. This costs polynomial time in the numerical value nn, as the theorem allows; it does not assert polynomial time in n n. For each prime r(n,N)r (n,N), compute sr=vr(N)s_r=v_r(N) and put Rr=rrsR_r=r^ s_r . Put \[ U=N / _ r (n,N) R_r. \] Then (n,U)=1 (n,U)=1. These calculations require no factorization of NN outside the primes already dividing nn. For each such rr, choose successively integers z=1,2,z=1,2, until z0pz 0 p and zN/r1z^ N/r 1 in Fp F_p. A nontrivial character of order rr has precisely the rrth powers as its kernel. Lemma lem:witness
  36. L. Adleman, K. Manders, and G. L. Miller, Deterministic splitting in even degree and Gao's balance test sec:even-splitting The input in this section is a prime pp and a monic squarefree polynomial fFp[X]f F_p[X] of degree n>1n>1 which splits completely in Fp F_p. The distinct roots need not be known. These input promises can be checked in polynomial time by taking a gcd with the derivative and computing $X^pm̱od f$. A proper factor means a divisor with degree strictly between 00 and nn. Rónyai's published factoring theorem includes a deterministic polynomial-time algorithm under GRH to find a proper factor of every such ff of even degree; see i̧te RonyaiFactoring and the explicit discussion in i̧te[Section 1] GaoFactoring . Gao's i̧te[Theorems 3.1 and 3.3] GaoFactoring gives a more general decomposition based on a balance condition on the roots. We prove these conclusions with a direct construction, replacing the GRH-dependent choice of a scalar root of unity by Lemma lem:witness . Suppose first that pp is odd, and write p−1=2swp-1=2^s w with ww odd. Fix an element $ F_p^ $ of order 2s2^s. Every a0a 0 has a unique expression \[ a= ^u , 0 u<2^s, ^w=1. \] Define (a)=1 _ (a)=1 if u<2s−1u<2^ s-1 and (a)=−1 _ (a)=-1 otherwise. In particular (−a)=−(a) _ (-a)=- _ (a). For the set FF of roots of ff, put \[ t_ =#\ e̱ta F \ \ : _ ( -e̱ta)=1\ . \] Gao calls FF square balanced with respect to $ $ when all $t_ $ equal (n−1)/2(n-1)/2. This agrees with his definition using the scalar square-root choice 2 _2: 2(a2)=a _2(a^2)=a exactly when u<2s−1u<2^ s-1 i̧te[Lemma 2.6(d) and Section 2.4] GaoFactoring . When p34p 3 4, $ _ $ is the quadratic character. e̱gin theorem [Gao's balance decomposition and Rónyai's even-degree case] thm:even-splitting There is a deterministic algorithm with bit complexity polynomial in nn and p p which, for odd pp, constructs $ $ as above and computes all polynomials \[ f_j(X)= _ F\ _ =j (X- ), 0 j n-1. \] Their product is ff, and the nonconstant members are pairwise coprime. The alg
  37. The Pollack--Schorn algorithm for three squares sec:three-square-algorithm The existence of a representation by three squares is classical. The previously conditional conclusion here concerns its computational cost when the integer is supplied without a factorization. We recover the exact expected complexity in i̧te[Theorem 3′3'] PollackSchorn , rather than just polynomial-time computability. As in that paper, M(b)M(b) denotes a standard bit-complexity bound for multiplying two bb-bit integers; one may use ordinary multiplication or either of the fast multiplication bounds specified there. In particular M(b)bM(b) b and M(cb)=Oc(M(b))M(cb)=O_c(M(b)) for every fixed c>0c>0. e̱gin theorem [Pollack--Schorn's three-square algorithm] thm:three-square-algorithm There is a randomized algorithm which, given a positive integer nn not of the form 4k(8m+7)4^k(8m+7), returns integers x,y,zx,y,z with n=x2+y2+z2n=x^2+y^2+z^2, always correctly, and has expected bit complexity \[ O\! ( ( n)^2 n \,M( n) ) (n ). \] No factorization of nn is an input. theorem e̱gin proof First remove powers of 44 and at the end rescale the three coordinates by the corresponding power of 22. This costs O(n)O( n) bit operations. It is therefore enough to treat n1,2,3,5,68n 1,2,3,5,6 8. Bounded values of nn can be treated by exhaustive search. Throughout the proof let b=2(n+1)b= _2(n+1) . We first establish the replacement for the only ERH-dependent input in i̧te[Section 3.1] PollackSchorn . There are effective absolute constants C,c>0C,c>0 such that, for (a,q)=1(a,q)=1, q2q 2, and XCq16X Cq^ 16 , e̱gin equation eq:three-square-ap-density #\ p X:p prime ,\ p a q\ c X ǎrphi(q) X . equation Indeed, character orthogonality and Lemma lem:psi , including the principal-character term, give \[ _ m X\ a\ (q) (m) = X ǎrphi(q) +Oi̱gl(X^ 7/8 ^2(qX)i̱gr). \] The contribution from proper prime powers is O(X1/22X)O(X^ 1/2 ^2X). Since $ǎrphi(q) q$, taking the effective absolute constant CC sufficiently large makes the two error terms at most $X/(2ǎrphi(q))$ for every XCq16X Cq^ 16 . D
  38. A. Herlédan Le Merdy and B. Wesolowski,
  39. K. Eisenträger, S. Hallgren, K. Lauter, e̱gin thebibliography 99
  40. P. Castel, Solving quadratic equations in dimension 5 or more without factoring , The Open Book Series 1 (2013), 213--233. https://doi.org/10.2140/obs.2013.1.213 DOI:10.2140/obs.2013.1.213 . https://msp.org/obs/2013/1-1/obs-v1-n1-p11-s.pdf Publisher full text .DOI
  41. P. Kutas, Splitting quaternion algebras over quadratic number fields , Journal of Symbolic Computation 94 (2019), 173--182. https://doi.org/10.1016/j.jsc.2018.08.002 DOI:10.1016/j.jsc.2018.08.002 . https://arxiv.org/abs/1606.01053v2 Accepted author manuscript .DOI
  42. L. M. Adleman, D. R. Estes and K. S. McCurley, Solving bivariate quadratic congruences in random polynomial time , Mathematics of Computation 48 (1987), no. 177, 17--28. https://doi.org/10.1090/S0025-5718-1987-0866095-8 DOI:10.1090/S0025-5718-1987-0866095-8 .DOI
  43. D. Simon, Solving quadratic equations using reduced unimodular quadratic forms , Mathematics of Computation 74 (2005), no. 251, 1531--1543. https://doi.org/10.1090/S0025-5718-05-01729-1 DOI:10.1090/S0025-5718-05-01729-1 .DOI
  44. D. Simon, Quadratic equations in dimensions 4, 5 and more , preprint, 4 July 2006. https://simond.users.lmno.cnrs.fr/maths/Dim4.pdf Author's full text .link
  45. W. Bosma and P. Stevenhagen, On the computation of quadratic 22-class groups , Journal de Théorie des Nombres de Bordeaux 8 (1996), no. 2, 283--313; erratum, 9 (1997), no. 1, 249 (reference numbering). https://www.numdam.org/item/JTNB_1996__8_2_283_0.pdf Full text ; https://doi.org/10.5802/jtnb.200 erratum .DOI
  46. A. Granville and K. Soundararajan, The distribution of values of $L(1,ḩi_d)$, Geom. Funct. Anal. 13 (2003), 992--1028. https://doi.org/10.1007/s00039-003-0438-3 doi:10.1007/s00039-003-0438-3 ; https://arxiv.org/abs/math/0206031 author's version .DOI
  47. A. Granville and K. Soundararajan, Errata to: The distribution of values of $L(1,ḩi_d)$, Geom. Funct. Anal. 14 (2004), 245--246. https://doi.org/10.1007/s00039-004-0456-9 doi:10.1007/s00039-004-0456-9 ; https://dms.umontreal.ca/ andrew/PDF/L1chi2002Errata.pdf published errata .DOI
  48. P. Darbar and G. Maiti, Large values of quadratic Dirichlet LL-functions, Math. Ann. 392 (2025), 4573--4605. https://doi.org/10.1007/s00208-025-03187-6 doi:10.1007/s00208-025-03187-6 ; https://archive.mpim-bonn.mpg.de/5065/1/mpim-preprint_2024-13.pdf author's version .DOI
  49. P. Darbar, C. David, M. Lalín, and A. Lumley, Asymmetric distribution of extreme values of cubic LL-functions at s=1s=1, J. London Math. Soc. 110 (2024), no. 4, e12996, 61 pp. https://doi.org/10.1112/jlms.12996 doi:10.1112/jlms.12996 ; https://pure.mpg.de/rest/items/item_3616423_1/component/file_3616425/content published version .DOI
  50. Y. Lamzouri, On the average of the number of imaginary quadratic fields with a given class number, Ramanujan J. 44 (2017), 411--416. https://doi.org/10.1007/s11139-017-9910-9 doi:10.1007/s11139-017-9910-9 ; https://arxiv.org/abs/1512.07134 author's version .DOI
  51. Y. Lamzouri, The number of imaginary quadratic fields with prime discriminant and class number up to HH, Q. J. Math. 68 (2017), 1379--1393. https://doi.org/10.1093/qmath/hax026 doi:10.1093/qmath/hax026 ; https://arxiv.org/abs/1701.05267 author's version .DOI
  52. G. L. Miller, Riemann's hypothesis and tests for primality, J. Comput. System Sci. 13 (1976), 300--317. https://doi.org/10.1016/S0022-0000(76)80043-8 doi:10.1016/S0022-0000(76)80043-8 ; https://www.cs.cmu.edu/ glmiller/Publications/Papers/Mi76.pdf author-hosted published scan .DOI
  53. M. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P, Ann. of Math. (2) 160 (2004), 781--793. https://doi.org/10.4007/annals.2004.160.781 doi:10.4007/annals.2004.160.781 .DOI
  54. F. Morain, G. Renault, and B. Smith, Deterministic factoring with oracles, Appl. Algebra Engrg. Comm. Comput. 34 (2023), 663--690. https://doi.org/10.1007/s00200-021-00521-8 doi:10.1007/s00200-021-00521-8 .DOI
  55. A. Dąbrowski, J. Pomykał a, and I. E. Shparlinski, On oracle factoring of integers, J. Complexity 76 (2023), article 101741. https://doi.org/10.1016/j.jco.2023.101741 doi:10.1016/j.jco.2023.101741 .DOI
  56. N. Gupta, A. Sikarov, and I. Volkovich, A computational perspective on Carmichael numbers, ECCC Report TR26-212 (2026), preprint. https://eccc.weizmann.ac.il/report/2026/212/ primary preprint .link
  57. J. Hoffstein and P. Lockhart, Coefficients of Maass forms and the Siegel zero, Ann. of Math. (2) 140 (1994), 161--176. https://doi.org/10.2307/2118543 doi:10.2307/2118543 .DOI
  58. D. Goldfeld, J. Hoffstein, and D. Lieman, Appendix: An effective zero-free region, Ann. of Math. (2) 140 (1994), 177--181. https://doi.org/10.2307/2118544 doi:10.2307/2118544 .DOI
  59. O. Klurman, A. P. Mangerel, and J. Teräväinen, Multiplicative functions in short arithmetic progressions, Proc. London Math. Soc. (3) 127 (2023), 366--446. https://doi.org/10.1112/plms.12546 doi:10.1112/plms.12546 ; https://pure.mpg.de/rest/items/item_3521580/component/file_3524771/content published open-access copy .DOI
  60. A. Herlédan Le Merdy and B. Wesolowski, Unconditional foundations for supersingular isogeny-based cryptography, Theory of Cryptography--TCC 2025 , LNCS 16270 (2026), 266--297; first online 3 December 2025. https://doi.org/10.1007/978-3-032-12296-4_9 doi:10.1007/978-3-032-12296-4_9 ; https://arxiv.org/abs/2502.17010 author's minor revision, version 2, 2 February 2026 .DOI
  61. K. Eisenträger, S. Hallgren, K. Lauter, T. Morrison, and C. Petit, Supersingular isogeny graphs and endomorphism rings: reductions and solutions, EUROCRYPT 2018 , LNCS 10822 , 329--368. https://doi.org/10.1007/978-3-319-78372-7_11 doi:10.1007/978-3-319-78372-7_11 .DOI
  62. B. Wesolowski, The supersingular isogeny path and endomorphism ring problems are equivalent, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , 1100--1111. https://doi.org/10.1109/FOCS52979.2021.00109 doi:10.1109/FOCS52979.2021.00109 ; https://arxiv.org/abs/2111.01481 full version .DOI
  63. F. Balestrieri, A. Johnson, and R. Newton, Explicit uniform bounds for Brauer groups of singular K3 surfaces, Ann. Inst. Fourier 73 (2023), 567--607. https://doi.org/10.5802/aif.3526 doi:10.5802/aif.3526 .DOI
  64. É. Gaudron and G. Rémond, Nouveaux théorèmes d'isogénie, Mém. Soc. Math. France (N.S.) 176 (2023), 1--123. https://doi.org/10.24033/msmf.484 doi:10.24033/msmf.484 .DOI
  65. A. Kresch and Y. Tschinkel, Effectivity of Brauer--Manin obstructions on surfaces, Adv. Math. 226 (2011), 4131--4144. https://doi.org/10.1016/j.aim.2010.11.012 doi:10.1016/j.aim.2010.11.012 .DOI
  66. B. Poonen, D. Testa, and R. van Luijk, Computing Néron--Severi groups and cycle class groups, Compos. Math. 151 (2015), 713--734. https://doi.org/10.1112/S0010437X14007878 doi:10.1112/S0010437X14007878 .DOI
  67. J. Thorner and A. Zaman, A unified and improved Chebotarev density theorem, Algebra Number Theory 13 (2019), 1039--1068. https://doi.org/10.2140/ant.2019.13.1039 doi:10.2140/ant.2019.13.1039 .DOI
  68. G. Ivanyos, M. Karpinski, L. Rónyai, and N. Saxena, Trading GRH for algebra: algorithms for factoring polynomials and related structures, Math. Comp. 81 (2012), 493--531. https://doi.org/10.1090/S0025-5718-2011-02505-6 doi:10.1090/S0025-5718-2011-02505-6 ; https://www.cse.iitk.ac.in/users/nitin/papers/nogrh.pdf published author copy .DOI
  69. I. Khayutin, Joint equidistribution of CM points, Ann. of Math. (2) 189 (2019), 145--276. https://doi.org/10.4007/annals.2019.189.1.4 doi:10.4007/annals.2019.189.1.4 .DOI
  70. P. Habegger, Weakly bounded height on modular curves, Acta Math. Vietnam. 35 (2010), no. 1, 43--69. https://math.ac.vn/uploads/files/1001043.pdf Published paper .link
  71. B. Edixhoven and R. Richard, A mod pp variant of the André--Oort conjecture, Rend. Circ. Mat. Palermo (2) 69 (2020), 151--157. https://doi.org/10.1007/s12215-018-00392-y doi:10.1007/s12215-018-00392-y .DOI
  72. N. Balaji, S. Perifel, M. Shirmohammadi, and J. Worrell, Cyclotomic identity testing and applications, Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation (ISSAC '21) (2021), 35--42. https://doi.org/10.1145/3452143.3465530 doi:10.1145/3452143.3465530 .DOI
  73. N. Balaji, K. Nosan, M. Shirmohammadi, and J. Worrell, Identity testing for radical expressions, Proceedings of the 37th ACM/IEEE Symposium on Logic in Computer Science (LICS '22) (2022), article 8, 1--11. https://doi.org/10.1145/3531130.3533331 doi:10.1145/3531130.3533331 .DOI
  74. C. Rasmussen and A. Tamagawa, Arithmetic of abelian varieties with constrained torsion, Trans. Amer. Math. Soc. 369 (2017), no. 4, 2395--2424. https://doi.org/10.1090/tran/6790 doi:10.1090/tran/6790 .DOI
  75. P. Pollack and P. Schorn, Dirichlet's proof of the three-square theorem: An algorithmic perspective, Math. Comp. 88 (2019), no. 316, 1007--1019. https://doi.org/10.1090/mcom/3349 doi:10.1090/mcom/3349 .DOI
  76. P. Hough, A lower bound for biases amongst products of two primes, Res. Number Theory 3 (2017), article 19. https://doi.org/10.1007/s40993-017-0083-9 doi:10.1007/s40993-017-0083-9 .DOI
  77. R. C. Daileda, Non-abelian number fields with very large class numbers, Acta Arith. 125 (2006), 215--255. https://doi.org/10.4064/aa125-3-2 doi:10.4064/aa125-3-2 .DOI
  78. B. S. Banwait, Explicit isogenies of prime degree over quadratic fields, Int. Math. Res. Not. 2023 , no. 14, 11829--11876. https://doi.org/10.1093/imrn/rnac134 doi:10.1093/imrn/rnac134 .DOI
  79. B. S. Banwait and M. Derickx, Explicit isogenies of prime degree over number fields, Algebra Number Theory 19 (2025), no. 6, 1147--1197. https://doi.org/10.2140/ant.2025.19.1147 doi:10.2140/ant.2025.19.1147 .DOI
  80. S. Gao, On the deterministic complexity of factoring polynomials, J. Symbolic Comput. 31 (2001), 19--36. https://doi.org/10.1006/jsco.1999.1001 doi:10.1006/jsco.1999.1001 .DOI
  81. L. Rónyai, Factoring polynomials over finite fields, J. Algorithms 9 (1988), 391--400. https://doi.org/10.1016/0196-6774(88)90029-6 doi:10.1016/0196-6774(88)90029-6 .DOI
  82. P. Pollack, The smallest inert prime in a cyclic number field of prime degree, Math. Res. Lett. 20 (2013), 163--179. https://doi.org/10.4310/MRL.2013.v20.n1.a13 doi:10.4310/MRL.2013.v20.n1.a13 ; https://pollack.uga.edu/cyclic.pdf Author's copy .DOI
  83. J.-H. Ahn and S.-H. Kwon, The class groups of the imaginary Abelian number fields with Galois group (Z/2Z)n( Z/2 Z)^n, Bull. Austral. Math. Soc. 70 (2004), 267--277. https://doi.org/10.1017/S0004972700034481 doi:10.1017/S0004972700034481 .DOI
  84. G. Binyamini, Point counting for foliations over number fields, Forum Math. Pi 10 (2022), e6, 1--39. https://doi.org/10.1017/fmp.2021.20 doi:10.1017/fmp.2021.20 .DOI
  85. P. Habegger, Weakly bounded height on modular curves, Acta Math. Vietnam. 35 (2010), 43--69. https://math.ac.vn/uploads/files/1001043.pdf Published paper .link
  86. F. Campagna, Effective bounds on differences of singular moduli that are SS-units, Math. Proc. Cambridge Philos. Soc. 174 (2023), 415--450. https://doi.org/10.1017/S0305004122000378 doi:10.1017/S0305004122000378 ; https://arxiv.org/abs/2102.06396 Author preprint .DOI
  87. F. Campagna, On singular moduli that are SS-units, Manuscripta Math. 166 (2021), 73--90. https://doi.org/10.1007/s00229-020-01230-1 doi:10.1007/s00229-020-01230-1 .DOI
  88. A. Granville and K. Soundararajan, Large character sums, J. Amer. Math. Soc. 14 (2001), 365--397. https://doi.org/10.1090/S0894-0347-00-00357-X doi:10.1090/S0894-0347-00-00357-X ; https://dms.umontreal.ca/ andrew/PDF/ChiSums.pdf Author's copy .DOI
  89. A. Granville, A. J. Harper, and K. Soundararajan, A new proof of Halász's theorem, and its consequences, Compos. Math. 155 (2019), 126--163. https://doi.org/10.1112/S0010437X18007522 doi:10.1112/S0010437X18007522 ; https://arxiv.org/abs/1706.03749 Author preprint .DOI
  90. G. Binyamini, with an appendix by E. Kowalski, Some effective estimates for André--Oort in Y(1)nY(1)^n, J. Reine Angew. Math. 767 (2020), 17--35. https://doi.org/10.1515/crelle-2019-0028 doi:10.1515/crelle-2019-0028 ; https://arxiv.org/abs/1809.05302 Author preprint .DOI
  91. B. Kane, Representations of integers by ternary quadratic forms, Int. J. Number Theory 6 (2010), 127--158. https://doi.org/10.1142/S1793042110002831 doi:10.1142/S1793042110002831 .DOI
  92. W. Duke and R. Schulze-Pillot, Representation of integers by positive ternary quadratic forms and equidistribution of lattice points on ellipsoids, Invent. Math. 99 (1990), 49--57. https://doi.org/10.1007/BF01234411 doi:10.1007/BF01234411 ; https://www.math.ucla.edu/ wdduke/preprints/lattice2.pdf Author's copy .DOI
  93. W. Duke, On ternary quadratic forms, J. Number Theory 110 (2005), 37--43. https://doi.org/10.1016/j.jnt.2004.06.013 doi:10.1016/j.jnt.2004.06.013 ; https://www.math.ucla.edu/ wdduke/preprints/ternary.pdf Author's copy .DOI
  94. R. Schulze-Pillot, Darstellungsmaß e von Spinorgeschlechtern ternärer quadratischer Formen, J. Reine Angew. Math. 352 (1984), 114--132. https://gdz.sub.uni-goettingen.de/download/pdf/PPN243919689_0352/LOG_0010.pdf Original published paper .link
  95. B. Kane, CM liftings of supersingular elliptic curves, J. Théor. Nombres Bordeaux 21 (2009), 635--663. https://doi.org/10.5802/jtnb.692 doi:10.5802/jtnb.692 .DOI
  96. N. D. Elkies, K. Ono, and T. Yang, Reduction of CM elliptic curves and modular function congruences, Int. Math. Res. Not. 2005 (2005), no. 44, 2695--2707. https://arxiv.org/abs/math/0512350 Author preprint .link
  97. OpenAI, The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane s>7/8 s>7/8 , 30 September 2026, Theorem 1.1. https://github.com/openai/math/tree/main/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026 Official manuscript and source .link
  98. OpenAI, The Quasi-Riemann Hypothesis , 5 October 2026, companion proof of the 11/1211/12 boundary. https://github.com/openai/math/tree/main/preprints/The-Quasi-Riemann-Hypothesis-October-5-2026 Official manuscript and source .link
  99. H. Davenport, Multiplicative Number Theory , 3rd ed., revised by H. L. Montgomery, Springer, 2000.
  100. J. E. Littlewood, On the class-number of the corpus P(−k)P( -k ), Proc. London Math. Soc. (2) 27 (1928), 358--372.
  101. J. B. Friedlander and H. Iwaniec, A note on Dirichlet LL-functions, Exposition. Math. 36 (2018), 343--350. https://doi.org/10.1016/j.exmath.2018.06.003 doi:10.1016/j.exmath.2018.06.003 ; https://arxiv.org/abs/1701.03771 author preprint .DOI
  102. E. Jeřábek, Integer factoring and modular square roots, J. Comput. Syst. Sci. 82 (2016), 380--394. https://doi.org/10.1016/j.jcss.2015.08.001 doi:10.1016/j.jcss.2015.08.001 .DOI
  103. L. Adleman, K. Manders, and G. Miller, On taking roots in finite fields, 18th Annual Symposium on Foundations of Computer Science (1977), 175--178. https://www.cs.cmu.edu/ glmiller/Publications/AMM77.pdf Original paper .link
  104. J. D. Achter and E. W. Howe, Split abelian surfaces over finite fields and reductions of genus-2 curves, Algebra Number Theory 11 (2017), 39--76. https://doi.org/10.2140/ant.2017.11.39 doi:10.2140/ant.2017.11.39 .DOI
  105. V. Arul, J. Booher, S. R. Groen, E. W. Howe, W. Li, V. Matei, R. Pries, and C. Springer, Doubly isogenous genus-2 curves with D4D_4-action, Math. Comp. 93 (2024), 347--381. https://doi.org/10.1090/mcom/3891 doi:10.1090/mcom/3891 .DOI
  106. R. Schoof, Nonsingular plane cubic curves over finite fields, J. Combin. Theory Ser. A 46 (1987), 183--211.
  107. A. Granville and K. Soundararajan, Large character sums: pretentious characters and the Pólya--Vinogradov theorem, J. Amer. Math. Soc. 20 (2007), 357--384. https://doi.org/10.1090/S0894-0347-06-00536-4 doi:10.1090/S0894-0347-06-00536-4 .DOI
  108. H. L. Montgomery and R. C. Vaughan, Exponential sums with multiplicative coefficients, Invent. Math. 43 (1977), 69--82. https://doi.org/10.1007/BF01390204 doi:10.1007/BF01390204 .DOI
  109. D. W. Boyd and H. Kisilevsky, On the exponent of the ideal class groups of complex quadratic fields, Proc. Amer. Math. Soc. 31 (1972), 433--436. https://doi.org/10.1090/S0002-9939-1972-0289454-4 doi:10.1090/S0002-9939-1972-0289454-4 .DOI
  110. A.-S. Elsenhans, J. Klüners, and F. Nicolae, Imaginary quadratic number fields with class groups of small exponent, Acta Arith. 193 (2020), 217--233. https://doi.org/10.4064/aa180220-20-3 doi:10.4064/aa180220-20-3 ; https://arxiv.org/abs/1803.02056 author preprint .DOI
  111. A.-S. Elsenhans, J. Klüners, and F. Nicolae, Imaginary quadratic fields with small exponent , author-maintained tables, accessed 9 October 2026. https://math.uni-paderborn.de/en/ag/ca/research/exponent/exponent0 Complete tables .link
  112. E. Kani, Idoneal numbers and some generalizations, Ann. Sci. Math. Québec 35 (2011), 197--227. https://www.labmath.uqam.ca/ annales/volumes/35-2/PDF/197-227.pdf Published paper .link
  113. A. Bourdon and P. Pollack, Torsion subgroups of CM elliptic curves over odd degree number fields, Int. Math. Res. Not. 2017 (2017), no. 16, 4923--4961. https://doi.org/10.1093/imrn/rnw163 doi:10.1093/imrn/rnw163 ; https://arxiv.org/abs/1601.00351 author preprint .DOI
  114. P. T. Joshi, The size of $L(1,ḩi)$ for real nonprincipal residue characters $ḩi$ with prime modulus, J. Number Theory 2 (1970), 58--73.
  115. M. Schütt, CM newforms with rational coefficients, Ramanujan J. 19 (2009), 187--205. https://doi.org/10.1007/s11139-008-9147-8 doi:10.1007/s11139-008-9147-8 ; https://arxiv.org/abs/math/0511228 author preprint .DOI
  116. H. Pasten, Shimura curves and the abc conjecture, J. Number Theory 254 (2024), 214--335. https://doi.org/10.1016/j.jnt.2023.07.002 doi:10.1016/j.jnt.2023.07.002 ; https://www.mat.uc.cl/ hector.pasten/preprints/ShABC.pdf author manuscript .DOI
  117. N. D. Elkies and M. Schütt, Modular forms and K3 surfaces, Adv. Math. 240 (2013), 106--131. https://doi.org/10.1016/j.aim.2013.03.008 doi:10.1016/j.aim.2013.03.008 ; https://arxiv.org/abs/0809.0830 author preprint .DOI
  118. E. Kani, The moduli spaces of Jacobians isomorphic to a product of two elliptic curves, Collect. Math. 67 (2016), 21--54. https://doi.org/10.1007/s13348-015-0148-9 doi:10.1007/s13348-015-0148-9 .DOI
  119. X. Wei, Smallness of Faltings heights of CM abelian varieties, J. Number Theory 242 (2023), 73--101. https://doi.org/10.1016/j.jnt.2022.07.007 doi:10.1016/j.jnt.2022.07.007 .DOI
  120. H. M. Stark, Some effective cases of the Brauer--Siegel theorem, Invent. Math. 23 (1974), 135--152. https://doi.org/10.1007/BF01405166 doi:10.1007/BF01405166 .DOI
  121. K.-Y. Chang and S.-H. Kwon, The imaginary abelian number fields with class numbers equal to their genus class numbers, J. Théor. Nombres Bordeaux 12 (2000), 349--365. https://doi.org/10.5802/jtnb.283 doi:10.5802/jtnb.283 .DOI
  122. I. Miyada, On imaginary abelian number fields of type (2,2,,2)(2,2, ,2) with one class in each genus, Manuscripta Math. 88 (1995), 535--540. https://doi.org/10.1007/BF02567840 doi:10.1007/BF02567840 .DOI
  123. S. Louboutin, The exponent three class group problem for some real cyclic cubic number fields, Proc. Amer. Math. Soc. 130 (2002), 353--361. https://doi.org/10.1090/S0002-9939-01-06168-8 doi:10.1090/S0002-9939-01-06168-8 .DOI
  124. F. Lemmermeyer and A. Pethő, Simplest cubic fields, Manuscripta Math. 88 (1995), 53--58. https://doi.org/10.1007/BF02567804 doi:10.1007/BF02567804 ; https://arxiv.org/abs/1202.6022 author preprint .DOI
  125. S. Louboutin and M. F. Newman, On the diophantine equation xy+yz+zx=dxy+yz+zx=d, Acta Math. Inform. Univ. Ostraviensis 6 (1998), 155--158. https://dml.cz/handle/10338.dmlcz/120528 Published paper .link
  126. J. S. Ellenberg and A. Venkatesh, Reflection principles and bounds for class group torsion, Int. Math. Res. Not. 2007 (2007), article rnm002, 18 pp. https://doi.org/10.1093/imrn/rnm002 doi:10.1093/imrn/rnm002 .DOI
  127. D. R. Heath-Brown, $ $-Torsion in class groups via Dirichlet LL-functions, Int. J. Number Theory (2026). https://doi.org/10.1142/S1793042126500168 doi:10.1142/S1793042126500168 ; https://arxiv.org/abs/2412.07701v2 Author version .DOI
  128. S. Chan and P. Koymans, A new pointwise bound for 33-torsion of class groups, arXiv:2505.00611 (2025). Prior-art comparison only. https://arxiv.org/abs/2505.00611 Author preprint .arXiv
  129. R. J. Lemke Oliver and A. Zaman, Improving the trivial bound for $ $-torsion in class groups, arXiv:2502.03464 (2025). Prior-art comparison only. https://arxiv.org/abs/2502.03464 Author preprint .arXiv
  130. M. N. Walsh, Stability under scaling in the local phases of multiplicative functions, Invent. Math. 241 (2025), 325--362. https://doi.org/10.1007/s00222-025-01343-y doi:10.1007/s00222-025-01343-y ; https://arxiv.org/abs/2310.07873 author-linked full version .DOI
  131. K. Matomäki, M. Radziwiłł, and T. Tao, Fourier uniformity of bounded multiplicative functions in short intervals on average, Invent. Math. 220 (2020), 1--58. https://doi.org/10.1007/s00222-019-00926-w doi:10.1007/s00222-019-00926-w .DOI
  132. R. A. Mollin, Class number two for real quadratic fields of Richaud--Degert type, Serdica Math. J. 35 (2009), 287--300. https://www.math.bas.bg/serdica/2009/2009-287-300.pdf Published paper .link
  133. T. Tatuzawa, On a theorem of Siegel, Japanese J. Math. 21 (1951), 163--178. https://doi.org/10.4099/jjm1924.21.0_163 doi:10.4099/jjm1924.21.0_163 .DOI
  134. S. R. Louboutin, Ideal class groups of some quadratic number fields and factorization of values of some quadratic polynomials, Czechoslovak Math. J. 76 (2026), 677--697. https://articles.math.cas.cz/10.21136/CMJ.2026.0455-25 Publisher record ; https://arxiv.org/abs/2511.15243 author version .DOI
  135. A. P. Mangerel, On a rigidity property for quadratic Gauss sums, Mathematika 72 (2026), no. 1, e70061, 30 pp. https://doi.org/10.1112/mtk.70061 doi:10.1112/mtk.70061 .DOI
  136. A. Granville and K. Soundararajan, The spectrum of multiplicative functions, Ann. of Math. (2) 153 (2001), 407--470. https://doi.org/10.2307/2661346 doi:10.2307/2661346 .DOI
  137. E. Sofos, Statistics of small prime quadratic non-residues, Rend. Semin. Mat. Univ. Politec. Torino 80 (2022), no. 1, 73--85. https://seminariomatematico.polito.it/rendiconti/80-1/Sofos.pdf Published paper .link
  138. R. Mrazović, A random model for the Paley graph, Q. J. Math. 68 (2017), 193--206. https://doi.org/10.1093/qmath/haw037 doi:10.1093/qmath/haw037 .DOI
  139. H. L. Montgomery, Topics in Multiplicative Number Theory , Lecture Notes in Mathematics 227 , Springer, 1971.
  140. S. Louboutin, Prime producing quadratic polynomials and class-numbers of real quadratic fields, Canad. J. Math. 42 (1990), no. 2, 315--341. https://doi.org/10.4153/CJM-1990-018-3 doi:10.4153/CJM-1990-018-3 .DOI
  141. A. Biró and K. Lapkova, The class number one problem for the real quadratic fields Q((an)2+4a) Q( (an)^2+4a ), Acta Arith. 172 (2016), no. 2, 117--131. https://doi.org/10.4064/aa7957-12-2015 doi:10.4064/aa7957-12-2015 .DOI
  142. J. Lee, The complete determination of wide Richaud--Degert types which are not 55 modulo 88 with class number one, Acta Arith. 140 (2009), no. 1, 1--29. https://doi.org/10.4064/aa140-1-1 doi:10.4064/aa140-1-1 .DOI
  143. M. Mourtada and V. Kumar Murty, Omega theorems for $ L' L(1,ḩi_D)$, Int. J. Number Theory 9 (2013), no. 3, 561--581. https://doi.org/10.1142/S1793042112501485 doi:10.1142/S1793042112501485 .DOI
  144. M. Mourtada, The distribution of values of logarithmic derivatives of real LL-functions , Ph.D. thesis, University of Toronto, 2013, Chapter 4, especially Theorem 17. https://collectionscanada.gc.ca/obj/thesescanada/vol2/OTU/TC-OTU-35913.pdf Author's full thesis .link
  145. A. I. Badzyan, The Euler--Kronecker constant, Math. Notes 87 (2010), 31--42; Russian original, Mat. Zametki 87 (2010), 35--47. https://doi.org/10.1134/S0001434610010050 English publication ; https://doi.org/10.4213/mzm4736 Russian original .DOI
  146. K. Ford, F. Luca, and P. Moree, Values of the Euler $ǎrphi$-function not divisible by a given odd prime, and the distribution of Euler--Kronecker constants for cyclotomic fields, Math. Comp. 83 (2014), 1447--1476. https://doi.org/10.1090/S0025-5718-2013-02749-4 doi:10.1090/S0025-5718-2013-02749-4 ; https://arxiv.org/abs/1108.3805v3 Revised author version, with the numbering used here .DOI
  147. P. L. Clark, T. Genao, P. Pollack, and F. Saia, The least degree of a CM point on a modular curve, J. London Math. Soc. (2) 105 (2022), 825--883. https://doi.org/10.1112/jlms.12518 doi:10.1112/jlms.12518 ; https://www.pollack-math.net/leastdeg-errata.pdf Author errata, 4 May 2026 .DOI
  148. B. Green and T. Tao, The Möbius function is strongly orthogonal to nilsequences, Ann. of Math. (2) 175 (2012), 541--566. https://doi.org/10.4007/annals.2012.175.2.3 doi:10.4007/annals.2012.175.2.3 .DOI
  149. B. Green and T. Tao, The quantitative behaviour of polynomial orbits on nilmanifolds, Ann. of Math. (2) 175 (2012), 465--540. https://doi.org/10.4007/annals.2012.175.2.2 doi:10.4007/annals.2012.175.2.2 ; correction, Ann. of Math. (2) 179 (2014), 1175--1183, https://doi.org/10.4007/annals.2014.179.3.8 doi:10.4007/annals.2014.179.3.8 .DOI

Version history

  1. v1Submitted by Shubhrajit BhattacharyaInitial depositCurrentOct 10, 2026