Party Time for Mathematicians in Heidelberg
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Mathematical
2-12 JULY 2011 MATHEMATICAL HOST AND VENUE for Students Jacobs University Scientific Committee Étienne Ghys (École Normale The summer school is based on the park-like campus of Supérieure de Lyon, France), chair Jacobs University, with lecture halls, library, small group study rooms, cafeterias, and recreation facilities within Frances Kirwan (University of Oxford, UK) easy walking distance. Dierk Schleicher (Jacobs University, Germany) Alexei Sossinsky (Moscow University, Russia) Jacobs University is an international, highly selective, Sergei Tabachnikov (Penn State University, USA) residential campus university in the historic Hanseatic Anatoliy Vershik (St. Petersburg State University, Russia) city of Bremen. It features an attractive math program Wendelin Werner (Université Paris-Sud, France) with personal attention to students and their individual interests. Jean-Christophe Yoccoz (Collège de France) Don Zagier (Max Planck-Institute Bonn, Germany; › Home to approximately 1,200 students from over Collège de France) 100 different countries Günter M. Ziegler (Freie Universität Berlin, Germany) › English language university › Committed to excellence in higher education Organizing Committee › Has a special program with fellowships for the most Anke Allner (Universität Hamburg, Germany) talented students in mathematics from all countries Martin Andler (Université Versailles-Saint-Quentin, › Venue of the 50th International Mathematical Olympiad France) (IMO) 2009 Victor Kleptsyn (Université de Rennes, France) Marcel Oliver (Jacobs University, Germany) For more information about the mathematics program Stephanie Schiemann (Freie Universität Berlin, Germany) at Jacobs University, please visit: Dierk Schleicher (Jacobs University, Germany) math.jacobs-university.de Sergei Tabachnikov (Penn State University, USA) at Jacobs University, Bremen The School is an initiative in the framework of the European Campus of Excellence (ECE). -
Arxiv:1701.01653V1 [Math.CV] 6 Jan 2017 32J25
Bimeromorphic geometry of K¨ahler threefolds Andreas H¨oring and Thomas Peternell Abstract. We describe the recently established minimal model program for (non-algebraic) K¨ahler threefolds as well as the abundance theorem for these spaces. 1. Introduction Given a complex projective manifold X, the Minimal Model Program (MMP) predicts that either X is covered by rational curves (X is uniruled) or X has a ′ - slightly singular - birational minimal model X whose canonical divisor KX′ is nef; and then the abundance conjecture says that some multiple mKX′ is spanned by global sections (so X′ is a good minimal model). The MMP also predicts how to achieve the birational model, namely by a sequence of divisorial contractions and flips. In dimension three, the MMP is completely established (cf. [Kwc92], [KM98] for surveys), in dimension four, the existence of minimal models is es- tablished ([BCHM10], [Fuj04], [Fuj05]), but abundance is wide open. In higher dimensions minimal models exists if X is of general type [BCHM10]; abundance not being an issue in this case. In this article we discuss the following natural Question 1.1. Does the MMP work for general (non-algebraic) compact K¨ahler manifolds? Although the basic methods used in minimal model theory all fail in the K¨ahler arXiv:1701.01653v1 [math.CV] 6 Jan 2017 case, there is no apparent reason why the MMP should not hold in the K¨ahler category. And in fact, in recent papers [HP16], [HP15] and [CHP16], the K¨ahler MMP was established in dimension three: Theorem 1.2. Let X be a normal Q-factorial compact K¨ahler threefold with terminal singularities. -
Cédric VILLANI: Curriculum Vitae (Last Updated August 4, 2012)
C´edric VILLANI: Curriculum Vitae (last updated August 4, 2012) Professor of the Universit´ede Lyon Director of the Institut Henri Poincar´e 11 rue Pierre et Marie Curie, F-75230 Paris Cedex 05, FRANCE. Tel.: +33 1 44 27 64 18, fax: +33 1 46 34 04 56. E-Mail: [email protected] Internet address: http://math.univ-lyon1.fr/~villani Personal information - Born October 5, 1973 in Brive-la-Gaillarde (France); french citizen - age 38, two children - languages: french (native), english (fluent), italian - hobbies: walking, music (piano) Positions held - From 2000 to 2010 I have been professor (mathematics) in the Ecole´ Normale Sup´erieure de Lyon, where I did research and teaching up to graduate level. In September 2010 I moved to the Universit´eClaude Bernard Lyon I. - Since July 2009 I am director of the Institut Henri Poincar´e(Paris), where I do research and administration. I am the coordinator of the CARMIN structure, which gathers the four international french institutes for mathematics: CIRM, CIMPA, IHP, IHES.´ - Invited member of the Institute for Advanced Study, Princeton (January–June 2009) - Visiting Research Miller Professor at the University of Berkeley (January–May 2004) - Visiting Assistant Professor at the Georgia Tech Institute, Atlanta (Fall 1999) - Student, then agr´eg´e-pr´eparateur (“tutor”) at the ENS, Paris (1992-2000) Diplomas, titles and awards - Fields Medal (2010) - Fermat Prize (2009) - Henri Poincar´ePrize of the International Association of Mathematical Physics (2009) - Prize of the European Mathematical Society (2008) - Jacques Herbrand Prize of the Academy of Sciences (2007) - Invited lecturer at the International Congress of Mathematicians (Madrid, 2006) - Institut Universitaire de France (2006) - Harold Grad lecturer (2004) - Plenary lecturer at the International Congress of Mathematical Physics (Lisbonne, 2003) - Peccot-Vimont Prize and Cours Peccot of the Coll`ege de France (2003) - Louis Armand Prize of the Academy of Sciences (2001) - PhD Thesis (1998; advisor P.-L. -
FIELDS MEDAL for Mathematical Efforts R
Recognizing the Real and the Potential: FIELDS MEDAL for Mathematical Efforts R Fields Medal recipients since inception Year Winners 1936 Lars Valerian Ahlfors (Harvard University) (April 18, 1907 – October 11, 1996) Jesse Douglas (Massachusetts Institute of Technology) (July 3, 1897 – September 7, 1965) 1950 Atle Selberg (Institute for Advanced Study, Princeton) (June 14, 1917 – August 6, 2007) 1954 Kunihiko Kodaira (Princeton University) (March 16, 1915 – July 26, 1997) 1962 John Willard Milnor (Princeton University) (born February 20, 1931) The Fields Medal 1966 Paul Joseph Cohen (Stanford University) (April 2, 1934 – March 23, 2007) Stephen Smale (University of California, Berkeley) (born July 15, 1930) is awarded 1970 Heisuke Hironaka (Harvard University) (born April 9, 1931) every four years 1974 David Bryant Mumford (Harvard University) (born June 11, 1937) 1978 Charles Louis Fefferman (Princeton University) (born April 18, 1949) on the occasion of the Daniel G. Quillen (Massachusetts Institute of Technology) (June 22, 1940 – April 30, 2011) International Congress 1982 William P. Thurston (Princeton University) (October 30, 1946 – August 21, 2012) Shing-Tung Yau (Institute for Advanced Study, Princeton) (born April 4, 1949) of Mathematicians 1986 Gerd Faltings (Princeton University) (born July 28, 1954) to recognize Michael Freedman (University of California, San Diego) (born April 21, 1951) 1990 Vaughan Jones (University of California, Berkeley) (born December 31, 1952) outstanding Edward Witten (Institute for Advanced Study, -
System Design in the Era of Iot — Meeting the Autonomy Challenge (Invited Paper)
System Design in the Era of IoT — Meeting the Autonomy Challenge (Invited paper) Joseph Sifakis University Grenoble Alpes and CNRS / Verimag Grenoble, France [email protected] The advent of IoT is a great opportunity to reinvigorate Computing by focusing on autonomous system design. This certainly raises technology questions but, more importantly, it requires building new foundation that will systematically integrate the innovative results needed to face increasing environment and mission complexity. A key idea is to compensate the lack of human intervention by adaptive control. This is instru- mental for system resilience: it allows both coping with uncertainty and managing mixed criticality services. Our proposal for knowledge-based design seeks a compromise: preserving rigorousness despite the fact that essential properties cannot be guaranteed at design time. It makes knowledge generation and application a primary concern and aims to fully and seamlessly incorporate the adap- tive control paradigm in system architecture. 1 Introduction 1.1 The IoT vision The IoT vision promises increasingly interconnected smart systems providing autonomous services for the optimal management of resources and enhanced quality of life. These are used in smart grids, smart transport systems, smart health care services, automated banking services, smart factories, etc. Their coordination should be achieved using a unified network infrastructure, in particular to collect data and send them to the cloud which in return should provide intelligent services and ensure global monitoring and control. The IoT vision raises a lot of expectations and in our opinion, some over-optimism about its short- term outcome and impact. According to analysts, the IoT consists of two segments of uneven difficulty. -
Race in the Age of Obama Making America More Competitive
american academy of arts & sciences summer 2011 www.amacad.org Bulletin vol. lxiv, no. 4 Race in the Age of Obama Gerald Early, Jeffrey B. Ferguson, Korina Jocson, and David A. Hollinger Making America More Competitive, Innovative, and Healthy Harvey V. Fineberg, Cherry A. Murray, and Charles M. Vest ALSO: Social Science and the Alternative Energy Future Philanthropy in Public Education Commission on the Humanities and Social Sciences Reflections: John Lithgow Breaking the Code Around the Country Upcoming Events Induction Weekend–Cambridge September 30– Welcome Reception for New Members October 1–Induction Ceremony October 2– Symposium: American Institutions and a Civil Society Partial List of Speakers: David Souter (Supreme Court of the United States), Maj. Gen. Gregg Martin (United States Army War College), and David M. Kennedy (Stanford University) OCTOBER NOVEMBER 25th 12th Stated Meeting–Stanford Stated Meeting–Chicago in collaboration with the Chicago Humanities Perspectives on the Future of Nuclear Power Festival after Fukushima WikiLeaks and the First Amendment Introduction: Scott D. Sagan (Stanford Introduction: John A. Katzenellenbogen University) (University of Illinois at Urbana-Champaign) Speakers: Wael Al Assad (League of Arab Speakers: Geoffrey R. Stone (University of States) and Jayantha Dhanapala (Pugwash Chicago Law School), Richard A. Posner (U.S. Conferences on Science and World Affairs) Court of Appeals for the Seventh Circuit), 27th Judith Miller (formerly of The New York Times), Stated Meeting–Berkeley and Gabriel Schoenfeld (Hudson Institute; Healing the Troubled American Economy Witherspoon Institute) Introduction: Robert J. Birgeneau (Univer- DECEMBER sity of California, Berkeley) 7th Speakers: Christina Romer (University of Stated Meeting–Stanford California, Berkeley) and David H. -
Dynamics, Equations and Applications Book of Abstracts Session
DYNAMICS, EQUATIONS AND APPLICATIONS BOOK OF ABSTRACTS SESSION D21 AGH University of Science and Technology Kraków, Poland 1620 September 2019 2 Dynamics, Equations and Applications CONTENTS Plenary lectures 7 Artur Avila, GENERIC CONSERVATIVE DYNAMICS . .7 Alessio Figalli, ON THE REGULARITY OF STABLE SOLUTIONS TO SEMI- LINEAR ELLIPTIC PDES . .7 Martin Hairer, RANDOM LOOPS . .8 Stanislav Smirnov, 2D PERCOLATION REVISITED . .8 Shing-Tung Yau, STABILITY AND NONLINEAR PDES IN MIRROR SYMMETRY8 Maciej Zworski, FROM CLASSICAL TO QUANTUM AND BACK . .9 Public lecture 11 Alessio Figalli, FROM OPTIMAL TRANSPORT TO SOAP BUBBLES AND CLOUDS: A PERSONAL JOURNEY . 11 Invited talks of part D2 13 Stefano Bianchini, DIFFERENTIABILITY OF THE FLOW FOR BV VECTOR FIELDS . 13 Yoshikazu Giga, ON THE LARGE TIME BEHAVIOR OF SOLUTIONS TO BIRTH AND SPREAD TYPE EQUATIONS . 14 David Jerison, THE TWO HYPERPLANE CONJECTURE . 14 3 4 Dynamics, Equations and Applications Sergiu Klainerman, ON THE NONLINEAR STABILITY OF BLACK HOLES . 15 Aleksandr Logunov, ZERO SETS OF LAPLACE EIGENFUCNTIONS . 16 Felix Otto, EFFECTIVE BEHAVIOR OF RANDOM MEDIA . 17 Endre Süli, IMPLICITLY CONSTITUTED FLUID FLOW MODELS: ANALYSIS AND APPROXIMATION . 17 András Vasy, GLOBAL ANALYSIS VIA MICROLOCAL TOOLS: FREDHOLM THEORY IN NON-ELLIPTIC SETTINGS . 19 Luis Vega, THE VORTEX FILAMENT EQUATION, THE TALBOT EFFECT, AND NON-CIRCULAR JETS . 20 Enrique Zuazua, POPULATION DYNAMICS AND CONTROL . 20 Talks of session D21 23 Giovanni Bellettini, ON THE RELAXED AREA OF THE GRAPH OF NONS- MOOTH MAPS FROM THE PLANE TO THE PLANE . 23 Sun-Sig Byun, GLOBAL GRADIENT ESTIMATES FOR NONLINEAR ELLIP- TIC PROBLEMS WITH NONSTANDARD GROWTH . 24 Juan Calvo, A BRIEF PERSPECTIVE ON TEMPERED DIFFUSION EQUATIONS 25 Giacomo Canevari, THE SET OF TOPOLOGICAL SINGULARITIES OF VECTOR- VALUED MAPS . -
Prof. Joseph Sifakis 2018 Turing Awardee, Computer Science @ Sahyadri Mangaluru Prof
I CO DR NC A L Y A H V E A S SAHYADRI CONCLAVE SCIENCE • TECHNOLOGY • MANAGEMENT 6 - 10th January Prof. Joseph Sifakis 2018 Turing Awardee, Computer Science @ Sahyadri Mangaluru Prof. Joseph Sifakis - Turing Awardee, Computer Science Prof. Joseph Sifakis is Emeritus Senior CNRS Researcher at Verimag. His current research interests cover fundamental and applied aspects of embedded systems design. The main focus of his work is on the formalization of system design as a process leading from given requirements to trustworthy, optimized and correct-by-construction implementations. He has been a full time professor at Ecole Polytechnique Fédérale de Lausanne (EPFL) for the period 2011-2016. He is the founder of the Verimag laboratory in Grenoble, which he directed for 13 years. Verimag is a leading research laboratory in the area of embedded systems, internationally known for the development of the Lustre synchronous language used by the SCADE tool for the design of safety-critical avionics and space applications. In 2007, Professor Joseph Sifakis has received the Turing Award for his contribution to the theory and application of model checking, the most widely used system verification technique today. He has participated in many major industrial projects led by companies such as Airbus, EADS, France Telecom, Astrium, and STMicroelectronics. He is a member of the French Academy of Sciences, a member of the French National Academy of Engineering, a member of Academia Europea, a member of the American Academy of Arts and Sciences, and a member of the National Academy of Engineering. He is a Grand Officer of the French National Order of Merit, a Commander of the French Legion of Honor. -
Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011
Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011 TABLE OF CONTENTS EXECUTIVE SUMMARY 2 A. PARTICIPANT LIST 3 B. FINANCIAL SUPPORT LIST 4 C. INCOME AND EXPENDITURE REPORT 4 D. POSTDOCTORAL PLACEMENT LIST 5 E. INSTITUTE DIRECTORS‘ MEETING REPORT 6 F. PARTICIPANT SUMMARY 12 G. POSTDOCTORAL PROGRAM SUMMARY 13 H. GRADUATE STUDENT PROGRAM SUMMARY 14 I. UNDERGRADUATE STUDENT PROGRAM SUMMARY 15 J. PROGRAM DESCRIPTION 15 K. PROGRAM CONSULTANT LIST 38 L. PUBLICATIONS LIST 50 M. INDUSTRIAL AND GOVERNMENTAL INVOLVEMENT 51 N. EXTERNAL SUPPORT 52 O. COMMITTEE MEMBERSHIP 53 P. CONTINUING IMPACT OF PAST IPAM PROGRAMS 54 APPENDIX 1: PUBLICATIONS (SELF-REPORTED) 2009-2010 58 Institute for Pure and Applied Mathematics, UCLA Award/Institution #0439872-013151000 Annual Progress Report for 2009-2010 August 1, 2011 EXECUTIVE SUMMARY Highlights of IPAM‘s accomplishments and activities of the fiscal year 2009-2010 include: IPAM held two long programs during 2009-2010: o Combinatorics (fall 2009) o Climate Modeling (spring 2010) IPAM‘s 2010 winter workshops continued the tradition of focusing on emerging topics where Mathematics plays an important role: o New Directions in Financial Mathematics o Metamaterials: Applications, Analysis and Modeling o Mathematical Problems, Models and Methods in Biomedical Imaging o Statistical and Learning-Theoretic Challenges in Data Privacy IPAM sponsored reunion conferences for four long programs: Optimal Transport, Random Shapes, Search Engines and Internet MRA IPAM sponsored three public lectures since August. Noga Alon presented ―The Combinatorics of Voting Paradoxes‖ on October 5, 2009. Pierre-Louis Lions presented ―On Mean Field Games‖ on January 5, 2010. -
Magic Adversaries Versus Individual Reduction: Science Wins Either Way ?
Magic Adversaries Versus Individual Reduction: Science Wins Either Way ? Yi Deng1;2 1 SKLOIS, Institute of Information Engineering, CAS, Beijing, P.R.China 2 State Key Laboratory of Cryptology, P. O. Box 5159, Beijing ,100878,China [email protected] Abstract. We prove that, assuming there exists an injective one-way function f, at least one of the following statements is true: – (Infinitely-often) Non-uniform public-key encryption and key agreement exist; – The Feige-Shamir protocol instantiated with f is distributional concurrent zero knowledge for a large class of distributions over any OR NP-relations with small distinguishability gap. The questions of whether we can achieve these goals are known to be subject to black-box lim- itations. Our win-win result also establishes an unexpected connection between the complexity of public-key encryption and the round-complexity of concurrent zero knowledge. As the main technical contribution, we introduce a dissection procedure for concurrent ad- versaries, which enables us to transform a magic concurrent adversary that breaks the distribu- tional concurrent zero knowledge of the Feige-Shamir protocol into non-black-box construc- tions of (infinitely-often) public-key encryption and key agreement. This dissection of complex algorithms gives insight into the fundamental gap between the known universal security reductions/simulations, in which a single reduction algorithm or simu- lator works for all adversaries, and the natural security definitions (that are sufficient for almost all cryptographic primitives/protocols), which switch the order of qualifiers and only require that for every adversary there exists an individual reduction or simulator. 1 Introduction The seminal work of Impagliazzo and Rudich [IR89] provides a methodology for studying the lim- itations of black-box reductions. -
The Work of Wendelin Werner
The work of Wendelin Werner Charles M. Newman∗ 1. Introduction It is my great pleasure to briefly report on some of Wendelin Werner’s research ac- complishments that have led to his being awarded a Fields Medal at this International Congress of Mathematicians of 2006. There are a number of aspects of Werner’s work that add to my pleasure in this event. One is that he was trained as a probabilist, receiving his Ph.D. in 1993 under the supervision of Jean-François Le Gall in Paris with a dissertation concerning planar Brownian Motion – which, as we shall see, plays a major role in his later work as well. Until now, Probability Theory had not been represented among Fields Medals and so I am enormously pleased to be here to witness a change in that history. I myself was originally trained, not in Probability Theory, but in Mathematical Physics. Werner’s work, together with his collaborators such as Greg Lawler, Oded Schramm and Stas Smirnov, involves applications of Probablity and Conformal Map- ping Theory to fundamental issues in Statistical Physics, as we shall discuss. A second source of pleasure is my belief that this, together with other work of recent years, represents a watershed in the interaction between Mathematics and Physics generally. Namely, mathematicians such as Werner are not only providing rigorous proofs of already existing claims in the Physics literature, but beyond that are provid- ing quite new conceptual understanding of basic phenomena – in this case, a direct geometric picture of the intrinsically random structure of physical systems at their critical points (at least in two dimensions). -
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.