|Table of Contents|| || || || || || |
CRM Proceedings & Lecture Notes
2008; 297 pp; softcover
List Price: US$102
Member Price: US$81.60
Order Code: CRMP/46
Additive Combinatorics - Andrew Granville, Melvyn B Nathanson and Jozsef Solymosi
The book is mostly devoted to the study of the prime factors of integers, their size and their quantity, to good bounds on the number of integers with different properties (for example, those with only large prime factors) and to the distribution of divisors of integers in a given interval. In particular, various estimates concerning smooth numbers are developed. A large emphasis is put on the study of additive and multiplicative functions as well as various arithmetic functions such as the partition function. More specific topics include the Erdős-Kac Theorem, cyclotomic polynomials, combinatorial methods, quadratic forms, zeta functions, Dirichlet series and \(L\)-functions. All these create an intimate understanding of the properties of integers and lead to fascinating and unexpected consequences. The volume includes contributions from leading participants in this active area of research, such as Kevin Ford, Carl Pomerance, Kannan Soundararajan and Gérald Tenenbaum.
Titles in this series are co-published with the Centre de Recherches Mathématiques.
Undergraduates and graduate students and research mathematicians interested in Erdős-type elementary number theory, smooth numbers, and distribution of prime factors of integers, partitions, etc.
"[I]t is quite satisfying to read in these papers some pretty descriptions of the insights behind the methods of proof, so that the application of technical anatomical results seems natural rather than confounding."
-- Greg Martin, University of British Columbia
AMS Home |
© Copyright 2013, American Mathematical Society