Exact computation of the discriminants of Abelian extensions (Q5939715): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2315306795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Topics in Computional Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Densité des discriminants des extensions cycliques de degré premier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of discriminants of cyclic extensions of prime degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting discriminants of number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit estimates for summatory functions linked to the Möbius \(\mu\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Summation of the Möbius Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123961 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:02, 3 June 2024

scientific article; zbMATH DE number 1626651
Language Label Description Also known as
English
Exact computation of the discriminants of Abelian extensions
scientific article; zbMATH DE number 1626651

    Statements

    Exact computation of the discriminants of Abelian extensions (English)
    0 references
    0 references
    0 references
    30 July 2001
    0 references
    The author gives an exact count of the number of automorphism classes of abelian extensions of degree \(\geq 4\) by using the Dirichlet series for enumerating such fields (from class field theory). The secret lies in powerful summatory methods based on the classical ``hyperbola'' method for summing the divisor function. An error estimate is also given for the computer time.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discriminant density
    0 references
    automorphism classes
    0 references
    abelian extensions
    0 references
    Dirichlet series
    0 references
    summatory methods
    0 references
    error estimate
    0 references
    computer time
    0 references
    0 references