English

A Fast Algorithm to Compute l(1/2, f x \chi_q)

Number Theory 2012-02-29 v1

Abstract

Let ff be a fixed (holomorphic or Maass) modular cusp form. Let \cq\cq be a Dirichlet character mod qq. We describe a fast algorithm that computes the value L(1/2,f×χq)L(1/2,f\times\chi_q) up to any specified precision. In the case when qq is smooth or highly composite integer, the time complexity of the algorithm is given by O(1+q5/6+o(1))O(1+|q|^{5/6+o(1)}).

Keywords

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}
}
R2 v1 2026-06-21T20:26:25.467Z