zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A higher-dimensional sieve method. With procedures for computing sieve functions. (English) Zbl 1207.11099
Cambridge Tracts in Mathematics 177. Cambridge: Cambridge University Press (ISBN 978-0-521-89487-6/hbk). xxi, 266 p. £ 45.00; $ 90.00 (2008).

Let 𝒫 be a finite set of primes. For a finite integer sequence 𝒜 define

S(𝒜,𝒫)=|{a𝒜:(a,p)=1foranyp𝒫}|

and for any z1,

S(𝒜,𝒫,z)=|{a𝒜:(a,p)=1foranyp𝒫,pz}|·

The main purpose of the book is to give upper bounds (as well as lower bounds if possible) for the above two quantities. That goal is achieved via the so-called small sieve, a topic the authors have studied a lot (see e.g. the paper in collaboration with H.-E. Richert [“Combinatorial sieves of dimension exceeding one”, J. Number Theory 28, No. 3, 306–346 (1988; Zbl 0639.10031)] or the well-known [H. Halberstam and H.-E. Richert, Sieve methods. London: Academic Press, a subsidiary of Harcourt Brace Jovanovich, Publishers (1974; Zbl 0298.10026)]).

The first chapter of the book sets the most important notation and explains to what extent sieving techniques are well-suited for the study of various historical problems such as the twin prime conjecture.

The authors also define a parameter that plays a key role throughout the book: the dimension κ of the sieving problem considered. Chapter 2 then gives a very clear description of Selberg’s sieve. Selberg’s Theorem is used several times in the rest of the book and is a key tool for the proof of the main results contained in the monograph. For instance the “fundamental Lemma” (cf Chapter 4), valid for any value of the parameter κ, is proved using Selberg’s sieve. Selberg’s sieve method is also the main topic of another chapter of the book: Chapter 5. In that Chapter, a refined version of Selberg’s Theorem is proved. Together with what the authors call ”the combinatorial foundations” (which have a lot to do with the linear sieve of Iwaniec and Rosser), it is definitely the technical heart of what is needed to obtain the results of the following chapters.

The rest of the book focuses on new upper bounds and lower bounds for S(𝒜,𝒫,z). After considering the special case where κ=1 and discussing consequences for the twin prime conjecture, the authors state in Chapter 9 the main result of the book. It holds for any κ such that 2κ is an integer. The upper bound (as well as the lower bound) obtained for S(𝒜,𝒫,z) has the following shape:

XV(z)g κ logy logz+O(loglogy) 2 (logy) 1/(2κ+2) +2 my,m𝒫(z) 4 ν(m) |r 𝒜 (m)|

where y is a parameter such that 2yz and where g κ is not the same function for the upper bound and the lower bound.

Various applications of the main theorem are then given (e.g. a version of Mertens’ prime number formula for algebraic numbers), notably through a “weighted sieve” used to study the values taken by products of linear forms. The last part of the book deals with the study of the functions g κ appearing in the statement of the main result. Analytic properties of those functions are discussed. An appendix written by Galway describes computational techniques related to the sieving method the monograph deals with. Several tables are given so that the value of the sieving limit obtained via the new method can usefully be compared with previously known values (obtained e.g. by Iwaniec–Rosser).

Overall this monograph is quite technical and is mostly aimed at people with a reasonable background in sieving theory. However it is an excellent reference for anyone searching for the most up-to-date results in the theory.


MSC:
11N35Sieves
11N36Applications of sieve methods
11-02Research monographs (number theory)
Keywords:
sieve methods
Software:
Mathematica