Computing L-functions with large conductor
Jeffrey Stopple
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 21000 dihedral Galois representations with conductor near 107. The data shows good agreement with a symplectic random matrix model. Also included are an elliptic curve L-function and one for a quadratic Dirichlet character.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu