EXPLICIT ZERO-COUNTING THEOREM FOR HECKE–LANDAU ZETA-FUNCTIONS
From MaRDI portal
Publication:5269717
Cites work
- scientific article; zbMATH DE number 3474264 (Why is no real title available?)
- An algorithmic construction of finite elliptic curves of order divisible by a large prime
- An estimate of the order of the Hecke-Landau \(\zeta\) (s,\(\chi\) )- functions
- An improved upper bound for the argument of the Riemann zeta-function on the critical line
- An improved upper bound for the argument of the Riemann zeta-function on the critical line. II
- An improved upper bound for the error in the zero-counting formulae for Dirichlet \(L\)-functions and Dedekind zeta-functions
- Explicit Bounds for Some Functions of Prime Numbers
- Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
- Explicit zero density theorems for Dedekind zeta functions
- Some effective estimates for the roots of the Dirichlet L-series. II
This page was built for publication: EXPLICIT ZERO-COUNTING THEOREM FOR HECKE–LANDAU ZETA-FUNCTIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269717)