The BEST WRITING on MATHEMATICS
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Kissing Numbers: Surprises in Dimension Four Günter M
Kissing numbers: Surprises in Dimension Four Günter M. Ziegler, TU Berlin The “kissing number problem” is a basic geometric problem that got its name from billards: Two balls “kiss” if they touch. The kissing number problem asks how many other balls can touch one given ball at the same time. If you arrange the balls on a pool ta- ble, it is easy to see that the answer is exactly six: Six balls just perfectly surround a given ball. Graphic: Detlev Stalling, ZIB Berlin and at the same time Vladimir I. Levenstein˘ in Russia proved that the correct, exact maximal numbers for the kissing number prob- lem are 240 in dimension 8, and 196560 in dimension 24. This is amazing, because these are also the only two dimensions where one knows a precise answer. It depends on the fact that mathemati- cians know very remarkable configurations in dimensions 8 and 24, which they call the E8 lattice and the Leech lattice, respectively. If, however, you think about this as a three-dimensional problem, So the kissing number problem remained unsolved, in particular, the question “how many balls can touch a given ball at the same for the case of dimension four. The so-called 24-cell, a four- time” becomes much more interesting — and quite complicated. In dimensional “platonic solid” of remarkable beauty (next page), fact, The 17th century scientific genius Sir Isaac Newton and his yields a configuration of 24 balls that would touch a given one in colleague David Gregory had a controversy about this in 1694 — four-dimensional space. -
Blueprint Staff Magazine for the University of Oxford | September 2016
blueprint Staff magazine for the University of Oxford | September 2016 Chemistry’s organic growth | Secrets of successful spelling | Oxford time News in brief u Oxford has topped the Times Higher research fellow at the college, set off at 6.30am Education World University Rankings for and arrived at Homerton, Harris Manchester’s 2016–17 – the first time in the 13-year history of twin college, in the afternoon. OxfordUniversity Images/Rob Judges the rankings that a UK institution has secured the top spot. The rankings judge research-intensive u The University’s phone system is being universities across five areas: teaching, research, replaced by a new service called Chorus. citations, international outlook and knowledge The service is being rolled out on a building- transfer. In total UK institutions took 91 of the by-building basis between autumn 2016 and 980 places, with the University of Cambridge spring 2018. Chorus will deliver replacement (fourth) and Imperial College London (eighth) phones together with access to a web portal, also making the top ten. which will provide additional functionality such as managing your voicemail, accessing u The University and local NHS partners have your call history, and sending and receiving won £126.5m to support medical research. instant messages. Details at https://projects.it. The money, from the National Institute for ox.ac.uk/icp. Health Research, includes £113.7m for the existing University of Oxford/Oxford University u The University has opened a new nursery Hospitals Biomedical Research Centre, and on the Old Road Campus in Headington, £12.8m for a new Biomedical Research Centre bringing the total number of University-owned specialising in mental health and dementia, nurseries to five. -
Elect Your Council
Volume 41 • Issue 3 IMS Bulletin April/May 2012 Elect your Council Each year IMS holds elections so that its members can choose the next President-Elect CONTENTS of the Institute and people to represent them on IMS Council. The candidate for 1 IMS Elections President-Elect is Bin Yu, who is Chancellor’s Professor in the Department of Statistics and the Department of Electrical Engineering and Computer Science, at the University 2 Members’ News: Huixia of California at Berkeley. Wang, Ming Yuan, Allan Sly, The 12 candidates standing for election to the IMS Council are (in alphabetical Sebastien Roch, CR Rao order) Rosemary Bailey, Erwin Bolthausen, Alison Etheridge, Pablo Ferrari, Nancy 4 Author Identity and Open L. Garcia, Ed George, Haya Kaspi, Yves Le Jan, Xiao-Li Meng, Nancy Reid, Laurent Bibliography Saloff-Coste, and Richard Samworth. 6 Obituary: Franklin Graybill The elected Council members will join Arnoldo Frigessi, Steve Lalley, Ingrid Van Keilegom and Wing Wong, whose terms end in 2013; and Sandrine Dudoit, Steve 7 Statistical Issues in Assessing Hospital Evans, Sonia Petrone, Christian Robert and Qiwei Yao, whose terms end in 2014. Performance Read all about the candidates on pages 12–17, and cast your vote at http://imstat.org/elections/. Voting is open until May 29. 8 Anirban’s Angle: Learning from a Student Left: Bin Yu, candidate for IMS President-Elect. 9 Parzen Prize; Recent Below are the 12 Council candidates. papers: Probability Surveys Top row, l–r: R.A. Bailey, Erwin Bolthausen, Alison Etheridge, Pablo Ferrari Middle, l–r: Nancy L. Garcia, Ed George, Haya Kaspi, Yves Le Jan 11 COPSS Fisher Lecturer Bottom, l–r: Xiao-Li Meng, Nancy Reid, Laurent Saloff-Coste, Richard Samworth 12 Council Candidates 18 Awards nominations 19 Terence’s Stuff: Oscars for Statistics? 20 IMS meetings 24 Other meetings 27 Employment Opportunities 28 International Calendar of Statistical Events 31 Information for Advertisers IMS Bulletin 2 . -
Gazette Des Mathématiciens
JUILLET 2018 – No 157 la Gazette des Mathématiciens • Autour du Prix Fermat • Mathématiques – Processus ponctuels déterminantaux • Raconte-moi... le champ libre gaussien • Tribune libre – Quelle(s) application(s) pour le plan Torossian-Villani la GazetteComité de rédaction des Mathématiciens Rédacteur en chef Sébastien Gouëzel Boris Adamczewski Université de Nantes Institut Camille Jordan, Lyon [email protected] [email protected] Sophie Grivaux Rédacteurs Université de Lille [email protected] Thomas Alazard École Normale Supérieure de Paris-Saclay [email protected] Fanny Kassel IHÉS Maxime Bourrigan [email protected] Lycée Saint-Geneviève, Versailles [email protected] Pauline Lafitte Christophe Eckès École Centrale, Paris Archives Henri Poincaré, Nancy [email protected] [email protected] Damien Gayet Romain Tessera Institut Fourier, Grenoble Université Paris-Sud [email protected] [email protected] Secrétariat de rédaction : smf – Claire Ropartz Institut Henri Poincaré 11 rue Pierre et Marie Curie 75231 Paris cedex 05 Tél. : 01 44 27 67 96 – Fax : 01 40 46 90 96 [email protected] – http://smf.emath.fr Directeur de la publication : Stéphane Seuret issn : 0224-8999 À propos de la couverture. Cette image réalisée par Alejandro Rivera (Institut Fourier) est le graphe de la partie positive du champ libre gaussien sur le tore plat 2=(2á2) projeté sur la somme des espaces propres du laplacien de valeur propre plus petite que 500. Les textures et couleurs ajoutées sur le graphe sont pure- ment décoratives. La fonction a été calculée avec C++ comme une somme de polynômes trigonométriques avec des poids aléatoires bien choisis, le graphe a été réalisé sur Python et les textures et couleurs ont été réalisées avec gimp. -
Local Covering Optimality of Lattices: Leech Lattice Versus Root Lattice E8
Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8 Achill Sch¨urmann, Frank Vallentin ∗ 10th November 2004 Abstract We show that the Leech lattice gives a sphere covering which is locally least dense among lattice coverings. We show that a similar result is false for the root lattice E8. For this we construct a less dense covering lattice whose Delone subdivision has a common refinement with the Delone subdivision of E8. The new lattice yields a sphere covering which is more than 12% less dense than the formerly ∗ best known given by the lattice A8. Currently, the Leech lattice is the first and only known example of a locally optimal lattice covering having a non-simplicial Delone subdivision. We hereby in particular answer a question of Dickson posed in 1968. By showing that the Leech lattice is rigid our answer is even strongest possible in a sense. 1 Introduction The Leech lattice is the exceptional lattice in dimension 24. Soon after its discovery by Leech [Lee67] it was conjectured that it is extremal for several geometric problems in R24: the kissing number problem, the sphere packing problem and the sphere covering problem. In 1979, Odlyzko and Sloane and independently Levenshtein solved the kissing number problem in dimension 24 by showing that the Leech lattice gives an optimal solution. Two years later, Bannai and Sloane showed that it gives the unique solution up to isometries (see [CS88], Ch. 13, 14). Unlike the kissing number problem, the other two problems are still open. Recently, Cohn and Kumar [CK04] showed that the Leech lattice gives the unique densest lattice sphere packing in R24. -
978-961-293-071-4.Pdf PUBLIC LECTURES 53
CONTENTS 8th European Congress of Mathematics 20–26 June 2021 • Portorož, Slovenia PLENARY SPEAKERS 1 Presentation of Plenary, Invited, Public, Abel and Prize Speakers at the 8ECM Edited by INVITED SPEAKERS 11 Nino Bašic´ Ademir Hujdurovic´ Klavdija Kutnar THE EMS PRIZES 33 Tomaž Pisanski Vito Vitrih THE FELIX KLEIN PRIZE 43 Published by University of Primorska Press THE OTTO NEUGEBAUER PRIZE 45 Koper, Slovenia • www.hippocampus.si © 2021 University of Primorska ABEL LECTURE 49 Electronic Edition https://www.hippocampus.si/ISBN/978-961-293-071-4.pdf PUBLIC LECTURES 53 https://www.hippocampus.si/ISBN/978-961-293-072-1/index.html https://doi.org/10.26493/978-961-293-071-4 Kataložni zapis o publikaciji (CIP) pripravili v Narodni in univerzitetni knjižnici v Ljubljani COBISS.SI-ID = 65201411 ISBN 978-961-293-071-4 (pdf) ISBN 978-961-293-072-1 (html) PLENARY SPEAKERS 8th European Congress of Mathematics Plenary Speakers Peter Bühlmann Nirenberg, from the Courant Institute, New York University, 1994. Following his PhD, he has held the positions of Member of the Institute for Advanced ETH Zürich Study, Princeton, 1994–95; Habilitation à diriger des recherches, Université Pierre et Marie Curie-Paris VI, 1998; Harrington Faculty Fellow, The University of Texas at Austin, 2001–02; and Tenure Associate Professor, The University Biosketch of Texas at Austin, 2002–03. Since 2003, he has been an ICREA Research Peter Bühlmann is Professor of Mathematics and Professor at the Universitat Politècnica de Catalunya. He received the Kurt Statistics, and Director of Foundations of Data Science at ETH Zürich. He Friedrichs Prize, New York University, 1995, and is a Fellow of the American studied mathematics at ETH Zürich and received his doctoral degree in 1993 Mathematical Society, inaugural class of 2012. -
Mathematical Circus & 'Martin Gardner
MARTIN GARDNE MATHEMATICAL ;MATH EMATICAL ASSOCIATION J OF AMERICA MATHEMATICAL CIRCUS & 'MARTIN GARDNER THE MATHEMATICAL ASSOCIATION OF AMERICA Washington, DC 1992 MATHEMATICAL More Puzzles, Games, Paradoxes, and Other Mathematical Entertainments from Scientific American with a Preface by Donald Knuth, A Postscript, from the Author, and a new Bibliography by Mr. Gardner, Thoughts from Readers, and 105 Drawings and Published in the United States of America by The Mathematical Association of America Copyright O 1968,1969,1970,1971,1979,1981,1992by Martin Gardner. All riglhts reserved under International and Pan-American Copyright Conventions. An MAA Spectrum book This book was updated and revised from the 1981 edition published by Vantage Books, New York. Most of this book originally appeared in slightly different form in Scientific American. Library of Congress Catalog Card Number 92-060996 ISBN 0-88385-506-2 Manufactured in the United States of America For Donald E. Knuth, extraordinary mathematician, computer scientist, writer, musician, humorist, recreational math buff, and much more SPECTRUM SERIES Published by THE MATHEMATICAL ASSOCIATION OF AMERICA Committee on Publications ANDREW STERRETT, JR.,Chairman Spectrum Editorial Board ROGER HORN, Chairman SABRA ANDERSON BART BRADEN UNDERWOOD DUDLEY HUGH M. EDGAR JEANNE LADUKE LESTER H. LANGE MARY PARKER MPP.a (@ SPECTRUM Also by Martin Gardner from The Mathematical Association of America 1529 Eighteenth Street, N.W. Washington, D. C. 20036 (202) 387- 5200 Riddles of the Sphinx and Other Mathematical Puzzle Tales Mathematical Carnival Mathematical Magic Show Contents Preface xi .. Introduction Xlll 1. Optical Illusions 3 Answers on page 14 2. Matches 16 Answers on page 27 3. -
2017 Magdalen College Record
Magdalen College Record Magdalen College Record 2017 2017 Conference Facilities at Magdalen¢ We are delighted that many members come back to Magdalen for their wedding (exclusive to members), celebration dinner or to hold a conference. We play host to associations and organizations as well as commercial conferences, whilst also accommodating summer schools. The Grove Auditorium seats 160 and has full (HD) projection fa- cilities, and events are supported by our audio-visual technician. We also cater for a similar number in Hall for meals and special banquets. The New Room is available throughout the year for private dining for The cover photograph a minimum of 20, and maximum of 44. was taken by Marcin Sliwa Catherine Hughes or Penny Johnson would be pleased to discuss your requirements, available dates and charges. Please contact the Conference and Accommodation Office at [email protected] Further information is also available at www.magd.ox.ac.uk/conferences For general enquiries on Alumni Events, please contact the Devel- opment Office at [email protected] Magdalen College Record 2017 he Magdalen College Record is published annually, and is circu- Tlated to all members of the College, past and present. If your contact details have changed, please let us know either by writ- ing to the Development Office, Magdalen College, Oxford, OX1 4AU, or by emailing [email protected] General correspondence concerning the Record should be sent to the Editor, Magdalen College Record, Magdalen College, Ox- ford, OX1 4AU, or, preferably, by email to [email protected]. -
Downloads Over 8,000)
Volume 47 • Issue 1 IMS Bulletin January/February 2018 National Academy new member The US National Academy of Medicine (NAM) has announced the election of 70 reg- CONTENTS ular members and 10 international members. Among them is Nicholas Patrick Jewell, 1 National Academy of University of California, Berkeley. Medicine elects Jewell Election to the Academy is considered one of the highest honors in the fields of 2 Members’ news: Nick Horton, health and medicine, recognizing individuals who have made major contributions to Eric Kolaczyk, Hongzhe Li, the advancement of the medical sciences, health care, and public health. A diversity Runze Li, Douglas Simpson, of talent among NAM’s membership is Greg Lawler, Mike Jordan, Mir assured by its Articles of Organization, Masoom Ali which stipulate that at least one-quarter 3 Journal news: EJP, ECP, Prob of the membership is selected from fields Surveys; OECD guidelines outside the health professions, for exam- 4 Takis Konstantopoulos: new ple, from law, engineering, social sciences, column and the humanities—and statistics. The newly elected members bring 6 Recent papers: Electronic Journal of Probability; Electronic NAM’s total membership to 2,127 and Communications in Probability the number of international members to 172. 11 Special Invited Lecturers; IMS Fellow Nicholas P. Jewell is New Textbook Professor of Biostatistics and Statistics 12 Obituary: Ron Getoor at the University of California, Berkeley. 13 IMS Awards Since arriving at Berkeley in 1981, he has held various academic and administrative 15 Student Puzzle Corner 19; New Researcher Award positions, most notably serving as Vice Provost from 1994 to 2000. -
Basic Understanding of Condensed Phases of Matter Via Packing Models S
Perspective: Basic understanding of condensed phases of matter via packing models S. Torquato Citation: The Journal of Chemical Physics 149, 020901 (2018); doi: 10.1063/1.5036657 View online: https://doi.org/10.1063/1.5036657 View Table of Contents: http://aip.scitation.org/toc/jcp/149/2 Published by the American Institute of Physics Articles you may be interested in Announcement: Top reviewers for The Journal of Chemical Physics 2017 The Journal of Chemical Physics 149, 010201 (2018); 10.1063/1.5043197 Perspective: How to understand electronic friction The Journal of Chemical Physics 148, 230901 (2018); 10.1063/1.5035412 Aqueous solvation from the water perspective The Journal of Chemical Physics 148, 234505 (2018); 10.1063/1.5034225 Perspective: Ring-polymer instanton theory The Journal of Chemical Physics 148, 200901 (2018); 10.1063/1.5028352 Communication: Contact values of pair distribution functions in colloidal hard disks by test-particle insertion The Journal of Chemical Physics 148, 241102 (2018); 10.1063/1.5038668 Adaptive resolution molecular dynamics technique: Down to the essential The Journal of Chemical Physics 149, 024104 (2018); 10.1063/1.5031206 THE JOURNAL OF CHEMICAL PHYSICS 149, 020901 (2018) Perspective: Basic understanding of condensed phases of matter via packing models S. Torquatoa) Department of Chemistry, Department of Physics, Princeton Center for Theoretical Science, Princeton Institute for the Science and Technology of Materials, and Program in Applied and Computational Mathematics, Princeton University, Princeton, New Jersey 08544, USA (Received 17 April 2018; accepted 14 June 2018; published online 10 July 2018) Packing problems have been a source of fascination for millennia and their study has produced a rich literature that spans numerous disciplines. -
Sphere Packing, Lattice Packing, and Related Problems
Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018 Sphere packings Definition n A sphere packing in R is a collection of spheres/balls of equal size which do not overlap (except for touching). The density of a sphere packing is the volume fraction of space occupied by the balls. ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ In dimension 1, we can achieve density 1 by laying intervals end to end. In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 1, we can achieve density 1 by laying intervals end to end. Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 1, we can achieve density 1 by laying intervals end to end. In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem II In dimension 3, the best possible way is to stack layers of the solution in 2 dimensions. This is Kepler's conjecture, now a theorem of Hales and collaborators. mmm m mmm m There are infinitely (in fact, uncountably) many ways of doing this! These are the Barlow packings. Face centered cubic packing Image: Greg A L (Wikipedia), CC BY-SA 3.0 license But (until very recently!) no proofs. In very high dimensions (say ≥ 1000) densest packings are likely to be close to disordered. -
New Upper Bounds for Kissing Numbers from Semidefinite Programming
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 21, Number 3, July 2008, Pages 909–924 S 0894-0347(07)00589-9 Article electronically published on November 29, 2007 NEW UPPER BOUNDS FOR KISSING NUMBERS FROM SEMIDEFINITE PROGRAMMING CHRISTINE BACHOC AND FRANK VALLENTIN 1. Introduction In geometry, the kissing number problem asks for the maximum number τn of unit spheres that can simultaneously touch the unit sphere in n-dimensional Euclidean space without pairwise overlapping. The value of τn is only known for n =1, 2, 3, 4, 8, 24. While its determination for n =1, 2 is trivial, it is not the case for other values of n. The case n = 3 was the object of a famous discussion between Isaac Newton and David Gregory in 1694. For a historical perspective of this discussion we refer to [6]. The first valid proof of the fact “τ3 = 12”, as in the icosahedron configuration, was only given in 1953 by K. Sch¨utte and B.L. van der Waerden in [23]. In the 1970s, P. Delsarte developed a method, initially aimed at bounding codes on finite fields (see [8]) that yields an upper bound for τn as a solution of a linear program and more generally yields an upper bound for the size of spherical codes of given minimal distance. We shall refer to this method as the LP method. With this method, A.M. Odlyzko and N.J.A. Sloane ([16]), and independently V.I. Leven- shtein ([14]), proved τ8 = 240 and τ24 = 196560 which are, respectively, the number of shortest vectors in the root lattice E8 and in the Leech lattice.