DOCSLIB.ORG

Analytic Number Theory in Honor of Helmut Maier’S 60Th Birthday

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Analytic Number Theory in Honor of Helmut Maier’S 60Th Birthday springer.com Carl Pomerance, Michael Th. Rassias (Eds.) Analytic Number Theory In Honor of Helmut Maier’s 60th Birthday Presents the latest developments and applications by leading experts in Analytic Number Theory Contains contributions by mathematicians who have published jointly with Helmut Maier Contains practical material for graduate students and research mathematicians, as well as for computer scientists and engineers??????? ? This volume contains a collection of research and survey papers written by some of the most eminent mathematicians in the international community and is dedicated to Helmut Maier, whose own research has been groundbreaking and deeply influential to the field. Specific emphasis is given to topics regarding exponential and trigonometric sums and their behavior in short intervals, anatomy of integers and cyclotomic polynomials, small gaps in sequences of sifted prime numbers, oscillation theorems for primes in arithmetic progressions, inequalities related to the distribution of primes in short intervals, the Möbius function, Euler’s totient 1st ed. 2015, VIII, 379 p. function, the Riemann zeta function and the Riemann Hypothesis. Graduate students, research mathematicians, as well as computer scientists and engineers who are interested in pure and Printed book interdisciplinary research, will find this volume a useful resource. Contributors to this volume: Hardcover Bill Allombert, Levent Alpoge, Nadine Amersi, Yuri Bilu, Régis de la Bretèche, Christian Elsholtz, 99,99 € | £89.99 | $119.99 John B. Friedlander, Kevin Ford, Daniel A. Goldston, Steven M. Gonek, Andrew Granville, Adam J. [1] 106,99 € (D) | 109,99 € (A) | CHF Harper, Glyn Harman, D. R. Heath-Brown, Aleksandar Ivi, Geoffrey Iyer, Jerzy Kaczorowski, 118,00 Daniel M. Kane, Sergei Konyagin, Dimitris Koukoulopoulos, Michel L. Lapidus, Oleg Lazarev, Softcover Andrew H. Ledoan, Robert J. Lemke Oliver, Florian Luca, James Maynard, Steven J. Miller, Hugh 89,99 € | £79.99 | $109.99 L. Montgomery, Melvyn B. Nathanson, Ashkan Nikeghbali, Alberto Perelli, Amalia Pizarro- [1]96,29 € (D) | 98,99 € (A) | CHF Madariaga, János Pintz, Paul Pollack, Carl Pomerance, Michael Th. Rassias, Maksym Radziwi, 106,50 Joël Rivat, András Sárközy, Jeffrey Shallit, Terence Tao, Gérald Tenenbaum, László Tóth, Tamar Ziegler, Liyang Zhang. eBook 74,89 € | £63.99 | $84.99 [2]74,89 € (D) | 74,89 € (A) | CHF 85,00 Available from your library or springer.com/shop MyCopy [3] Printed eBook for just € | $ 24.99 springer.com/mycopy Order online at springer.com / or for the Americas call (toll free) 1-800-SPRINGER / or email us at: [email protected]. / For outside the Americas call +49 (0) 6221-345-4301 / or email us at: [email protected]. The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with [1] include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with [2] include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. [3] No discount for MyCopy. Part of .
Load more

