Large sieve methods in algebraic number fields (Q1076717): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1158207
Property / author
 
Property / author: Juergen G. Hinz / rank
Normal rank
 

Revision as of 14:54, 22 February 2024

scientific article
Language Label Description Also known as
English
Large sieve methods in algebraic number fields
scientific article

    Statements

    Large sieve methods in algebraic number fields (English)
    0 references
    1987
    0 references
    Several mathematicians have established multidimensional versions of the large sieve procedure for use in algebraic number fields. The most important advances were made by Wilson, Huxley and Schaal. Our intent here is to complement these expositions by giving simple derivations of Gallagher's character sum form as well as of Montgomery's arithmetic formulation of the large sieve in the language of an algebraic number field. In our approach the basic inequality for exponential sums is proved in a character sum form involving proper additive characters. Now it is possible to extend to number fields the important Bombieri-Vinogradov theorem on the average distribution of primes in arithmetic progressions. We may return to this problem in a future paper.
    0 references
    algebraic number fields
    0 references
    Gallagher's character sum
    0 references
    Montgomery's arithmetic formulation
    0 references
    large sieve
    0 references
    Bombieri-Vinogradov theorem
    0 references
    primes in arithmetic progressions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references