DeepAI AI Chat
Log In Sign Up

Rapid computation of special values of Dirichlet L-functions

by   Fredrik Johansson, et al.

We consider computing the Riemann zeta function ζ(s) and Dirichlet L-functions L(s,χ) to p-bit accuracy for large p. Using the approximate functional equation together with asymptotically fast computation of the incomplete gamma function, we observe that p^3/2+o(1) bit complexity can be achieved if s is an algebraic number of fixed degree and with algebraic height bounded by O(p). This is an improvement over the p^2+o(1) complexity of previously published algorithms and yields, among other things, p^3/2+o(1) complexity algorithms for Stieltjes constants and n^3/2+o(1) complexity algorithms for computing the nth Bernoulli number or the nth Euler number exactly.


page 1

page 2

page 3

page 4


Efficient computation of some special functions

We introduce a new algorithm to efficiently compute the functions belong...

Fast evaluation of some p-adic transcendental functions

We design algorithms for computing values of many p-adic elementary and ...

On the inverses of Kasami and Bracken-Leander exponents

We explicitly determine the binary representation of the inverse of all ...

Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets

Let R be a real closed field and D⊂R an ordered domain. We consider the ...

Formalization of p-adic L-functions in Lean 3

The Euler–Riemann zeta function is a largely studied numbertheoretic obj...