DOCSLIB.ORG

Uploaded), and Also Take a Non-Trivial Amount of Time (And Energy) to Transfer from One Medium to Another

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Uploaded), and Also Take a Non-Trivial Amount of Time (And Energy) to Transfer from One Medium to Another i 1 ii What’s new - 2007: Open questions, expository articles, and lecture series from a mathematical blog Terence Tao May 8, 2008 1The author is supported by NSF grant CCF-0649473 and a grant from the MacArthur foun- dation. To my advisor, Eli Stein, for showing me the importance of good exposition; To my friends, for supporting this experiment; And to the readers of my blog, for their feedback and contributions. Contents 1 Open problems 1 1.1 Best bounds for capsets . 2 1.2 Noncommutative Freiman theorem . 4 1.3 Mahler’s conjecture for convex bodies . 7 1.4 Why global regularity for Navier-Stokes is hard . 10 1.5 Scarring for the Bunimovich stadium . 21 1.6 Triangle and diamond densities . 25 1.7 What is a quantum honeycomb? . 29 1.8 Boundedness of the trilinear Hilbert transform . 34 1.9 Effective Skolem-Mahler-Lech theorem . 39 1.10 The parity problem in sieve theory . 43 1.11 Deterministic RIP matrices . 55 1.12 The nonlinear Carleson conjecture . 59 2 Expository articles 63 2.1 Quantum mechanics and Tomb Raider . 64 2.2 Compressed sensing and single-pixel cameras . 71 2.3 Finite convergence principle . 77 2.4 Lebesgue differentiation theorem . 88 2.5 Ultrafilters and nonstandard analysis . 95 2.6 Dyadic models . 110 2.7 Math doesn’t suck . 121 2.8 Nonfirstorderisability . 130 2.9 Amplification and arbitrage . 133 2.10 The crossing number inequality . 142 2.11 Ratner’s theorems . 149 2.12 Lorentz group and conic sections . 155 2.13 Jordan normal form . 162 2.14 John’s blowup theorem . 166 2.15 Hilbert’s nullstellensatz . 172 2.16 Hahn-Banach, Menger, Helly . 180 2.17 Einstein’s derivation of E = mc2 . 186 v vi CONTENTS 3 Lectures 193 3.1 Simons Lecture Series: Structure and randomness . 194 3.2 Ostrowski lecture . 215 3.3 Milliman lectures . 222 Preface vii viii CONTENTS Almost nine years ago, in 1999, I began a “What’s new?” page on my UCLA home page in order to keep track of various new additions to that page (e.g. papers, slides, lecture notes, expository “short stories”, etc.). At first, these additions were simply listed without any commentary, but after a while I realised that this page was a good place to put a brief description and commentary on each of the mathematical articles that I was uploading to the page. (In short, I had begun blogging on my research, though I did not know this term at the time.) Every now and then, I received an email from someone who had just read the most recent entry on my “What’s new?” page and wanted to make some mathematical or bibliographic comment; this type of valuable feedback was one of the main reasons why I kept maintaining the page. But I did not think to try to encourage more of this feedback until late in 2006, when I posed a question on my “What’s new?” page and got a complete solution to that problem within a matter of days. It was then that I began thinking about modernising my web page to a blog format (which a few other math- ematicians had already begun doing). On 22 February 2007, I started a blog with the unimaginative name of “What’s new” at erryao.wordpress.com; I chose wordpress for a number of reasons, but perhaps the most decisive one was its recent decision to support LATEX in its blog posts. It soon became clear that the potential of this blog went beyond my original aim of merely continuing to announce my own papers and research. For instance, by far the most widely read and commented article in my blog in the first month was a non- technical article, “Quantum Mechanics and Tomb Raider” (Section 2.1), which had absolutely nothing to do with my own mathematical work. Encouraged by this, I began to experiment with other types of mathematical content on the blog; discussions of my favourite open problems, informal discussions of mathematical phenomena, principles, or tricks, guest posts by some of my colleagues, and presentations of various lectures and talks, both by myself and by others; and various bits and pieces of advice on pursuing a mathematical career and on mathematical writing. This year, I also have begun placing lecture notes for my graduate classes on my blog. After a year of mathematical blogging, I can say that the experience has been pos- itive, both for the readers of the blog and for myself. Firstly, the very act of writing a blog article helped me organise and clarify my thoughts on a given mathematical topic, to practice my mathematical writing and exposition skills, and also to inspect the references and other details more carefully. From insightful comments by experts in other fields of mathematics, I have learned of unexpected connections between different fields; in one or two cases, these even led to new research projects and collaborations. From the feedback from readers I obtained a substantial amount of free proofreading, while also discovering what parts of my exposition were unclear or otherwise poorly worded, helping me improve my writing style in the future. It is a truism that one of the best ways to learn a subject is to teach it; and it seems that blogging about a subject comes in as a close second. In the last year (2007) alone, at least a dozen new active blogs in research math- ematics have sprung up. I believe this is an exciting new development in mathemat- ical exposition; research blogs seem to fill an important niche that neither traditional print media (textbooks, research articles, surveys, etc.) nor informal communications (lectures, seminars, conversations at a blackboard, etc.) adequately cover at present. CONTENTS ix Indeed, the research blog medium is in some ways the “best of both worlds”; informal, dynamic, and interactive, as with talks and lectures, but also coming with a permanent record, a well defined author, and links to further references, as with the print media. There are bits and pieces of folklore in mathematics, such as the difference between hard and soft analysis (Section 2.3) or the use of dyadic models for non-dyadic situa- tions (Section 2.6) which are passed down from advisor to student, or from collaborator to collaborator, but are too fuzzy and non-rigorous to be discussed in the formal liter- ature; but they can be communicated effectively and efficiently via the semi-formal medium of research blogging. On the other hand, blog articles still lack the permanence that print articles have, which becomes an issue when one wants to use them in citations. For this and other reasons, I have decided to convert some of my blog articles from 2007 into the book that you are currently reading. Not all of the 93 articles that I wrote in 2007 appear here; some were mostly administrative or otherwise non-mathematical in nature, some were primarily announcements of research papers or other articles which will appear elsewhere, some were contributed guest articles, and some were writeups of lectures by other mathematicians, which it seemed inappropriate to reproduce in a book such as this. Nevertheless, this still left me with 32 articles, which I have converted into print form (replacing hyperlinks with more traditional citations and footnotes, etc.). As a result, this book is not a perfect replica of the blog, but the mathematical content is largely the same. I have paraphrased some of the feedback from comments to the blog in the endnotes to each article, though for various reasons, ranging from lack of space to copyright concerns, not all comments are reproduced here. The articles here are rather diverse in subject matter, to put it mildly, but I have nevertheless organised them into three categories. The first category concerns vari- ous open problems in mathematics that I am fond of; some are of course more difficult than others (see e.g. the article on Navier-Stokes regularity, Section 1.4), and others are rather vague and open-ended, but I find each of them interesting, not only in their own right, but because progress on them is likely to yield insights and techniques that will be useful elsewhere. The second category are the expository articles, which vary from discussions of various well-known results in maths and science (e.g. the nullstellensatz in Section 2.15, or Einstein’s equation E = mc2 in Section 2.17), to more philosophical explorations of mathematical ideas, tricks, tools, or principles (e.g. ultrafilters in Sec- tion 2.5, or amplification in Section 2.9), to non-technical expositions of various topics in maths and science, from quantum mechanics (Section 2.1) to single-pixel cameras (Section 2.2). Finally, I am including writeups of three lecture series I gave in 2007; my Simons lecture series at MIT on structure on randomness, my Ostrowski lecture at the University of Leiden on compressed sensing, and my Milliman lectures at the University of Washington on additive combinatorics. In closing, I believe that this experiment with mathematical blogging has been gen- erally successful, and I plan to continue it in the future, and perhaps generating several more books such as this one as a result. I am grateful to all the readers of my blog for supporting this experiment, for supplying invaluable feedback and corrections, and for encouraging projects such as this book conversion. x CONTENTS A remark on notation One advantage of the blog format is that one can often define a technical term simply by linking to an external web page that contains the definition (e.g.
Load more

Recommended publications
  • TRINITY COLLEGE Cambridge Trinity College Cambridge College Trinity Annual Record Annual
    2016 TRINITY COLLEGE cambridge trinity college cambridge annual record annual record 2016 Trinity College Cambridge Annual Record 2015–2016 Trinity College Cambridge CB2 1TQ Telephone: 01223 338400 e-mail: [email protected] website: www.trin.cam.ac.uk Contents 5 Editorial 11 Commemoration 12 Chapel Address 15 The Health of the College 18 The Master’s Response on Behalf of the College 25 Alumni Relations & Development 26 Alumni Relations and Associations 37 Dining Privileges 38 Annual Gatherings 39 Alumni Achievements CONTENTS 44 Donations to the College Library 47 College Activities 48 First & Third Trinity Boat Club 53 Field Clubs 71 Students’ Union and Societies 80 College Choir 83 Features 84 Hermes 86 Inside a Pirate’s Cookbook 93 “… Through a Glass Darkly…” 102 Robert Smith, John Harrison, and a College Clock 109 ‘We need to talk about Erskine’ 117 My time as advisor to the BBC’s War and Peace TRINITY ANNUAL RECORD 2016 | 3 123 Fellows, Staff, and Students 124 The Master and Fellows 139 Appointments and Distinctions 141 In Memoriam 155 A Ninetieth Birthday Speech 158 An Eightieth Birthday Speech 167 College Notes 181 The Register 182 In Memoriam 186 Addresses wanted CONTENTS TRINITY ANNUAL RECORD 2016 | 4 Editorial It is with some trepidation that I step into Boyd Hilton’s shoes and take on the editorship of this journal. He managed the transition to ‘glossy’ with flair and panache. As historian of the College and sometime holder of many of its working offices, he also brought a knowledge of its past and an understanding of its mysteries that I am unable to match.
    [Show full text]
  • Topics in Algorithmic, Enumerative and Geometric Combinatorics
    Thesis for the Degree of Doctor of Philosophy Topics in algorithmic, enumerative and geometric combinatorics Ragnar Freij Division of Mathematics Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg G¨oteborg, Sweden 2012 Topics in algorithmic, enumerative and geometric combinatorics Ragnar Freij ISBN 978-91-7385-668-3 c Ragnar Freij, 2012. Doktorsavhandlingar vid Chalmers Tekniska H¨ogskola Ny serie Nr 3349 ISSN 0346-718X Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg SE-412 96 GOTEBORG,¨ Sweden Phone: +46 (0)31-772 10 00 [email protected] Printed in G¨oteborg, Sweden, 2012 Topics in algorithmic, enumerative and geometric com- binatorics Ragnar Freij ABSTRACT This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman’s discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the S2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes. In the introduction, connections are drawn between the first paper and the evasiveness conjecture for monotone graph properties. In the second paper, we investigate Hansen polytopes of split graphs. By applying a partitioning technique, the number of nonempty faces is counted, and in particular we confirm Kalai’s 3d-conjecture for such polytopes. Further- more, a characterization of exactly which Hansen polytopes are also Hanner polytopes is given.
    [Show full text]
  • Optimal Area-Sensitive Bounds for Polytope Approximation
    Optimal Area-Sensitive Bounds for Polytope Approximation Sunil Arya∗ Guilherme D. da Fonseca† David M. Mount‡ Department of Computer Dept. de Informática Aplicada Department of Computer Science and Engineering Universidade Federal do Science and Institute for The Hong Kong University of Estado do Rio de Janeiro Advanced Computer Studies Science and Technology (UniRio) University of Maryland Clear Water Bay, Kowloon Rio de Janeiro, Brazil College Park, Maryland 20742 Hong Kong [email protected] [email protected] [email protected] ABSTRACT Mahler volume, it is possible to achieve the desired width- Approximating convex bodies is a fundamental question in based sampling. geometry and has applications to a wide variety of optimiza- tion problems. Given a convex body K in Rd for fixed d, Categories and Subject Descriptors the objective is to minimize the number of vertices or facets F.2.2 [Analysis of Algorithms and Problem Complex- of an approximating polytope for a given Hausdorff error ity]: Nonnumerical Algorithms and Problems—Geometrical ε. The best known uniform bound, due to Dudley (1974), problems and computations shows that O((diam(K)/ε)(d−1)/2) facets suffice. While this bound is optimal in the case of a Euclidean ball, it is far General Terms from optimal for skinny convex bodies. We show that, under the assumption that the width of the Algorithms, Theory body in any direction is at least ε, it is possible to approx- imate a convex body using O( area(K)/ε(d−1)/2) facets, Keywords where area(K) is the surface area of the body.
    [Show full text]
  • Abstract Adaptive Sampling for Geometric
    ABSTRACT Title of dissertation: ADAPTIVE SAMPLING FOR GEOMETRIC APPROXIMATION Ahmed Abdelkader Abdelrazek, Doctor of Philosophy, 2020 Dissertation directed by: Professor David M. Mount Computer Science Geometric approximation of multi-dimensional data sets is an essential algorith- mic component for applications in machine learning, computer graphics, and scientific computing. This dissertation promotes an algorithmic sampling methodology for a number of fundamental approximation problems in computational geometry. For each problem, the proposed sampling technique is carefully adapted to the geometry of the input data and the functions to be approximated. In particular, we study proximity queries in spaces of constant dimension and mesh generation in 3D. We start with polytope membership queries, where query points are tested for inclusion in a convex polytope. Trading-off accuracy for efficiency, we tolerate one-sided errors for points within an "-expansion of the polytope. We propose a sampling strategy for the placement of covering ellipsoids sensitive to the local shape of the polytope. The key insight is to realize the samples as Delone sets in the intrinsic Hilbert metric. Using this intrinsic formulation, we considerably simplify state-of-the-art techniques yielding an intuitive and optimal data structure. Next, we study nearest-neighbor queries which retrieve the most similar data point to a given query point. To accommodate more general measures of similarity, we consider non-Euclidean distances including convex distance functions and Bregman divergences. Again, we tolerate multiplicative errors retrieving any point no farther than (1 + ") times the distance to the nearest neighbor. We propose a sampling strategy sensitive to the local distribution of points and the gradient of the distance functions.
    [Show full text]
  • A View from the Bridge Natalie Paquette
    INFERENCE / Vol. 3, No. 4 A View from the Bridge Natalie Paquette tring theory is a quantum theory of gravity.1 Albert example, supersymmetric theories require particles to Einstein’s theory of general relativity emerges natu- come in pairs. For every bosonic particle there is a fermi- rally from its equations.2 The result is consistent in onic superpartner. Sthe sense that its calculations do not diverge to infinity. Supersymmetric field theory has a disheartening String theory may well be the only consistent quantum impediment. Suppose that a supersymmetric quantum theory of gravity. If true, this would be a considerable field theory is defined on a generic curved manifold. The virtue. Whether it is true or not, string theory is indis- Euclidean metric of Newtonian physics and the Lorentz putably the source of profound ideas in mathematics.3 metric of special relativity are replaced by the manifold’s This is distinctly odd. A line of influence has always run own metric. Supercharges correspond to conserved Killing from mathematics to physics. When Einstein struggled spinors. Solutions to the Killing spinor equations are plen- to express general relativity, he found the tools that he tiful in a flat space, but the equations become extremely needed had been created sixty years before by Bernhard restrictive on curved manifolds. They are so restrictive Riemann. The example is typical. Mathematicians discov- that they have, in general, no solutions. Promoting a flat ered group theory long before physicists began using it. In supersymmetric field theory to a generic curved mani- the case of string theory, it is often the other way around.
    [Show full text]
  • Approximate Polytope Membership Queries | SIAM Journal on Computing
    SIAM J. COMPUT. c 2018 Society for Industrial and Applied Mathematics Vol. 47, No. 1, pp. 1{51 ∗ APPROXIMATE POLYTOPE MEMBERSHIP QUERIES SUNIL ARYAy , GUILHERME D. DA FONSECAz , AND DAVID M. MOUNTx Abstract. In the polytope membership problem, a convex polytope K in d is given, and R d the objective is to preprocess K into a data structure so that, given any query point q 2 R , it is possible to determine efficiently whether q 2 K. We consider this problem in an approximate setting. Given an approximation parameter ", the query can be answered either way if the distance from q to K's boundary is at most " times K's diameter. We assume that the dimension d is fixed, and K is presented as the intersection of n halfspaces. Previous solutions to approximate polytope membership were based on straightforward applications of classic polytope approximation techniques by Dudley [Approx. Theory, 10 (1974), pp. 227{236] and Bentley, Faust, and Preparata [Commun. ACM, 25 (1982), pp. 64{68]. The former is optimal in the worst case with respect to space, and the latter is optimal with respect to query time. We present four main results. First, we show how to combine the two above techniques to obtain a simple space-time trade-off. Second, we present an algorithm that dramatically improves this trade-off. In particular, for any constant α ≥ 4, this data structure achieves query time roughly O(1="(d−1)/α) and space roughly O (1="(d−1)(1−Ω(log α)/α)). We do not know whether this space bound is tight, but our third result showsp that there is a convex body such (d−1)(1−O( α)/α that our algorithm achieves a space of at least Ω(1=" ).
    [Show full text]
  • Ten Problems in Geometry
    Ten Problems in Geometry Moritz W. Schmitt G¨unter M. Ziegler∗ Institut f¨urMathematik Institut f¨urMathematik Freie Universit¨atBerlin Freie Universit¨atBerlin Arnimallee 2 Arnimallee 2 14195 Berlin, Germany 14195 Berlin, Germany [email protected] [email protected] May 1, 2011 Abstract We describe ten problems that wait to be solved. Introduction Geometry is a field of knowledge, but it is at the same time an active field of research | our understanding of space, about shapes, about geometric structures develops in a lively dialog, where problems arise, new questions are asked every day. Some of the problems are settled nearly immediately, some of them need years of careful study by many authors, still others remain as challenges for decades. Contents 1 Unfolding polytopes 2 2 Almost disjoint triangles 4 3 Representing polytopes with small coordinates 6 4 Polyhedra that tile space 8 5 Fatness 10 6 The Hirsch conjecture 12 7 Unimodality for cyclic polytopes 14 8 Decompositions of the cube 16 9 A problem concerning the ball and the cube 19 10 The 3d conjecture 21 ∗Partially supported by DFG, Research Training Group \Methods for Discrete Structures" 1 1 Unfolding polytopes In 1525 Albrecht D¨urer'sfamous geometry masterpiece \Underweysung der Messung mit dem Zirckel und Richtscheyt"1 was published in Nuremberg. Its fourth part contains many drawings of nets of 3-dimensional polytopes. Implicitly it contains the following conjecture: Every 3-dimensional convex polytope can be cut open along a spanning tree of its graph and then unfolded into the plane without creating overlaps.
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger 2 FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th{19th, 2017 Books of abstracts 4 FoCM 2017 Contents Presentation . .7 Governance of FoCM . .9 Local Organizing Committee . .9 Administrative and logistic support . .9 Technical support . 10 Volunteers . 10 Workshops Committee . 10 Plenary Speakers Committee . 10 Smale Prize Committee . 11 Funding Committee . 11 Plenary talks . 13 Workshops . 21 A1 { Approximation Theory Organizers: Albert Cohen { Ron Devore { Peter Binev . 21 A2 { Computational Algebraic Geometry Organizers: Marta Casanellas { Agnes Szanto { Thorsten Theobald . 36 A3 { Computational Number Theory Organizers: Christophe Ritzenhaler { Enric Nart { Tanja Lange . 50 A4 { Computational Geometry and Topology Organizers: Joel Hass { Herbert Edelsbrunner { Gunnar Carlsson . 56 A5 { Geometric Integration and Computational Mechanics Organizers: Fernando Casas { Elena Celledoni { David Martin de Diego .
    [Show full text]
  • Arxiv:Math/0610904V3 [Math.MG] 2 Jul 2008
    From the Mahler conjecture to Gauss linking integrals Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CA 95616 Dedicated to my father, on no particular occasion We establish a version of the bottleneck conjecture, which in turn implies a partial solution to the Mahler conjecture on the product v(K) = (Vol K)(Vol K ) of the volume of a symmetric convex body K Rn and its ◦ ∈ polar body K◦. The Mahler conjecture asserts that the Mahler volume v(K) is minimized (non-uniquely) when K is an n-cube. The bottleneck conjecture (in its least general form) asserts that the volume of a certain domain π nγ K♦ K K◦ is minimized when K is an ellipsoid. It implies the Mahler conjecture up to a factor of 4 n, ⊆ × 4 where γn is a monotonic factor that begins at π and converges to √2. This strengthens a result of Bourgain and Milman, who showed that there is a constant c such that the Mahler conjecture is true up to a factor of cn. The proof uses a version of the Gauss linking integral to obtain a constant lower bound on Vol K♦, with equality when K is an ellipsoid. It applies to a more general conjecture concerning the join of any two necks of the pseudospheres of an indefinite inner product space. Because the calculations are similar, we will also n 1 n 1 analyze traditional Gauss linking integrals in the sphere S − and in hyperbolic space H − . 1. INTRODUCTION Theorem 1.3 (Bourgain, Milman). There is a constant c > 0 such that for any n and any centrally-symmetric convex body n K of dimension n, If K R is a centrally symmetric convex body, let K◦ de- note its⊂ dual or polar body.
    [Show full text]
  • John H. Conway
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 58, Number 3, July 2021, Pages 311–312 https://doi.org/10.1090/bull/1702 Article electronically published on April 19, 2021 IN MEMORIAM: JOHN H. CONWAY MICHEL BROUE´ “Conway was arguably an extreme point in the convex hull of all mathematicians” wrote Terry Tao after John H. Conway died from COVID-19 on April 11, 2020. Emeritus professor at Princeton University, which he joined in 1986 after spending almost 20 years at Cambridge University (U.K.), Conway was 82 years old. “An extreme point. ”. Indeed, Conway has contributed to so many aspects of mathematics, including finite group theory, number theory, game theory, tiling, logic, knot theory, combinatorics, algorithmics. He also invented a profusion of games, such as “Phutball”. He said he was proud of “Surreal Numbers” (an enor- mous new world of numbers) and “Free Will Theorem” (a sort of mathematical formulation of the philosophical notion of free will, inspired by quantum mechan- ics). It seems he is most widely known (which he sometimes regretted) as the inventor of the “Game of Life”, the theory of cellular automata—indeed of deter- ministic behavior, quite unlike “Free Will Theorem”: “I have not become a world expert on one topic, I don’t do that. I am just interested in a lot of things,” said he. In 1970, I started my PhD under Claude Chevalley, who suggested that I should consult Jean-Pierre Serre for a good problem. Serre told me that a good start might consist in reading an interesting new paper and trying to understand it with my own ways; he said, “You might read the paper of Conway about the automorphisms group of the Leech lattice”.
    [Show full text]
  • The Mathematical Work of the 1998 Fields Medalists James Lepowsky, Joram Lindenstrauss, Yuri I
    fields.qxp 11/13/98 11:22 AM Page 17 The Mathematical Work of the 1998 Fields Medalists James Lepowsky, Joram Lindenstrauss, Yuri I. Manin, and John Milnor vide the order of the “Monster” sporadic finite The Work of simple group M, a group of order about 1054 “dis- covered” by B. Fischer and R. Griess but not yet proved to exist at the time. Ogg offered a bottle of Richard E. Borcherds Jack Daniels whiskey for an explanation. James Lepowsky In 1978–79, J. McKay, J. Thompson, J. H. Con- way, and S. Norton explosively enriched this nu- Much of Richard Borcherds’s brilliant work is merology [CN] and in particular conjectured the ex- related to the remarkable subject of Monstrous istence of a natural infinite-dimensional Z-graded Moonshine. This started quietly in the 1970s when \ \ representation (let us call it V = n 1 Vn ) of A. Ogg noticed a curious coincidence spanning ≥− the conjectured group M that wouldL have the two apparently unrelated areas of mathematics— following property: For each of the 194 conjugacy the theory of modular functions and the theory of classes in M, choose a representative g M, ∈ finite simple groups. and consider the “graded trace” Jg(q)= There are fifteen prime numbers p for which the n 2i n 1(tr g V \ )q , where q = e , in the upper normalizer of the congruence subgroup (p) in ≥− | n 0 half-plane.P Then the McKay-Thompson series Jg SL(2, R) has the “genus-zero property”; that is, the should be a (specified) Hauptmodul for a suitable Γ compactification of the upper half-plane modulo discrete subgroup of SL(2, R) with the genus-zero this normalizer is a Riemann surface of genus property, and, in particular, J1 (corresponding to zero, so that the field of modular functions in- 1 M ) should be the modular function ∈ variant under this discrete group is generated by J(q)=q 1 + 196884q + .
    [Show full text]
  • Isotropic Constants and Mahler Volumes
    Isotropic constants and Mahler volumes Bo’az Klartag Abstract This paper contains a number of results related to volumes of projective perturba- tions of convex bodies and the Laplace transform on convex cones. First, it is shown that a sharp version of Bourgain’s slicing conjecture implies the Mahler conjecture for convex bodies that are not necessarily centrally-symmetric. Second, we find that by slightly translating the polar of a centered convex body, we may obtain another body with a bounded isotropic constant. Third, we provide a counter-example to a conjecture by Kuperberg on the distribution of volume in a body and in its polar. 1 Introduction This paper describes interrelations between duality and distribution of volume in convex bodies. A convex body is a compact, convex subset K Rn whose interior Int(K) is non-empty. If 0 Int(K), then the polar body is defined by⊆ ∈ K◦ = y Rn ; x K, x, y 1 . { ∈ ∀ ∈ h i ≤ } The polar body K◦ is itself a convex body with the origin in its interior, and moreover (K◦)◦ = K. The Mahler volume of a convex body K Rn with the origin in its interior is defined as ⊆ ◦ s(K)= V oln(K) V oln(K ), arXiv:1710.08084v2 [math.MG] 1 Mar 2018 · where V oln is n-dimensional volume. In the class of convex bodies with barycenter at the origin, the Mahler volume is maximized for ellipsoids, as proven by Santal´o[29], see also Meyer and Pajor [20]. The Mahler conjecture suggests that for any convex body K Rn containing the origin in its interior, ⊆ (n + 1)n+1 s(K) s(∆n)= , (1) ≥ (n!)2 where ∆n Rn is any simplex whose vertices span Rn and add up to zero.
    [Show full text]