Recommended publications
  • Gaps Between Primes
    P. I. C. M. – 2018 Rio de Janeiro, Vol. 2 (363–380) GAPS BETWEEN PRIMES J M Abstract We discuss recent advances on weak forms of the Prime k-tuple Conjecture, and its role in proving new estimates for the existence of small gaps between primes and the existence of large gaps between primes. 1 Introduction It follows from the Prime Number Theorem that the average gap between primes less than X is of size roughly log X when X is large. We expect, however, that occasionally these gaps are rather smaller than log X, and occasionally rather larger. Specifically, based on random models and numerical evidence, we believe that the largest and smallest gaps are as described in the following two famous conjectures1. Conjecture 1 (Twin Prime Conjecture). There are infinitely many pairs of primes which differ by exactly 2. th Conjecture 2 (Cramér’s Conjecture, weak form). Let pn denote the n prime. Then 2+o(1) sup (pn+1 pn) = (log X) : pn X Ä Moreover, the Twin Prime Conjecture can be thought of as a special case of the far- reaching Prime k-tuple Conjecture describing more general patterns of many primes. Conjecture 3 (Prime k-tuple Conjecture). Let L1;:::;Lk be integral linear functions k Li (n) = ai n + bi such that for every prime p there is an integer np with Qi=1 Li (np) coprime to p. Then there are infinitely many integers n such that all of L1(n);:::;Lk(n) are primes. The author is funded by a Clay Research Fellowship.
    [Show full text]
  • Structure and Randomness in Arithmetic Settings
    Structure and Randomness in Arithmetic Settings by Erick Bryce Wong B.Sc., Simon Fraser University, 1994 M.Sc., Simon Fraser University, 1997 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in The Faculty of Graduate Studies (Mathematics) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) August 2012 c Erick Bryce Wong 2012 Abstract We study questions in three arithmetic settings, each of which carries as- pects of random-like behaviour. In the setting of arithmetic functions, we establish mild conditions under which the tuple of multiplicative functions [f1; f2; : : : ; fd], evaluated at d consecutive integers n + 1; : : : ; n + d, closely d approximates points in R for a positive proportion of n; we obtain a fur- ther generalization which allows these functions to be composed with various arithmetic progressions. Secondly, we examine the eigenvalues of random integer matrices, show- ing that most matrices have no rational eigenvalues; we also identify the precise distributions of both real and rational eigenvalues in the 2 × 2 case. Finally, we consider the set S(k) of numbers represented by the quadratic form x2 +ky2, showing that it contains infinitely many strings of five consec- utive integers under many choices of k; we also characterize exactly which numbers can appear as the difference of two consecutive values in S(k). ii Preface A version of Chapter 2 was published as: • Wong, E. B. (2008) Simultaneous approximation of reals by values of arithmetic functions. Anatomy of Integers, volume 46 of CRM Proc. Lecture Notes, pp. 289{297. Amer. Math. Soc., Providence, RI.
    [Show full text]
  • 50Th IMO – 50 Years of International Mathematical Olympiads − Hans-Dietrich Gronau • Hanns-Heinrich Langmann Dierk Schleicher Editors
    50th IMO – 50 Years of International Mathematical Olympiads − Hans-Dietrich Gronau • Hanns-Heinrich Langmann Dierk Schleicher Editors 50thIMO–50Years of International Mathematical Olympiads 123 Editors Hans-Dietrich Gronau Hanns-Heinrich Langmann Universität Rostock Bildung & Begabung gemeinnützige GmbH Institut für Mathematik Bundeswettbewerb Mathematik Ulmenstr. 69 Kortrijker Str. 1 18051 Rostock 53177 Bonn Germany Germany [email protected] [email protected] Dierk Schleicher Jacobs University Research I Campus Ring 1 28759 Bremen Germany [email protected] ISBN 978-3-642-14564-3 e-ISBN 978-3-642-14565-0 DOI 10.1007/978-3-642-14565-0 Springer Heidelberg Dordrecht London New York Mathematics Subject Classification (2010): 00A09 c Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer.Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: WMXDesign GmbH, Heidelberg Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Preface From 10 to 22 July 2009 Germany hosted the 50th International Mathematical Olympiad (IMO).
    [Show full text]
  • Oscillation Theorems for Primes in Arithmetic Progressions and for Sifting Functions
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 4, Number I, January 1991 OSCILLATION THEOREMS FOR PRIMES IN ARITHMETIC PROGRESSIONS AND FOR SIFTING FUNCTIONS JOHN FRIEDLANDER, ANDREW GRANVILLE, ADOLF HILDEBRAND, AND HELMUT MAIER CONTENTS I. Introduction 1. Primes in arithmetic progressions 2. The main theorems II. Oscillation theorems for sifting functions 3. The statements 4. Proof of Theorem B2 5. Proof of Proposition 3.1 6. Proof of Proposition 3.2 7. Proof of Theorem C: preliminaries 8. Proof of Theorem C: completion 9. Proof of Theorem Bl 10. Proof of Theorem B3 III. Oscillation theorems for primes 11. Proof of Theorem Al 12. Proof of Theorem A2 13. Proofs of Theorem A3 and Proposition 2.1 I. INTRODUCTION 1. PRIMES IN ARITHMETIC PROGRESSIONS For x ~ 2 real, q a positive integer, and a an integer coprime to q, let 0 and ~ be defined by (1.1) O(x; q, a) = E logp = qJZq) (1 +~(x; q, a)), p~x p=amodq Received by the editors June 15, 1989. 1980 Mathematics Subject Classification (1985 Revision). Primary 11N13; Secondary llN25, 11N35. The first two authors were partially supported by NSERC and the last two authors were partially supported by NSF. © 1991 American Mathematical Society 0894-0347/91 $1.00 + $.25 per page 25 License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use 26 J. FRIEDLANDER, A. GRANVILLE, A. HILDEBRAND, AND H. MAIER where rp is Euler's function. The prime number theorem for arithmetic progres- sions is equivalent to the statement that .1o(x; q, a) = 0(1) holds, as x -+ 00, for fixed q and a.
    [Show full text]
  • Prime Gap Grows After Decades-Long Lull
    Quanta Magazine Prime Gap Grows After Decades-Long Lull A year after tackling how close together prime number pairs can stay, mathematicians have now made the first major advance in 76 years in understanding how far apart primes can be. By Erica Klarreich Photo illustration by Olena Shmahalo / Quanta Magazine; original courtesy of Terence Tao Paul Erdös, left, and Terence Tao in 1985. This August, Tao and four other mathematicians proved an old Erdös conjecture on large prime gaps. In May 2013, the mathematician Yitang Zhang launched what has proven to be a banner year and a half for the study of prime numbers, those numbers that aren’t divisible by any smaller number except 1. Zhang, of the University of New Hampshire, showed for the first time that even though primes get increasingly rare as you go further out along the number line, you will never stop finding pairs of primes that are a bounded distance apart — within 70 million, he proved. Dozens of mathematicians then put their heads together to improve on Zhang’s 70 million bound, bringing it down to 246 — within striking range of the celebrated twin primes conjecture, which posits that https://www.quantamagazine.org/mathematicians-prove-conjecture-on-big-prime-number-gaps-20141210/ December 10, 2014 Quanta Magazine there are infinitely many pairs of primes that differ by only 2. Now, mathematicians have made the first substantial progress in 76 years on the reverse question: How far apart can consecutive primes be? The average spacing between primes approaches infinity as you travel up the number line, but in any finite list of numbers, the biggest prime gap could be much larger than the average.
    [Show full text]
  • The 2014 SASTRA Ramanujan Prize Will Be Awarded to Dr
    JAMES MAYNARD TO RECEIVE 2014 SASTRA RAMANUJAN PRIZE The 2014 SASTRA Ramanujan Prize will be awarded to Dr. James Maynard of Oxford University, England, and the University of Montreal, Canada. The SASTRA Ramanujan Prize was established in 2005 and is awarded annually for outstanding contributions by young mathematicians to areas influenced by the genius Srinivasa Ramanujan. The age limit for the prize has been set at 32 because Ramanujan achieved so much in his brief life of 32 years. The prize will be awarded during December 21-22 at the International Conference on Number Theory at SASTRA University in Kumbakonam (Ramanujan's hometown) where the prize has been given annually. Dr. Maynard has made spectacular contributions to number theory, especially on some famous problems on prime numbers. The theory of primes is an area where questions which are simple to state can be very difficult to answer. A supreme example is the celebrated \prime twins conjecture" which states that there are infinitely many prime pairs that differ by 2. In the last twelve months, Dr. Maynard has obtained the strongest result towards this centuries old conjecture by proving that the gap between consecutive primes is no more than 600 infinitely often. Not only did he significantly improve upon the earlier path-breaking work of Goldston, Pintz, Yildirim, and Zhang, but he achieved this with ingenious methods which are simpler than those used by others. Maynard's remarkable success on the \small gap problem" on primes is built upon the ideas and results he developed in his doctoral work a few years ago on some other famous problems on primes such as the Brun-Titchmarsh inequality.
    [Show full text]
  • Carl Pomerance · Michael Th. Rassias Editors in Honor of Helmut Maier's
    Carl Pomerance · Michael Th. Rassias Editors Analytic Number Theory In Honor of Helmut Maier’s 60th Birthday Analytic Number Theory Professor Helmut Maier Carl Pomerance • Michael Th. Rassias Editors Analytic Number Theory In Honor of Helmut Maier’s 60th Birthday 123 Editors Carl Pomerance Michael Th. Rassias Department of Mathematics Department of Mathematics Dartmouth College ETH-Zürich Hanover, NH, USA Zürich, Switzerland Department of Mathematics Princeton University Princeton, NJ, USA ISBN 978-3-319-22239-4 ISBN 978-3-319-22240-0 (eBook) DOI 10.1007/978-3-319-22240-0 Library of Congress Control Number: 2015947785 Mathematics Subject Classification (2010): 11-Axx, 11-Bxx, 11-Lxx, 11-Mxx, 11-Nxx, 11-Pxx, 11-Yxx, 26-Dxx, 40-XX, 41-XX Springer Cham Heidelberg New York Dordrecht London © Springer International Publishing Switzerland 2015 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication.
    [Show full text]
  • Long Gaps Between Consecutive Prime Numbers
    LONG GAPS BETWEEN PRIMES KEVIN FORD, BEN GREEN, SERGEI KONYAGIN, JAMES MAYNARD, AND TERENCE TAO ABSTRACT. Let pn denote the n-th prime. We prove that log X log log X log log log log X max (pn+1 − pn) pn6X log log log X for sufficiently large X, improving upon recent bounds of the first three and fifth authors and of the fourth au- thor. Our main new ingredient is a generalization of a hypergraph covering theorem of Pippenger and Spencer, proven using the Rodl¨ nibble method. CONTENTS 1. Introduction 1 2. Notational conventions 6 3. Sieving a set of primes 8 4. Efficient hypergraph covering 10 5. Proof of the covering theorem 18 6. Using a sieve weight 24 7. Multidimensional sieve estimates 30 8. Verification of sieve estimates 34 References 38 1. INTRODUCTION th Let pn denote the n prime, and let G(X) := max (pn+1 − pn) pn6X It is clear from the prime number theorem that G(X) > (1 + o(1)) log X; as the average gap between the prime numbers which are 6 X is ∼ log X. In 1931, Westzynthius [46] proved that infinitely often, the gap between consecutive prime numbers can be an arbitrarily large multiple of the average gap, that is, G(X)= log X ! 1 as X ! 1, improving upon prior results of Backlund [2] and Brauer-Zeitz [5]. Moreover, he proved the quantitative bound1 log X log X G(X) 3 : log4 X 1 As usual in the subject, log2 x = log log x, log3 x = log log log x, and so on.
    [Show full text]
  • Large Gaps in Sets of Primes and Other Sequences
    École sur les probabilités en théorie des nombres au mai School on Probability in Number Theory May -, Large gaps in sets of primes and other sequences Kevin Ford * [email protected] Lecture 1. Probabilistic models for large gaps and fundamen- tals of locating large gaps We first analyze several probabilistic models used for predicting the largest gap in a given sequence of integers. These include the classical Cramér model, Granville’s refinement of Cramér’s model, and the “random dart” model. We also describe the fundamental ideas that have been used to prove the existence of large gaps between primes, including the reduction to the problem of covering in interval by residue classes, the connections to Ja- cobstal’s function and sieve theory. In particular, we emphasize the importance of bounds for smooth numbers, re-interpreted as “beating independece” in the sieve. Lecture 2. New bounds for large gaps between primes, Part I. Random methods and weighted sieves We will describe in some detail two main ingredients in the paper which establishes the current record for the largest gaps between consecutive primes (Long gaps between consec- utive prime numbers. Kevin Ford, Ben Green, Sergei Konyagin, James Maynard and and Terence Tao, J. Amer. Math. Soc., 31 (2018), no. 1, 65–105). The first is the use of a “ran- dom covering” by residue classes to cover an interval (the importance of this is detailed in Lecture 1). This random covering sets up a use of a weighted sieve, of the type used with spectacular success in the study of bounded gaps between primes.
    [Show full text]
  • Senior Whitehead Prize 2019 Citation for Professor Ben Green FRS
    Senior Whitehead Prize 2019 Citation for Professor Ben Green FRS Professor Ben Green FRS, of the University of Oxford, is awarded a Senior Whitehead Prize for his groundbreaking contributions to additive combinatorics, analytic number theory, and group theory. In all three areas he has proved results of a power that would have seemed unthinkable twenty years ago. His most famous result, proved with Terence Tao, is that the prime numbers contain arithmetic progressions of all lengths. This was followed up by a series of papers, culminating in a paper with Tao and Tamar Ziegler that proved the so-called inverse theorem for the 푈푘-norms. This completed a programme that proved a very wide class cases of the Hardy–Littlewood conjecture about the asymptotic density of configurations in the primes: essentially, they proved all cases apart from those that would have implied “impossibly difficult” results such as the twin-primes conjecture. More recently, with Kevin Ford, Sergei Konyagin, James Maynard and Tao he has proved a decades-old conjecture of Erdős concerning long gaps in the primes. A famous result of his in group theory, proved with Emmanuel Breuillard and Tao, concerns the structure of “approximate groups”, that is, subsets of groups that have an approximate closure property. Such subsets play a central role in additive combinatorics, but while the Abelian case was well understood thanks to remarkable work of Gregory Freiman and Imre Ruzsa, the non-Abelian case was much harder. The proof is a mixture of deep ideas and a technical tour de force: to give an idea of how strong it is, one consequence of their result is Gromov's theorem on polynomial growth.
    [Show full text]
  • Annualreport 2005 2006
    AnnualReport 2005 2006 AnnualReport 2005 2006 Centre de recherches mathématiques Université de Montréal C.P. 6128, succ. Centre-ville Montréal, QC H3C 3J7 Canada Also available on the CRM’s website www.crm.umontreal.ca c Centre de recherches mathématiques Université de Montréal, 2006 ISBN 2-921120-43-7 CENTRE DE RECHERCHES MATHÉMATIQUES Presenting the Annual Report 2005 – 2006 5 A Year That Set a New Standard for Canadian Mathematics . 6 Thematic Program 9 Thematic Year 2005 – 2006: Analysis in Number Theory . 10 Aisenstadt Chairholders in 2005 – 2006: M. Bhargava, K. Soundararajan, and T. Tao . 10 Activities of the Thematic Year . 13 Past Thematic Programs . 23 General Program 24 CRM activities . 25 CRM – ISM Colloquium Series . 34 Multidisciplinary and Industrial Program 37 Activities of the Multidisciplinary and Industrial Program . 38 CRM Prizes 45 CRM – Fields – PIMS Prize 2006 Awarded to Nicole Tomczak-Jaegermann . 46 André-Aisenstadt Prize 2006 Awarded Jointly to Iosif Polterovich and Tai-Peng Tsai . 47 CAP – CRM Prize 2006 Awarded to John Harnad . 47 CRM – SSC Prize 2006 Awarded to Jeffrey Rosenthal . 48 CRM Outreach Program 50 Jean-Marie De Koninck . 51 Ivar Ekeland . 52 CRM Partnerships 54 CRM Partners . 55 Joint Initiatives . 59 Mathematical Education 62 Institut des sciences mathématiques (ISM) . 63 Other Joint Initiatives . 65 Research Laboratories 67 Applied Mathematics . 68 CICMA................................................. 71 CIRGET . 74 LaCIM ................................................. 76 Mathematical Analysis . 79 Mathematical Physics . 82 PhysNum . 85 Statistics . 88 Publications 92 Recent Titles . 93 Previous Titles . 93 CRM Preprints . 96 Scientific Personnel 98 CRM Members in 2005 – 2006 . 99 Postdoctoral Fellows . 101 Long-term Visitors . 101 Short-term Visitors .
    [Show full text]
  • Iasinstitute for Advanced Study
    IASInstitute for Advanced Study Report for the Academic Year 2007–2008 t is fundamental in our purpose, and our express I. desire, that in the appointments to the staff and faculty, as well as in the admission of workers and students, no account shall be taken, directly or indirectly, of race, religion, or sex. We feel strongly that the spirit characteristic of America at its noblest, above all the pursuit of higher learning, cannot admit of any conditions as to personnel other than those designed to promote the objects for which this institution is established, and particularly with no regard whatever to accidents of race, creed, or sex. Extract from the letter addressed by the Institute’s Founders, Louis Bamberger and Caroline Bamberger Fuld, to the first Board of Trustees, dated June 4, 1930. Newark, New Jersey Cover Photo: Dinah Kazakoff The Institute for Advanced Study exists to encourage and support fundamental research in the sciences and humanities—the original, often speculative, thinking that produces advances in knowledge that change the way we understand the world. THE SCHOOL OF HISTORICAL STUDIES, established in 1949 with the merging of the School of Economics and Politics and the School of Humanistic Studies, is concerned principally with the history of Western European, Near Eastern, and East Asian civilizations. The School actively promotes interdisciplinary research and cross-fertilization of ideas. THE SCHOOL OF MATHEMATICS, established in 1933, was the first School at the Institute for Advanced Study. Several central themes in math- ematics of the twentieth and twenty-first centuries owe their major impetus to discoveries that have taken place at the Institute.Today, the School is an international center for research on mathematics and computer science.The School sponsors, jointly with Princeton University,the Program for Women and Mathematics.
    [Show full text]