The system will be going down for regular maintenance. Please save your work and logout.
Haberland's formula and numerical computation of Petersson scalar products
COHEN, Henri
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
COHEN, Henri
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Communication dans un congrès
This item was published in
ANTS X, 2012, San Diego. 2013, vol. 1, p. 249-270
Mathematical Sciences Publisher
English Abstract
We study several methods for the numerical computation of Petersson scalar products, and in particular we prove a generalization of Haberland's formula to any subgroup of finite index G of Gamma = PSL_2 (Z), which gives a ...Read more >
We study several methods for the numerical computation of Petersson scalar products, and in particular we prove a generalization of Haberland's formula to any subgroup of finite index G of Gamma = PSL_2 (Z), which gives a fast method to compute these scalar products when a Hecke eigenbasis is not necessarily available.Read less <
European Project
Algorithmic Number Theory in Computer Science
Origin
Hal imported