Mathematics – Number Theory
Scientific paper
2012-02-28
Mathematics
Number Theory
Scientific paper
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)})$.
No associations
LandOfFree
A Fast Algorithm to Compute l(1/2, f x χ_q) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Fast Algorithm to Compute l(1/2, f x χ_q), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm to Compute l(1/2, f x χ_q) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-612610