2012
DOI: 10.1090/s0025-5718-2012-02584-1
|View full text |Cite
|
Sign up to set email alerts
|

Numerical computation of a certain Dirichlet series attached to Siegel modular forms of degree two

Abstract: The Rankin convolution type Dirichlet series D F,G (s) of Siegel modular forms F and G of degree two, which was introduced by Kohnen and the second author, is computed numerically for various F and G. In particular, we prove that the series D F,G (s), which share the same functional equation and analytic behavior with the spinor L-functions of eigenforms of the same weight are not linear combinations of those. In order to conduct these experiments a numerical method to compute the Petersson scalar products of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 13 publications
(22 reference statements)
0
2
0
Order By: Relevance
“…However, for the discriminant form of Example 1.1, which is connected to classical Jacobi forms, we have the following corollary. Using elementary properties of Kronecker symbols it is easy to show that the formula in this corollary is equivalent to that of [39,Thm. 3].…”
Section: Statement Of the Main Resultmentioning
confidence: 98%
See 1 more Smart Citation
“…However, for the discriminant form of Example 1.1, which is connected to classical Jacobi forms, we have the following corollary. Using elementary properties of Kronecker symbols it is easy to show that the formula in this corollary is equivalent to that of [39,Thm. 3].…”
Section: Statement Of the Main Resultmentioning
confidence: 98%
“…The computational aspects were foremost in mind when we obtained these formulas; we needed efficient algorithms for the Weil representation in order to compute vector-valued Poincaré series [39] and harmonic weak Maass forms [6]. The formula stated in the Main Theorem is implemented as part of a package [1] written in Sage [48] for computing with finite quadratic modules.…”
Section: Introductionmentioning
confidence: 99%