English

Numerical computation of Petersson inner products and $q$-expansions

Number Theory 2018-02-28 v1

Abstract

In this paper we discuss the problem of numerically computing Petersson inner products of modular forms, given their qq-expansion at \infty. A formula of Nelson reduces this to obtaining qq-expansions at all cusps, and we describe two algorithms based on linear interpolation for numerically obtaining such expansions. We apply our methods to numerically verify constants arising in an explicit version of Ichino's triple-product formula relating fg,h\langle fg,h\rangle to the central value of L(f×g×hˉ,s)L(f\times g\times \bar{h},s), for three modular forms f,g,hf,g,h of compatible weights and characters.

Keywords

Cite

@article{arxiv.1802.09740,
  title  = {Numerical computation of Petersson inner products and $q$-expansions},
  author = {Dan J. Collins},
  journal= {arXiv preprint arXiv:1802.09740},
  year   = {2018}
}

Comments

24 pages, comments welcome. Associated SageMath code available at http://www.math.ubc.ca/~dcollins/code/index.html