1998
DOI: 10.1007/bfb0054879
|View full text |Cite
|
Sign up to set email alerts
|

Computing the lead term of an abelian L-function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

1999
1999
2008
2008

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 6 publications
0
10
0
Order By: Relevance
“…Since then, hundreds of new examples have been computed over a variety of different base fields in [St4,DST1,DT,DTvW], always giving full confirmation of the refined conjecture to within the accuracy of the computations. Stark's conjecture may be used as an effective algorithm for computing an explicit generating polynomial of the Hilbert class field of a real quadratic field (see [St1] and [CR]).…”
Section: Stark's Refined Conjecture Over a Real Quadratic Fieldmentioning
confidence: 92%
“…Since then, hundreds of new examples have been computed over a variety of different base fields in [St4,DST1,DT,DTvW], always giving full confirmation of the refined conjecture to within the accuracy of the computations. Stark's conjecture may be used as an effective algorithm for computing an explicit generating polynomial of the Hilbert class field of a real quadratic field (see [St1] and [CR]).…”
Section: Stark's Refined Conjecture Over a Real Quadratic Fieldmentioning
confidence: 92%
“…For more details, see Lemma 5.1 of [12].) The values of L ð2Þ ð0; * wÞ can then be computed using the method of [2].…”
Section: Remarks On Computational Methodsmentioning
confidence: 99%
“…Section 3 develops a new formula to compute the element Φ f,T,p (1). We concentrate on the case where k is real quadratic although our technique should extend to other totally real fields.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We will essentially follow the method given in [8] with a slightly different computational approach. This method needs to work with the conductor of the character χ, but thanks to lemma 3.2, we know that this conductor is f = f 0 v for odd characters.…”
Section: Algorithm 35 Let a > 0 Be A Real Number And Let N ≥ 1 Be Amentioning
confidence: 99%