January 2011 Prizes and Awards
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Tōhoku Rick Jardine
INFERENCE / Vol. 1, No. 3 Tōhoku Rick Jardine he publication of Alexander Grothendieck’s learning led to great advances: the axiomatic description paper, “Sur quelques points d’algèbre homo- of homology theory, the theory of adjoint functors, and, of logique” (Some Aspects of Homological Algebra), course, the concepts introduced in Tōhoku.5 Tin the 1957 number of the Tōhoku Mathematical Journal, This great paper has elicited much by way of commen- was a turning point in homological algebra, algebraic tary, but Grothendieck’s motivations in writing it remain topology and algebraic geometry.1 The paper introduced obscure. In a letter to Serre, he wrote that he was making a ideas that are now fundamental; its language has with- systematic review of his thoughts on homological algebra.6 stood the test of time. It is still widely read today for the He did not say why, but the context suggests that he was clarity of its ideas and proofs. Mathematicians refer to it thinking about sheaf cohomology. He may have been think- simply as the Tōhoku paper. ing as he did, because he could. This is how many research One word is almost always enough—Tōhoku. projects in mathematics begin. The radical change in Gro- Grothendieck’s doctoral thesis was, by way of contrast, thendieck’s interests was best explained by Colin McLarty, on functional analysis.2 The thesis contained important who suggested that in 1953 or so, Serre inveigled Gro- results on the tensor products of topological vector spaces, thendieck into working on the Weil conjectures.7 The Weil and introduced mathematicians to the theory of nuclear conjectures were certainly well known within the Paris spaces. -
The Multiplicative Weights Update Method: a Meta Algorithm and Applications
The Multiplicative Weights Update Method: a Meta Algorithm and Applications Sanjeev Arora∗ Elad Hazan Satyen Kale Abstract Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analysis are usually very similar and rely on an exponential potential function. We present a simple meta algorithm that unifies these disparate algorithms and drives them as simple instantiations of the meta algo- rithm. 1 Introduction Algorithms in varied fields work as follows: a distribution is maintained on a certain set, and at each step the probability assigned to i is multi- plied or divided by (1 + C(i)) where C(i) is some kind of “payoff” for element i. (Rescaling may be needed to ensure that the new values form a distribution.) Some examples include: the Ada Boost algorithm in ma- chine learning [FS97]; algorithms for game playing studied in economics (see below), the Plotkin-Shmoys-Tardos algorithm for packing and covering LPs [PST91], and its improvements in the case of flow problems by Young, Garg-Konneman, and Fleischer [You95, GK98, Fle00]; Impagliazzo’s proof of the Yao XOR lemma [Imp95], etc. The analysis of the running time uses a potential function argument and the final running time is proportional to 1/2. It has been clear to most researchers that these results are very similar, see for instance, Khandekar’s PhD thesis [Kha04]. Here we point out that these are all instances of the same (more general) algorithm. This meta ∗This project supported by David and Lucile Packard Fellowship and NSF grant CCR- 0205594. -
Iasthe Institute Letter
S11-03191_SpringNL.qxp 4/13/11 7:52 AM Page 1 The Institute Letter InstituteIAS for Advanced Study Spring 2011 DNA, History, and Archaeology “Spontaneous Revolution” in Tunisia BY NICOLA DI COSMO Yearnings for Freedom, Justice, and Dignity istorians today can hardly BY MOHAMED NACHI Hanswer the question: when does history begin? Tra- he Tunisian revolution ditional boundaries between Tof 2011 (al-thawra al- history, protohistory, and pre- tunisiya) was the result of a history have been blurred if series of protests and insur- not completely erased by the rectional demonstrations, rise of concepts such as “Big which started in December History” and “macrohistory.” If 2010 and reached culmi- even the Big Bang is history, nation on January 14, 2011, connected to human evolu- with the flight of Zine el- tion and social development Abidine Ben Ali, the dic- REUTERS/ZOHRA BENSEMRA through a chain of geological, tator who had held power Protests in Tunisia culminated when Zine el-Abidine Ben Ali, biological, and ecological for twenty-three years. It did who had ruled for twenty-three years, fled on January 14, 2011. THE NEW YORKER COLLECTION FROM CARTOONBANK.COM. ALL RIGHTS RESERVED. events, then the realm of his- not occur in a manner com- tory, while remaining firmly anthropocentric, becomes all-embracing. parable to other revolutions. The army, for instance, did not intervene, nor were there An expanding historical horizon that, from antiquity to recent times, attempts to actions of an organized rebellious faction. The demonstrations were peaceful, although include places far beyond the sights of literate civilizations and traditional caesuras the police used live ammunition, bringing the death toll to more than one hundred. -
On the Strong Density Conjecture for Integral Apollonian Circle Packings
ON THE STRONG DENSITY CONJECTURE FOR INTEGRAL APOLLONIAN CIRCLE PACKINGS JEAN BOURGAIN AND ALEX KONTOROVICH Abstract. We prove that a set of density one satisfies the Strong Density Conjecture for Apollonian Circle Packings. That is, for a fixed integral, primitive Apollonian gasket, almost every (in the sense of density) sufficiently large, admissible (passing local ob- structions) integer is the curvature of some circle in the packing. Contents 1. Introduction2 2. Preliminaries I: The Apollonian Group and Its Subgroups5 3. Preliminaries II: Automorphic Forms and Representations 12 4. Setup and Outline of the Proof 16 5. Some Lemmata 22 6. Major Arcs 35 7. Minor Arcs I: Case q < Q0 38 8. Minor Arcs II: Case Q0 ≤ Q < X 41 9. Minor Arcs III: Case X ≤ Q < M 45 References 50 arXiv:1205.4416v1 [math.NT] 20 May 2012 Date: May 22, 2012. Bourgain is partially supported by NSF grant DMS-0808042. Kontorovich is partially supported by NSF grants DMS-1209373, DMS-1064214 and DMS-1001252. 1 2 JEAN BOURGAIN AND ALEX KONTOROVICH 1333 976 1584 1108 516 1440864 1077 1260 909 616 381 1621 436 1669 1581 772 1872 1261 204 1365 1212 1876 1741 669 156 253 1756 1624 376 1221 1384 1540 877 1317 525 876 1861 1861 700 1836 541 1357 901 589 85 1128 1144 1381 1660 1036 360 1629 1189 844 7961501 1216 309 468 189 877 1477 1624 661 1416 1732 621 1141 1285 1749 1821 1528 1261 1876 1020 1245 40 805 744 1509 781 1429 616 373 885 453 76 1861 1173 1492 912 1356 469 285 1597 1693 6161069 724 1804 1644 1308 1357 1341 316 1333 1384 861 996 460 1101 10001725 469 1284 181 1308 -
Curriculum Vitae
Curriculum Vitae Assaf Naor Address: Princeton University Department of Mathematics Fine Hall 1005 Washington Road Princeton, NJ 08544-1000 USA Telephone number: +1 609-258-4198 Fax number: +1 609-258-1367 Electronic mail: [email protected] Web site: http://web.math.princeton.edu/~naor/ Personal Data: Date of Birth: May 7, 1975. Citizenship: USA, Israel, Czech Republic. Employment: • 2002{2004: Post-doctoral Researcher, Theory Group, Microsoft Research. • 2004{2007: Permanent Member, Theory Group, Microsoft Research. • 2005{2007: Affiliate Assistant Professor of Mathematics, University of Washington. • 2006{2009: Associate Professor of Mathematics, Courant Institute of Mathematical Sciences, New York University (on leave Fall 2006). • 2008{2015: Associated faculty member in computer science, Courant Institute of Mathematical Sciences, New York University (on leave in the academic year 2014{2015). • 2009{2015: Professor of Mathematics, Courant Institute of Mathematical Sciences, New York University (on leave in the academic year 2014{2015). • 2014{present: Professor of Mathematics, Princeton University. • 2014{present: Associated Faculty, The Program in Applied and Computational Mathematics (PACM), Princeton University. • 2016 Fall semester: Henry Burchard Fine Professor of Mathematics, Princeton University. • 2017{2018: Member, Institute for Advanced Study. • 2020 Spring semester: Henry Burchard Fine Professor of Mathematics, Princeton University. 1 Education: • 1993{1996: Studies for a B.Sc. degree in Mathematics at the Hebrew University in Jerusalem. Graduated Summa Cum Laude in 1996. • 1996{1998: Studies for an M.Sc. degree in Mathematics at the Hebrew University in Jerusalem. M.Sc. thesis: \Geometric Problems in Non-Linear Functional Analysis," prepared under the supervision of Joram Lindenstrauss. Graduated Summa Cum Laude in 1998. -
The Best Nurturers in Computer Science Research
The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities. -
Prizes and Awards
MathFest 2010 Prizes and Awards Pittsburgh, Pennsylvania August 6, 2010 Program Opening and Closing Remarks David Bressoud, President Mathematical Association of America Carl B. Allendoerfer Awards ..................................... 1 Trevor Evans Awards ............................................... 7 Lester R. Ford Awards ............................................ 12 George Pólya Awards ............................................. 25 Annie and John Selden Prize ................................. 29 Henry L. Alder Awards ........................................... 31 Carl B. Allendoerfer Awards The Carl B. Allendoerfer Awards, established in 1976, are made to authors of expository articles published in Mathematics Magazine. The Awards are named for Carl B. Allendoerfer, a distinguished mathematician at the University of Washington and President of the Mathematical Association of America, 1959-60. Ezra Brown and Keith Mellinger “Kirkman‟s Schoolgirls Wearing Hats and Walking Through Fields of Numbers,” Mathematics Magazine, 82:1 (2009), p. 3-15. The historical basis for this interesting article is a problem in recreational mathematics posed by T. P. Kirkman in 1850. Kirkman‘s problem states: ―Fifteen young ladies of a school walk out three abreast for seven days in succession: it is required to arrange them daily so that no two shall walk abreast more than once.‖ Using this problem as a springboard, the authors treat the reader to a captivating exploration of the theory and applications of block designs. In the process, solutions to the schoolgirls problem are uncovered in such seemingly unrelated areas as the subfield structure of algebraic number fields and the configuration of ―spreads‖ and ―packings‖ in finite projective geometry. Additional connections to the schoolgirls problem are revealed by the authors‘ extension of Todd Ebert‘s ―Three Hats‖ problem to an analogous problem involving fifteen hats. -
Arxiv:Math/9701203V1 [Math.FA] 17 Jan 1997 Hs,Lpcizhomeomorphism Lipschitz Phism, Aesae Eas Rv Hti a If I That It Prove Then Also Spaces We These of Space
BANACH SPACES DETERMINED BY THEIR UNIFORM STRUCTURES + + by William B. Johnson*†‡, Joram Lindenstrauss‡ , and Gideon Schechtman‡ Dedicated to the memory of E. Gorelik Abstract Following results of Bourgain and Gorelik we show that the spaces ℓp, 1 < p < ∞, as well as some related spaces have the following uniqueness property: If X is a Banach space uniformly homeomorphic to one of these spaces then it is linearly isomorphic to the same space. We also prove that if a C(K) space is uniformly homeomorphic to c0, then it is isomorphic to c0. We show also that there are Banach spaces which are uniformly homeomorphic to exactly 2 isomorphically distinct spaces. arXiv:math/9701203v1 [math.FA] 17 Jan 1997 Subject classification: 46B20, 54Hxx. Keywords: Banach spaces, Uniform homeomor- phism, Lipschitz homeomorphism * Erna and Jacob Michael Visiting Professor, The Weizmann Institute, 1994 † Supported in part by NSF DMS 93-06376 ‡ Supported in part by the U.S.-Israel Binational Science Foundation + Participant, Workshop in Linear Analysis and Probability, Texas A&M University 0. Introduction The first result in the subject we study is the Mazur-Ulam theorem which says that an isometry from one Banach space onto another which takes the origin to the origin must be linear. This result, which is nontrivial only when the Banach spaces are not strictly convex, means that the structure of a Banach space as a metric space determines the linear structure up to translation. On the other hand, the structure of an infinite dimensional Banach space as a topological space gives no information about the linear structure of the space [Kad], [Tor]. -
Adler, Mccarthy Engulfed in WWII 'Fog' - Variety.Com 1/4/10 12:03 PM
Adler, McCarthy engulfed in WWII 'Fog' - Variety.com 1/4/10 12:03 PM http://www.variety.com/index.asp?layout=print_story&articleid=VR1118013143&categoryid=13 To print this page, select "PRINT" from the File Menu of your browser. Posted: Mon., Dec. 28, 2009, 8:00pm PT Adler, McCarthy engulfed in WWII 'Fog' Producers option sci-fi horror comicbook 'Night and Fog' By TATIANA SIEGEL Producers Gil Adler and Shane McCarthy have optioned the sci-fi horror comicbook "Night and Fog" from publisher Studio 407. No stranger to comicbook-based material, Adler has produced such graphic-based fare as "Constantine," "Superman Returns" and the upcoming Brandon Routh starrer "Dead of Night," which is based on the popular Italian title "Dylan Dog." This material is definitely in my strike zone in more ways than one," Adler said, noting his prior role as a producer of such horror projects as the "Tales From the Crypt" series. "But what really appealed to me wasn't so much the genre trappings but rather the characters that really drive this story." Set during WWII, story revolves around an infectious mist unleashed on a military base that transforms its victims into preternatural creatures of the night. But when the survivors try to kill them, they adapt and change into something even more horrific and unstoppable. Studio 407's Alex Leung will also serve as a producer on "Night and Fog." Adler and McCarthy are also teaming to produce an adaptation of "Havana Nocturne" along with Eric Eisner. They also recently optioned Ken Bruen's crime thriller "Tower." "Night and Fog" is available in comic shops in the single-issue format and digitally on iPhone through Comixology. -
Awards of ICCM 2013 by the Editors
Awards of ICCM 2013 by the Editors academies of France, Sweden and the United States. He is a recipient of the Fields Medal (1986), the Crafoord Prize Morningside Medal of Mathematics in Mathematics (1994), the King Faisal International Prize Selection Committee for Science (2006), and the Shaw Prize in Mathematical The Morningside Medal of Mathematics Selection Sciences (2009). Committee comprises a panel of world renowned mathematicians and is chaired by Professor Shing-Tung Björn Engquist Yau. A nomination committee of around 50 mathemati- Professor Engquist is the Computational and Applied cians from around the world nominates candidates based Mathematics Chair Professor at the University of Texas at on their research, qualifications, and curriculum vitae. Austin. His recent work includes homogenization theory, The Selection Committee reviews these nominations and multi-scale methods, and fast algorithms for wave recommends up to two recipients for the Morningside propagation. He is a member of the Royal Swedish Gold Medal of Mathematics, up to two recipients for the Morningside Gold Medal of Applied Mathematics, and up to four recipients for the Morningside Silver Medal of Mathematics. The Selection Committee members, with the exception of the committee chair, are all non-Chinese to ensure the independence, impartiality and integrity of the awards decision. Members of the 2013 Morningside Medal of Mathe- matics Selection Committee are: Richard E. Borcherds Professor Borcherds is Professor of Mathematics at the University of California at Berkeley. His research in- terests include Lie algebras, vertex algebras, and auto- morphic forms. He is best known for his work connecting the theory of finite groups with other areas in mathe- matics. -
October 2008
THE LONDON MATHEMATICAL SOCIETY NEWSLETTER No. 374 October 2008 Society THE PROPOSAL FOR A NEW SOCIETY Meetings In all likelihood you will now have present form fulfil many of the and Events received a copy of the proposal hopes and expectations of their for a new society, combining the members, times are changing and 2008 present London Mathematical the need for mathematics as a uni- Friday 21 November Society and Institute of Mathe- fied activity to hold and defend AGM, London matics and its Applications. For its position in the public sphere [page 3] a new society to be formed, the grows constantly greater. IMA and the LMS must both vote As the Presidents’ letter which 12–13 December separately in favour of the accompanies the report makes Joint Meeting with proposal. clear, there is a pressing need to the Edinburgh There has been debate about engage effectively with govern- Mathematical Society this for several years but mem- ment, with external bodies, with Edinburgh [page 7] bers could be forgiven for think- the media and with the public. ing that, despite progress reports A society that represents the 2009 appearing in Mathematics Today broad spectrum of the mathemat- Friday 27 February and the Newsletter, things had ical community and has a larger Mary Cartwright ‘gone quiet’. The process leading membership must inevitably carry Lecture, London up to the present proposal has greater weight. been protracted not because the Your view is important and you 31 March – 4 April two societies disagree with one will soon have an opportunity to LMS Invited Lectures another, which they do not, but take part in this important deci- Edinburgh because those developing the new sion. -
Prize Is Awarded Every Three Years at the Joint Mathematics Meetings
AMERICAN MATHEMATICAL SOCIETY LEVI L. CONANT PRIZE This prize was established in 2000 in honor of Levi L. Conant to recognize the best expository paper published in either the Notices of the AMS or the Bulletin of the AMS in the preceding fi ve years. Levi L. Conant (1857–1916) was a math- ematician who taught at Dakota School of Mines for three years and at Worcester Polytechnic Institute for twenty-fi ve years. His will included a bequest to the AMS effective upon his wife’s death, which occurred sixty years after his own demise. Citation Persi Diaconis The Levi L. Conant Prize for 2012 is awarded to Persi Diaconis for his article, “The Markov chain Monte Carlo revolution” (Bulletin Amer. Math. Soc. 46 (2009), no. 2, 179–205). This wonderful article is a lively and engaging overview of modern methods in probability and statistics, and their applications. It opens with a fascinating real- life example: a prison psychologist turns up at Stanford University with encoded messages written by prisoners, and Marc Coram uses the Metropolis algorithm to decrypt them. From there, the article gets even more compelling! After a highly accessible description of Markov chains from fi rst principles, Diaconis colorfully illustrates many of the applications and venues of these ideas. Along the way, he points to some very interesting mathematics and some fascinating open questions, especially about the running time in concrete situ- ations of the Metropolis algorithm, which is a specifi c Monte Carlo method for constructing Markov chains. The article also highlights the use of spectral methods to deduce estimates for the length of the chain needed to achieve mixing.