Large sieve methods in algebraic number fields
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.
- A summation formula in algebraic number fields and applications. I
- A variant of the large sieve inequality with explicit constants
- An induction principle for the Bombieri-Vinogradov theorem over \(\mathbb{F}_q [t]\) and a variant of the Ttchmarsh divisor problem
- Experiments on the Linear Algebra Step in the Number Field Sieve
- On the large sieve inequality in an algebraic number field
- scientific article; zbMATH DE number 4063217 (Why is no real title available?)
- scientific article; zbMATH DE number 1182983 (Why is no real title available?)
- Mass equidistribution of Hilbert modular eigenforms
- scientific article; zbMATH DE number 3440517 (Why is no real title available?)
- scientific article; zbMATH DE number 3249878 (Why is no real title available?)
- Higher-dimensional sieving for the number field sieve algorithms
- On variants of the larger sieve
This page was built for publication: Large sieve methods in algebraic number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076717)