View Front and Back Matter from The
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Circle Packing Theorem
Alma Mater Studiorum · Università di Bologna SCUOLA DI SCIENZE Corso di Laurea in Matematica THE CIRCLE PACKING THEOREM Tesi di Laurea in Analisi Relatore: Pesentata da: Chiar.mo Prof. Georgian Sarghi Nicola Arcozzi Sessione Unica Anno Accademico 2018/2019 Introduction The study of tangent circles has a rich history that dates back to antiquity. Already in the third century BC, Apollonius of Perga, in his exstensive study of conics, introduced problems concerning tangency. A famous result attributed to Apollonius is the following. Theorem 0.1 (Apollonius - 250 BC). Given three mutually tangent circles C1, C2, 1 C3 with disjoint interiors , there are precisely two circles tangent to all the three initial circles (see Figure1). A simple proof of this fact can be found here [Sar11] and employs the use of Möbius transformations. The topic of circle packings as presented here, is sur- prisingly recent and originates from William Thurston's famous lecture notes on 3-manifolds [Thu78] in which he proves the theorem now known as the Koebe-Andreev- Thurston Theorem or Circle Packing Theorem. He proves it as a consequence of previous work of E. M. Figure 1 Andreev and establishes uniqueness from Mostov's rigid- ity theorem, an imporant result in Hyperbolic Geometry. A few years later Reiner Kuhnau pointed out a 1936 proof by german mathematician Paul Koebe. 1We dene the interior of a circle to be one of the connected components of its complement (see the colored regions in Figure1 as an example). i ii A circle packing is a nite set of circles in the plane, or equivalently in the Riemann sphere, with disjoint interiors and whose union is connected. -
Non-Existence of Annular Separators in Geometric Graphs
Non-existence of annular separators in geometric graphs Farzam Ebrahimnejad∗ James R. Lee† Paul G. Allen School of Computer Science & Engineering University of Washington Abstract Benjamini and Papasoglou (2011) showed that planar graphs with uniform polynomial volume growth admit 1-dimensional annular separators: The vertices at graph distance ' from any vertex can be separated from those at distance 2' by removing at most $ ' vertices. They asked whether geometric 3-dimensional graphs with uniform polynomial volume¹ º growth similarly admit 3 1 -dimensional annular separators when 3 7 2. We show that this fails in a strong sense: For¹ any− 3º > 3 and every B > 1, there is a collection of interior-disjoint spheres in R3 whose tangency graph has uniform polynomial growth, but such that all annular separators in have cardinality at least 'B. 1 Introduction The well-known Lipton-Tarjan separator theorem [LT79] asserts that any =-vertex planar graph has a balanced separator with $ p= vertices. By the Koebe-Andreev-Thurston circle packing ¹ º theorem, every planar graph can be realized as the tangency graph of interior-disjoint circles in the plane. One can define 3-dimensional geometric graphs by analogy: Take a collection of “almost 3 non-overlapping” bodies (E R : E + , where each (E is “almost round,” and the associated f ⊆ 2 g geometric graph contains an edge D,E if (D and (E “almost touch.” f g As a prototypical example, suppose we require that every point G R3 is contained in at most : 2 of the bodies (E , each (E is a Euclidean ball, and two bodies are considered adjacent whenever f g (D (E < . -
Mathematics People, Volume 52, Number 6
Mathematics People Fourier-Mukai transform. He is also working on under- 2005–2006 AMS Centennial standing the structure of cones of divisors on smooth Fellowships Awarded projective varieties by analyzing asymptotic invariants as- sociated to base loci of linear series. He plans to use his The AMS has awarded two Centennial Fellowships for Centennial Fellowship at the University of Michigan and 2005–2006. The recipients are YUAN-PIN LEE of the Univer- the University of Rome, as well as at the University of sity of Utah and MIHNEA POPA of Harvard University. The Chicago. amount of each fellowship is $62,000. The Centennial Please note: Information about the competition for the 2006–2007 AMS Centennial Fellowships will be published in the “Mathematics Opportunities” section of an upcom- ing issue of the Notices. —Allyn Jackson Cerf and Kahn Receive Turing Award The Association for Computing Machinery (ACM) has named VINTON G. CERF and ROBERT E. KAHN the winners of the 2004 A. M. Turing Award, considered the “Nobel Prize of Computing”, for pioneering work on the design and Yuan-Pin Lee Mihnea Popa implementation of the Internet’s basic communications protocols. Cerf is the senior vice president for technology Fellows also receive an expense allowance of $3,000 and strategy at MCI. Kahn is chairman, chief executive officer, a complimentary Society membership for one year. and president of the Corporation for National Research Initiatives (CNRI), a not-for-profit organization for research Yuan-Pin Lee in the public interest on strategic development of Yuan-Pin Lee received his Ph.D. in 1999 from the University network-based information technologies. -
A Probability-Rich ICM Reviewed
March. 2007 IMs Bulletin . A Probability-rich ICM reviewed Louis Chen, National University of Singapore, and Jean-François Le Wendelin Werner’s Work Gall, Ecole Normale Supérieure, report on the 2006 International Although the Fields Medal was awarded to Congress of Mathematicians, held last August in Madrid, Spain. a probabilist for the first time, it was not The 2006 International Congress of surprising that Wendelin Werner was the Mathematicians in Madrid was exception- one. Werner was born in Germany in 1968, ally rich in probability theory. Not only but his parents settled in France when he was the Fields Medal awarded for the first was one year old, and he acquired French time to a probabilist, Wendelin Werner nationality a few years later. After study- Wendelin Werner (see below), it was also awarded to Andrei ing at the Ecole Normale Supérieure de Okounkov whose work bridges probability Paris, he defended his PhD thesis in Paris with other branches of mathematics. Both in 1993, shortly after getting a permanent research position at the Okounkov and Werner had been invited to CNRS. He became a Professor at University Paris-Sud Orsay in give a 45-minute lecture each in the probability and statistics sec- 1997. Before winning the Fields Medal, he had received many other tion before their Fields Medal awards were announced. awards, including the 2000 Prize of the European Mathematical The newly created Gauss Prize (in full, the Carl Friedrich Gauss Society, the 2001 Fermat Prize, the 2005 Loève Prize and the 2006 Prize) for applications of mathematics was awarded to Kiyosi Itô, Polya Prize. -
Russell David Lyons
Russell David Lyons Education Case Western Reserve University, Cleveland, OH B.A. summa cum laude with departmental honors, May 1979, Mathematics University of Michigan, Ann Arbor, MI Ph.D., August 1983, Mathematics Sumner Myers Award for best thesis in mathematics Specialization: Harmonic Analysis Thesis: A Characterization of Measures Whose Fourier-Stieltjes Transforms Vanish at Infinity Thesis Advisers: Hugh L. Montgomery, Allen L. Shields Employment Indiana University, Bloomington, IN: James H. Rudy Professor of Mathematics, 2014{present. Indiana University, Bloomington, IN: Adjunct Professor of Statistics, 2006{present. Indiana University, Bloomington, IN: Professor of Mathematics, 1994{2014. Georgia Institute of Technology, Atlanta, GA: Professor of Mathematics, 2000{2003. Indiana University, Bloomington, IN: Associate Professor of Mathematics, 1990{94. Stanford University, Stanford, CA: Assistant Professor of Mathematics, 1985{90. Universit´ede Paris-Sud, Orsay, France: Assistant Associ´e,half-time, 1984{85. Sperry Research Center, Sudbury, MA: Researcher, summers 1976, 1979. Hampshire College Summer Studies in Mathematics, Amherst, MA: Teaching staff, summers 1977, 1978. Visiting Research Positions University of Calif., Berkeley: Visiting Miller Research Professor, Spring 2001. Microsoft Research: Visiting Researcher, Jan.{Mar. 2000, May{June 2004, July 2006, Jan.{June 2007, July 2008{June 2009, Sep.{Dec. 2010, Aug.{Oct. 2011, July{Oct. 2012, May{July 2013, Jun.{Oct. 2014, Jun.{Aug. 2015, Jun.{Aug. 2016, Jun.{Aug. 2017, Jun.{Aug. 2018. Weizmann Institute of Science, Rehovot, Israel: Rosi and Max Varon Visiting Professor, Fall 1997. Institute for Advanced Studies, Hebrew University of Jerusalem, Israel: Winston Fellow, 1996{97. Universit´ede Lyon, France: Visiting Professor, May 1996. University of Wisconsin, Madison, WI: Visiting Associate Professor, Winter 1994. -
Fixed Points, Koebe Uniformization and Circle Packings
Annals of Mathematics, 137 (1993), 369-406 Fixed points, Koebe uniformization and circle packings By ZHENG-XU HE and ODED SCHRAMM* Contents Introduction 1. The space of boundary components 2. The fixed-point index 3. The Uniqueness Theorem 4. The Schwarz-Pick lemma 5. Extension to the boundary 6. Maximum modulus, normality and angles 7. Uniformization 8. Domains in Riemann surfaces 9. Uniformizations of circle packings Addendum Introduction A domain in the Riemann sphere C is called a circle domain if every connected component of its boundary is either a circle or a point. In 1908, P. Koebe [Kol] posed the following conjecture, known as Koebe's Kreisnormierungsproblem: A ny plane domain is conformally homeomorphic to a circle domain in C. When the domain is simply connected, this is the con tent of the Riemann mapping theorem. The conjecture was proved for finitely connected domains and certain symmetric domains by Koebe himself ([K02], [K03]); for domains with various conditions on the "limit boundary compo nents" by R. Denneberg [De], H. Grotzsch [Gr], L. Sario [Sa], H. Meschowski *The authors were supported by N.S.F. Grants DMS-9006954 and DMS-9112150, respectively. The authors express their thanks to Mike Freedman, Dennis Hejhal, Al Marden, Curt McMullen, Burt Rodin, Steffen Rohde and Bill Thurston for conversations relating to this work. Also thanks are due to the referee, and to Steffen Rohde, for their careful reading and subsequent corrections. The paper of Sibner [Si3l served as a very useful introduction to the subject. I. Benjamini, O. Häggström (eds.), Selected Works of Oded Schramm, Selected Works in Probability and Statistics, DOI 10.1007/978-1-4419-9675-6_6, C Springer Science+Business Media, LLC 2011 105 370 z.-x. -
Arxiv:1707.00965V1 [Math-Ph] 4 Jul 2017 on the Brownian Loop Measure
On The Brownian Loop Measure Yong Han ∗ Yuefei Wang† Michel Zinsmeister‡ July 5, 2017 Abstract In 2003 Lawler and Werner introduced the Brownian loop measure and studied some of its properties. Cardy and Gamsa has predicted a formula for the total mass of the Brownian loop measure on the set of simple loops in the upper half plane and disconnect two given points from the boundary. In this paper we give a rigorous proof of the for- mula using a result by Beliaev and Viklund and heavy computations. Keywords: Brownian loop, SLE bubble, Brownian bubble, Disconnect from boundary 1 Introduction The conformally invariant scaling limits of a series of planar lattice mod- els can be described by the one-parameter family of random fractal curves SLE(κ), which was introduced by Schramm. These models include site per- arXiv:1707.00965v1 [math-ph] 4 Jul 2017 colation on the triangular graph, loop erased random walk, Ising model, harmonic random walk, discrete Gaussian free field, FK-Ising model and ∗Institute of Mathematics, Academy of Mathematics and Systems Sciences, Chi- nese Academy of Sciences and University of Chinese Academy of Sciences, Beijing 100190, China. MAPMO, Universit´ed’Orl´eans Orl´eans Cedex 2, France. Email: hany- [email protected] †Institute of Mathematics, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences and University of Chinese Academy of Sciences, Beijing 100190, China Email: [email protected] ‡MAPMO, Universit´ed’Orl´eans Orl´eans Cedex 2, France Email:[email protected] 1 uniform spanning tree. Using SLE as a tool, many problems related to the properties of these models have been solved, such as the arm exponents for these models. -
Applications at the International Congress by Marty Golubitsky
From SIAM News, Volume 39, Number 10, December 2006 Applications at the International Congress By Marty Golubitsky Grigori Perelman’s decision to decline the Fields Medal, coupled with the speculations surrounding this decision, propelled the 2006 Fields Medals to international prominence. Stories about the medals and the award ceremony at the International Congress of Mathematicians in Madrid this summer appeared in many influential news outlets (The New York Times, BBC, ABC, . .) and even in popular magazines (The New Yorker). In Madrid, the topologist John Morgan gave an excellent account of the history of the Poincaré conjecture and the ideas of Richard Hamilton and Perelman that led to the proof that the three-dimensional conjecture is correct. As Morgan pointed out, proofs of the Poincaré con- jecture and its direct generalizations have led to four Fields Medals: to Stephen Smale (1966), William Thurston (1982), Michael Freedman (1986), and now Grigori Perelman. The 2006 ICM was held in the Palacio Municipal de Congressos, a modern convention center on the outskirts of Madrid, which easily accommodated the 3600 or so participants. The interior of the convention center has a number of intriguing views—my favorite, shown below, is from the top of the three-floor-long descending escalator. Alfio Quarteroni’s plenary lecture on cardiovascular mathematics was among the many ses- The opening ceremony included a welcome sions of interest to applied mathematicians. from Juan Carlos, King of Spain, as well as the official announcement of the prize recipients—not only the four Fields Medals but also the Nevanlinna Prize and the (newly established) Gauss Prize. -
Curriculum Vitae Jeffrey E
Curriculum Vitae Jeffrey E. Steif Personal Data Address: Mathematical Sciences Chalmers University of Technology S-412 96 Gothenburg Sweden Phone: 46 0702298318 email: [email protected] Birth: February 7, 1960, Plainfield, New Jersey Sex: Male Nationality: United States Languages: English, Swedish Positions December, 1998-present: Professor (Swedish: Professor) Chalmers University of Technology 2001-2003: Professor Georgia Institute of Technology (Resigned from this position: effective December, 2003). 1999-2001: Associate Professor Georgia Institute of Technology 1995-1998: Professor (Swedish: Bitr¨adandeProfessor) Chalmers University of Technology 1995-2001: Senior Research Position/Fellowship in Probability (Swedish: forskartj¨ansti sannolikhetsteori) (supported by the Swedish Natural Science Research Council) 1994{1995: Associate Professor (Swedish: Docent) Chalmers University of Technology Jeffrey E. Steif 2 1991{1994: Tenured Assistant Professor (Swedish: h¨ogskolelektor) Chalmers University of Technology 1989-1991: Postdoctoral position, Cornell University 1988-1989: Postdoctoral position, Rutgers University Degrees Docent Mathematical Statistics, Chalmers University of Technology, 1994. Ph.D. Mathematics, Stanford University, 1988. Thesis Advisor: Donald Ornstein M.S. Mathematics, Stanford University, 1985. B.A. Mathematics, Rutgers University, 1982. Research Interests Probability Theory, Ergodic Theory, Statistical Mechanics Elected Memberships I am an elected member of "The Royal Swedish Academy of Sciences" since fall, 2013. I am an elected member of "The Royal Society of Arts and Sciences in Gothenburg" since January, 2020. Prizes G¨oranGustafsson Prize in mathematics (2004). (Since 1991, this prize has been given out every year to one person in each of math- ematics, physics, chemistry, molecular biology and medicine by the Royal Swedish Academy of Sciences to a Swedish university scientist; the prize is for 4.5 million Sek.) The Eva and Lars G˚ardingsprize in Mathematics (2011). -
Oded Schramm's Contributions to Noise Sensitivity
The Annals of Probability 2011, Vol. 39, No. 5, 1702–1767 DOI: 10.1214/10-AOP582 c Institute of Mathematical Statistics, 2011 ODED SCHRAMM’S CONTRIBUTIONS TO NOISE SENSITIVITY By Christophe Garban1 ENS Lyon, CNRS This paper is dedicated to the memory of Oded Schramm. I feel very fortunate to have known him. We survey in this paper the main contributions of Oded Schramm related to noise sensitivity. We will describe in particular his various works which focused on the “spectral analysis” of critical percolation (and more generally of Boolean functions), his work on the shape- fluctuations of first passage percolation and finally his contributions to the model of dynamical percolation. A sentence which summarizes well Oded’s work on noise sensitivity is the following quote from Jean Bourgain. There is a general philosophy which claims that if f defines a property of ‘high complexity,’ then Supfˆ, the support of the Fourier Transform, has to be ‘spread out.’ Through his work on models coming from statistical physics (in particular percolation), Oded Schramm was often confronted with such functions of “high complexity.” For example, in percolation, any large-scale connectivity property can be encoded by a Boolean function of the “inputs” (edges or sites). At criticality, these large-scale connectivity functions turn out to be of “high frequency” which gives deep information on the underlying model. As we will see along this survey, Oded Schramm developed over the last decade highly original and deep ideas to understand the “complexity” of Boolean functions. arXiv:1007.0422v3 [math.PR] 8 Feb 2012 We will essentially follow the chronology of his contributions in the field; it is quite striking that three distinct periods emerge from Oded’s work Received July 2010. -
ON the SCALING LIMITS of PLANAR PERCOLATION by Oded
Submitted to the Annals of Probability arXiv: math.PR/0000000 ON THE SCALING LIMITS OF PLANAR PERCOLATION By Oded Schramm∗,‡ and Stanislav Smirnov†,§ Microsoft Research‡ and Universit´ede Gen`eve§ We prove Tsirelson’s conjecture that the scaling limit of planar critical percolation is a black noise. Our theorems apply to a number of percolation models, including site percolation on the triangular grid and any subsequential scaling limit of bond percolation on the square grid. We also suggest a natural construction for the scaling limit of planar percolation, and more generally of any discrete planar model describing connectivity properties. Contents. 1 1 Introduction............................... 1 1.1 Motivation ............................ 1 1.2 Percolationbasicsandnotation . 6 1.3 Definitionofthescalinglimits. 13 1.4 Statementofmainresults . 15 2 TheDiscreteGluingTheorem. 22 3 Thespaceoflowersets.. ... ... ... ... ... .. ... ... 25 4 Uniformityinthemeshsize . 31 5 Factorization .............................. 39 A Continuityofcrossings. 40 References.................................. 47 Author’saddresses . ... .. ... ... ... ... ... .. ... ... 49 1. Introduction. 1.1. Motivation. This paper has a two-fold motivation: to propose a new construction for the scaling limits of the critical and near-critical percolation in the plane, and to show that such limits are two-dimensional black noises as suggested by Boris Tsirelson. Percolation is perhaps the simplest statistical physics model exhibiting a phase transition. We will be interested in planar percolation models, the ∗December 10, 1961 - September 1, 2008 †Supported by the European Research Council AG CONFRA and the Swiss National Science Foundation AMS 2000 subject classifications: Primary 60K35; secondary 28C20, 82B43 Keywords and phrases: percolation, noise, scaling limit 1 imsart-aop ver. 2009/12/15 file: Glue9.tex date: February 28, 2010 2 ODED SCHRAMM AND STANISLAV SMIRNOV archetypical examples being the site percolation on triangular lattice and bond percolation on the square lattice. -
Brooke Ullery Updated July 2, 2021
Brooke Ullery Updated July 2, 2021 Contact Department of Mathematics [email protected] Information Emory University http://math.emory.edu/~bullery Atlanta, GA 30322 Employment Emory University Assistant professor, August 2020{Present Harvard University Benjamin Peirce Postdoctoral Fellow and NSF Postdoctoral Fellow, July 2016{June 2020 Mentor: Joe Harris University of Utah NSF Postdoctoral Fellow, July 2015{June 2016 Mentor: Aaron Bertram Education University of Michigan - Ann Arbor Ph.D. in Mathematics, May 2015 Advisors: Robert Lazarsfeld, Karen Smith University of Chicago B.A. in Mathematics, June 2010 Papers • A Cayley-Bacharach theorem and plane configurations, with J. Levinson. Preprint. arXiv:2102.08525. • The gonality of complete intersection curves, with J. Hotchkiss and C. Lau. J. Algebra (2020), 579{608. • The degree of irrationality of hypersurfaces in various Fano varieties, with D. Sta- pleton. Manuscripta math. (2019), 1432{1785. • Measures of irrationality for hypersurfaces of large degree, with F. Bastianelli, P. De Poi, L. Ein, and R. Lazarsfeld. Compos. Math. 153 (2017), no. 11, 2368{2393. • On the normality of secant varieties. Adv. Math. 288 (2016), 631{647. • Designer ideals with high Castelnuovo-Mumford regularity. Math. Res. Lett. 21 (2014), no. 5, 1215{1225. Fellowships & • NSF Mathematical Sciences Postdoctoral Research Fellowship, 2015{2018 Honors • Harvard Excellence in Teaching Award, 2018, 2019. • Outstanding Graduate Student Instructor Award, University of Michigan (University- wide competition, 20 awardees), March 2015. • American Mathematical Society Graduate Student Travel Grant, September 2014. • Rackham Conference Travel Grant, University of Michigan, November 2013. • NSF RTG fellowship, University of Michigan, Winter 2013, Fall 2013, Winter 2014, Winter 2015. • Honors in mathematics, University of Chicago, June 2010.