A higher-dimensional sieve method: with procedures for computing sieve functions

Nearly a hundred years have passed since Viggo Brun invented his famous sieve, and the use of sieve methods is constantly evolving. As probability and combinatorics have penetrated the fabric of mathematical activity, sieve methods have become more versatile and sophisticated and in recent years have played a part in some of the most spectacular mathematical discoveries. Many arithmetical investigations encounter a combinatorial problem that requires a sieving argument, and this tract offers a modern and reliable guide in such situations. The theory of higher dimensional sieves is thoroughly explored, and examples are provided throughout. A Mathematica(r) software package for sieve-theoretical calculations is provided on the authors' website. To further benefit readers, the Appendix describes methods for computing sieve functions. These methods are generally applicable to the computation of other functions used in analytic number theory. The appendix also illustrates features of Mathematica(r) which aid in the computation of such functions. Fully explains the theory of higher dimensional sieves using many examples. Modern and reliable guide for researchers needing to solve combinatorial problems with sieving arguments. Computational methods are explained in detail in an appendix and on the accompanying website INDICE: List of tables; List of illustrations; Preface; Notation; Part I. Sieves: 1. Introduction; 2. Selberg's sieve method; 3. Combinatorial foundations; 4. The fundamental Lemma; 5. Selberg's sieve method (continued); 6. Combinatorial foundations (continued); 7. The case ? = 1: the linear sieve; 8. An application of the linear sieve; 9. A sieve method for ? > 1; 10. Some applications of Theorem 9.1; 11. A weighted sieve method; Part II. Proof of the Main Analytic Theorem: 12. Dramatis personae and preliminaries; 13. Strategy and a necessary condition; 14. Estimates of s? (u) = j? (u/2); 15. The p? and q? functions; 16. The zeros of ?-2 and ?; 17. The parameters s? and ß?; 18. Propertiesof F? and f?; Appendix 1. Methods for computing sieve functions; Bibliography; Index

• ISBN: 978-0-521-89487-6
• Editorial: Cambridge University
• Encuadernacion: Cartoné
• Páginas: 290
• Fecha Publicación: 16/10/2008
• Nº Volúmenes: 1
• Idioma: Inglés