A Fast Algorithm to Compute l(1/2, f x \chi_q)
Number Theory
2012-02-29 v1
Abstract
Let be a fixed (holomorphic or Maass) modular cusp form. Let be a Dirichlet character mod . We describe a fast algorithm that computes the value up to any specified precision. In the case when is smooth or highly composite integer, the time complexity of the algorithm is given by .
Cite
@article{arxiv.1202.6303,
title = {A Fast Algorithm to Compute l(1/2, f x \chi_q)},
author = {Pankaj Vishe},
journal= {arXiv preprint arXiv:1202.6303},
year = {2012}
}