A fast algorithm to compute L(1/2, f x χq)

Research output: Contribution to journalArticlepeer-review


Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is smooth or highly composite integer, the time complexity of the algorithm is given by $O(1+|q|^{5/6+o(1)})$.
Original languageEnglish
Pages (from-to)1502-1524
Number of pages23
JournalJournal of Number Theory
Issue number5
Early online date23 Dec 2012
Publication statusPublished - May 2013

Bibliographical note

© 2012 Elsevier Inc. This is an author produced version of a paper published in Journal of Number Theory. Uploaded in accordance with the publisher's self-archiving policy.


  • math.NT

Cite this