Mathematics of Computation · 1992 · 57 citations · 3 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsNumber TheoryAlgebraic Number TheoryCombinatorial Number TheoryModular FormsNumber-theoretic AlgorithmsArithmetic Of Fourier CoefficientsComputing Zeta FunctionsFourier Coefficients Of Arithmetic FunctionsModular Form ComputationsSiegel Modular Forms
We explain the basic notions and theorems for doing computations in the theory of Siegel modular forms of degree two, on the full modular group and of even weight. This synopsis concludes with a handy and computationally realistic algorithm for tabulating the Fourier coefficients of such forms and the Euler factors of their Spinor zeta functions. In the second part of this paper we present and discuss some of the results of actual computations which we performed following this algorithm. We point out two (theoretically) striking phenomena that are implied by the results of these computations.
3