Abstract

An algorithm is given to efficiently compute $L$-functions with large conductor in a restricted range of the critical strip. Examples are included for about 24000 dihedral Galois representations with conductor near $10^7$. The data shows good agreement with a symplectic random matrix model.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call