NewsJames Maynard to Receive <strong>2014</strong>SASTRA Ramanujan PrizeKrishnaswami Alladi (University of Florida, Gainsville, USA), Chair SASTRA Ramanujan Prize CommitteeThe <strong>2014</strong> SASTRA Ramanujan Prize will be awarded toDr James Maynard of Oxford University, England, andthe University of Montreal, Canada.The SASTRA Ramanujan Prize was established in2005 and is awarded annually for outstanding contributionsby young mathematicians to areas influenced bythe genius Srinivasa Ramanujan. The age limit for theprize has been set at 32 because Ramanujan achieved somuch in his brief life of 32 years. The prize will be awardedon 21–22 December at the International Conferenceon Number Theory at SASTRA University in Kumbakonam(Ramanujan’s hometown), where the prize hasbeen given annually.Dr Maynard has made spectacular contributions tonumber theory, especially on some famous problems onprime numbers. The theory of primes is an area wherequestions which are simple to state can be very difficultto answer. A supreme example is the celebrated “primetwins conjecture”, which states that there are infinitelymany prime pairs that differ by 2. In the last <strong>12</strong> months,Dr Maynard has obtained the strongest result towardsthis centuries old conjecture by proving that the gap betweenconsecutive primes is no more than 600 infinitelyoften. Not only did he significantly improve upon theearlier groundbreaking work of Goldston, Pintz, Yildirimand Zhang but he achieved this with ingenious methodsthat are simpler than those used by others. Maynard’s remarkablesuccess on the “small gap problem” on primesis built upon the ideas and results he developed in his doctoralwork a few years ago on some other famous problemson primes such as the Brun–Titchmarsh inequality.Maynard’s results and methods have led to a resurgenceof activity worldwide in prime number theory.In his doctoral thesis of 2013 at Oxford University,written under the direction of Professor Roger Heath-Brown, Maynard obtained a number of deep results onsome fundamental problems. One of the intriguing andimportant questions on prime numbers is how uniformlythey are distributed in various arithmetic progressionsof integers up to a given magnitude. There is an heuristicestimate for the number of such primes in arithmeticprogressions and one usually gets a bound of the order ofmagnitude given by the heuristic. This Brun–Titchmarshproblem becomes difficult when the modulus or gap betweenthe members of the progression becomes verylarge and results are weaker compared to the conjecturedsize. Earlier researchers had relied on a certain unprovenhypothesis concerning the Siegel zeros of L-functions inorder to treat these large moduli. But Maynard showedin his thesis (without appeal to any hypothesis) that thenumber of primes in arithmetic progressions is boundedby the suspected heuristic size for arithmetic progressionswhose moduli do not exceed the eighth root of thelargest member of the progression. This important paperappeared in Acta Arithmetica in 2013.A generalisation of the prime twins conjecture is theprime k-tuples conjecture, which states that an admissiblecollection of k linear functions will simultaneouslytake k prime values infinitely often in values of theargument. In the last 100 years, several partial resultstoward the k-tuples conjecture have been obtained eitherby replacing prime values of some of these linearfunctions by “almost primes” (which are integers with abounded number of prime factors) or by bounding thetotal number of prime factors in the product of these linearfunctions. Another major achievement in his doctoralthesis is his work on “Almost-prime k-tuples” (which waspublished in Mathematika in <strong>2014</strong>) in which he obtainsbounds for the number of prime factors in the product ofthese admissible linear functions. These bounds are superiorto bounds obtained by earlier researchers, exceptin the case of the product of three linear functions, wherehis result was just as strong as the 1972 result of Porter,who had confirmed that the triple product will have nomore than eight prime factors infinitely often. But in aseparate paper that appeared in the Proceedings of theCambridge Philosophical Society in 2013, Maynard brokethe impasse by improving on Porter’s result and showingthat a product of three admissible linear functions willhave no more than seven prime factors infinitely often.In establishing these fundamental results, Maynard introduceda number of new methods and techniques thatenabled him to achieve a sensational result on the smallgaps problem on primes within a year of completinghis DPhil – when he was a post-doctoral fellow at theUniversity of Montreal, Canada, with Professor AndrewGranville as his mentor.The prime number theorem implies that the averagegap between the n-th prime and the next prime is asymptoticto log n. Two questions arise immediately:(i) How small can this gap be infinitely often (the smallgap problem)? and(ii) How large can this gap be infinitely often (the largegap problem)? The prime twins conjecture says thatthe gap is two infinitely often.It was a sensation a few years ago when Goldston, Pintzand Yildirim (GPY) showed that over a sequence of integersn that tend to infinity, the gap between the n-thprime and the next can be made arbitrarily smaller thanthe average gap. It was shown by GPY that if a certain10 EMS Newsletter December <strong>2014</strong>
Newsconjecture of Elliott and Halberstam on the distributionof primes in arithmetic progression holds then the gapcould be made as small as 16 infinitely often.Two years ago, Y. Zhang stunned the world by showingthat infinitely often the smallest gap is no more than70 million! This was the first time a bounded gap was establishedunconditionally. For this seminal work on thesmall gap problem, Goldston, Pintz, Yildirim and Zhangreceived the <strong>2014</strong> Cole Prize of the American MathematicalSociety.Zhang’s method was quite complex. He had to circumventthe use of a hypothesis that went beyond the Bombieri–Vinogradovtheorem. Terence Tao, by leading thePolymath project, reduced Zhang’s bound to 4680. Butwithin a few months of Zhang’s achievement, Maynardtook the world by storm by establishing, in a simpler andmore elegant fashion, that the gap between the primes isno more than 600 infinitely often! This sensational paperon “Small gaps between primes” will soon appear in theAnnals of Mathematics. Actually, in this paper, Maynardestablishes a number of other deep results. For example,he shows that for any given integer m, the gap betweenthe n + m-th prime and the n-th prime is bounded by aprescribed function of m. Very recently, Maynard hasjoined the Polymath project and now the gap betweenconsecutive primes has been shown to be no more than246 infinitely often, by adapting the method in Maynard’spaper in the Annals of Mathematics. This is to appear inthe journal Research in the Mathematical Sciences.Within the last month, Maynard has announced asolution of the famous $10,000 problem of Paul Erdősconcerning large gaps between primes. This was also simultaneouslyannounced by Kevin Ford, Ben Green,Sergei Konyagin and Terence Tao but Maynard’s methodsare different and simpler. In 1938, Robert Rankinestablished a lower bound for infinitely many large gaps,which remained for many years the best result on thelarge gap problem. The great Hungarian mathematicianPaul Erdős asked whether the implicit constant inRankin’s lower bound could be made arbitrarily largeand offered $10,000 to settle this question either in theaffirmative or in the negative. In the last 50 years, therehave been improvements made by various leading researcherson the value of the implicit contant in Rankin’sbound – by Rankin himself in 1962, by Helmut Maier andCarl Pomerance in 1990 and by Janos Pintz in 1997 – butthe Erdős problem still remained unsolved. Maynard hasnow shown that the implicit constant in Rankin’s lowerbound could be made arbitrarily large. So in settling thisnotoriously difficult problem, an impasse of several decadeshas been broken. Another fundamental recent workof Maynard is a collaboration with William Banks andTristan Freiburg on the limit points of the values of theratio of the gap between consecutive primes and the averagegap. Results on the small gaps problem imply that0 is a limit point and the work on the large gap problemshows that ∞ is a limit point. No other limit point isknown. In this joint paper it is shown that if 50 randomreal numbers are given then one at least of the 50 consecutivegaps between them and 0 will occur as a limitpoint. Thus, in the last three years, Maynard has obtainedseveral spectacular results in the theory of primes bymethods which will have far reaching implications.James Maynard was born in Chelmsford, England,on 10 June 1987. He obtained his BA and Master’s inMathematics from Cambridge University in 2009. Hethen joined Balliol College, Oxford University, wherehe received his Doctorate in Philosophy in 2013. During2013–14 he was a post-doctoral fellow at the Universityof Montreal, Canada. Within a period of three years,Maynard has startled the mathematical world with deepresults in rapid succession. The SASTRA RamanujanPrize will be his first major award in recognition of hismany fundamental results in prime number theory.The <strong>2014</strong> SASTRA Ramanujan Prize Committeeconsisted of Professors Krishnaswami Alladi – Chair(University of Florida), Roger Heath-Brown (OxfordUniversity), Winnie Li (Pennsylvania State University),David Masser (University of Basel), Barry Mazur (HarvardUniversity), Peter Paule (Johannes Kepler Universityof Linz) and Michael Rapoport (University ofBonn).Previous winners of the prize are Manjul Bhargavaand Kannan Soundararajan in 2005 (two full prizes), TerenceTao in 2006, Ben Green in 2007, Akshay Venkateshin 2008, Kathrin Bringmann in 2009, Wei Zhang in 2010,Roman Holowinsky in 2011, Zhiwei Yun in 20<strong>12</strong> and PeterScholze in 2013. The award of the <strong>2014</strong> SASTRA RamanujanPrize to James Maynard is a fitting recognitionin the tenth year of this prize and is in keeping with thetradition of recognising groundbreaking work by youngmathematicians.Krishnaswami Alladi is a professor ofmathematics at the University of Florida,Gainesville, where he was DepartmentChairman during 1998–2008. Hereceived his PhD from UCLA in 1978.His area of research is number theory.He is the Founder and Editor-in-Chiefof The Ramanujan Journal publishedby Springer. He helped create the SAS-TRA Ramanujan Prize given to veryyoung mathematicians and has chaired the prize committeesince its inception in 2005.EMS Newsletter December <strong>2014</strong> 11
- Page 7 and 8: EMS News- mini-symposia;- film and
- Page 9 and 10: EMS NewsTransitionOn 29 June, in th
- Page 11: Newsford, Maxwell, and Kelvin. Some
- Page 16 and 17: Featurejecture for acute triangles
- Page 18 and 19: FeatureBirch and Bombieri, which in
- Page 20 and 21: Featuresure that comes from derivin
- Page 22 and 23: FeatureFor me, personally, it felt
- Page 24 and 25: Featureplaced by several applicatio
- Page 26 and 27: ObituaryAnatolii Skorokhod(10 Sept
- Page 28 and 29: ObituaryIn 1957-1964, Skorokhod was
- Page 31 and 32: Obituarysion processes in a region
- Page 33 and 34: Obituarysupport the study of the ri
- Page 35 and 36: Discussionthe self-citations? One o
- Page 37 and 38: Discussiona large, diligent work-fo
- Page 39 and 40: Discussionattention of the media, 6
- Page 41 and 42: Discussionequations) also received
- Page 43 and 44: Short Report on ICM2014DiscussionMi
- Page 45 and 46: Interview with Fields MedallistMart
- Page 47 and 48: InterviewCertainly, it was.Competit
- Page 49 and 50: InterviewPictures are very importan
- Page 51 and 52: InterviewThere are, of course, no r
- Page 53 and 54: Research CentresThe IMS also plays
- Page 55 and 56: Research CentresMIMS “Mathematics
- Page 57 and 58: Book ReviewsCANP TanzaniaThe CANP (
- Page 59 and 60: Book ReviewsReviewer: Werner Kleine
- Page 61 and 62: Book Reviewscation” (by Jean-Luc
- Page 63 and 64:
Book ReviewsIn 1923, Artin was only
- Page 65 and 66:
Letters to the EditorReply to: ‘A
- Page 67 and 68:
Introducing new and recent books fr