Bounded Gaps Between Primes

The Epic Breakthroughs of the Early Twenty-First Century

Inbunden, Engelska, 2021

Av Kevin Broughan, New Zealand) Broughan, Kevin (University of Waikato

1 809 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

769 kr

Skickas inom 7-10 vardagar

Searching for small gaps between consecutive primes is one way to approach the twin primes conjecture, one of the most celebrated unsolved problems in number theory. This book documents the remarkable developments of recent decades, whereby an upper bound on the known gap length between infinite numbers of consecutive primes has been reduced to a tractable finite size. The text is both introductory and complete: the detailed way in which results are proved is fully set out and plenty of background material is included. The reader journeys from selected historical theorems to the latest best result, exploring the contributions of a vast array of mathematicians, including Bombieri, Goldston, Motohashi, Pintz, Yildirim, Zhang, Maynard, Tao and Polymath8. The book is supported by a linked and freely-available package of computer programs. The material is suitable for graduate students and of interest to any mathematician curious about recent breakthroughs in the field.

Produktinformation

Utgivningsdatum2021-02-25
Mått174 x 250 x 35 mm
Vikt1 140 g
FormatInbunden
SpråkEngelska
Antal sidor590
FörlagCambridge University Press
ISBN9781108836746

Tillhör följande kategorier

Kevin Broughan is Emeritus Professor at the University of Waikato, New Zealand. He co-founded and is a Fellow of the New Zealand Mathematical Society. Broughan brings a unique set of knowledge and skills to this project, including number theory, analysis, topology, dynamical systems and computational mathematics. He previously authored the two-volume work Equivalents of the Riemann Hypothesis (Cambridge, 2017) and wrote a software package which is part of Goldfeld's Automorphic Forms and L-Functions for the Group GL(n,R) (Cambridge, 2006).

1. Introduction; 2. The sieves of Brun and Selberg; 3. Early work; 4. The breakthrough of Goldston, Motohashi, Pintz, and Yildirim; 5. The astounding result of Yitang Zhang; 6. Maynard's radical simplification; 7. Polymath's refinements of Maynard's results; 8. Variations on Bombieri–Vinogradov; 9. Further work and the epilogue; Appendix A. Bessel functions of the first kind; Appendix B. A type of compact symmetric operator; Appendix C. Solving an optimization problem; Appendix D. A Brun–Titchmarsh inequality; Appendix E. The Weil exponential sum bound; Appendix F. Complex function theory; Appendix G. The dispersion method of Linnik; Appendix H. One thousand admissible tuples; Appendix I. PGpack mini-manual; References; Index.