2008
DOI: 10.1090/s0025-5718-08-02129-7
|View full text |Cite
|
Sign up to set email alerts
|

Computation of Maass waveforms with nontrivial multiplier systems

Abstract: Abstract. The aim of this paper is to describe efficient algorithms for computing Maass waveforms on subgroups of the modular group P SL(2, Z) with general multiplier systems and real weight. A selection of numerical results obtained with these algorithms is also presented. Certain operators acting on the spaces of interest are also discussed. The specific phenomena that were investigated include the Shimura correspondence for Maass waveforms and the behavior of the weight-k Laplace spectra for the modular sur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 53 publications
0
12
0
Order By: Relevance
“…The algorithm which we use to compute Maass forms and Eisenstein series was originally developed by Dennis A. Hejhal (based on an idea of Harold Stark) for computing Maass cusp forms on Hecke triangle groups [22,23]. Subsequently this algorithm was adapted by the author to other Fuchsian groups, non-trivial weights and multiplier systems and even harmonic weak Maass forms [12,64,65]. It was also generalized by Helen Avelin to compute Eisenstein series and Green's functions [5,6].…”
Section: On the Computation Of Maass Forms For General Subgroupsmentioning
confidence: 99%
“…The algorithm which we use to compute Maass forms and Eisenstein series was originally developed by Dennis A. Hejhal (based on an idea of Harold Stark) for computing Maass cusp forms on Hecke triangle groups [22,23]. Subsequently this algorithm was adapted by the author to other Fuchsian groups, non-trivial weights and multiplier systems and even harmonic weak Maass forms [12,64,65]. It was also generalized by Helen Avelin to compute Eisenstein series and Green's functions [5,6].…”
Section: On the Computation Of Maass Forms For General Subgroupsmentioning
confidence: 99%
“…It is interesting to evaluate numerically some examples of Theorem 4. This is possible thanks to computations done by Strömberg [61]. Note that half-integral weight Fourier coefficients, even in the holomorphic case, are notoriously difficult to compute.…”
Section: Weyl's Law Gives That Asmentioning
confidence: 99%
“…Except for a thin set arising from quadratic fields, there is no known explicit construction of these functions. Thus, for most Maass forms one must rely on computer calculations to determine numerical approximations [12,15,28]. Recently, such computations have been proven to be correct [5].…”
Section: Prior Methodsmentioning
confidence: 99%