DOCSLIB.ORG

Clay Mathematics Institute 2005 James A

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Clay Mathematics Institute 2005 James A Contents Clay Mathematics Institute 2005 James A. Carlson Letter from the President 2 The Prize Problems The Millennium Prize Problems 3 Recognizing Achievement 2005 Clay Research Awards 4 CMI Researchers Summary of 2005 6 Workshops & Conferences CMI Programs & Research Activities Student Programs Collected Works James Arthur Archive 9 Raoul Bott Library CMI Profile Interview with Research Fellow 10 Maria Chudnovsky Feature Article Can Biology Lead to New Theorems? 13 by Bernd Sturmfels CMI Summer Schools Summary 14 Ricci Flow, 3–Manifolds, and Geometry 15 at MSRI Program Overview CMI Senior Scholars Program 17 Institute News Euclid and His Heritage Meeting 18 Appointments & Honors 20 CMI Publications Selected Articles by Research Fellows 27 Books & Videos 28 About CMI Profile of Bow Street Staff 30 CMI Activities 2006 Institute Calendar 32 2005 Euclid: www.claymath.org/euclid James Arthur Collected Works: www.claymath.org/cw/arthur Hanoi Institute of Mathematics: www.math.ac.vn Ramanujan Society: www.ramanujanmathsociety.org $.* $MBZ.BUIFNBUJDT*OTUJUVUF ".4 "NFSJDBO.BUIFNBUJDBM4PDJFUZ In addition to major,0O"VHVTU BUUIFTFDPOE*OUFSOBUJPOBM$POHSFTTPG.BUIFNBUJDJBOT ongoing activities such as JO1BSJT %BWJE)JMCFSUEFMJWFSFEIJTGBNPVTMFDUVSFJOXIJDIIFEFTDSJCFE the summer schools,UXFOUZUISFFQSPCMFNTUIBUXFSFUPQMBZBOJOnVFOUJBMSPMFJONBUIFNBUJDBM the Institute undertakes a 5IF.JMMFOOJVN1SJ[F1SPCMFNT SFTFBSDI"DFOUVSZMBUFS PO.BZ BUBNFFUJOHBUUIF$PMMÒHFEF number of smaller'SBODF UIF$MBZ.BUIFNBUJDT*OTUJUVUF $.* BOOPVODFEUIFDSFBUJPOPGB special projects each year. Four 64NJMMJPOQSJ[FGVOEGPSUIFTPMVUJPOPGTFWFOJNQPSUBOUDMBTTJDQSPCMFNT examples demonstrateXIJDIIBWFSFTJTUFETPMVUJPO5IFQSJ[FGVOEJTEJWJEFEFRVBMMZBNPOHUIF the breadth of the Institute’s work. First is the TFWFOQSPCMFNT5IFSFJTOPUJNFMJNJUGPSUIFJSTPMVUJPOdigitization of the oldest surviving 5IF.JMMFOOJVN1SJ[F1SPCMFNTXFSFTFMFDUFECZUIFGPVOEJOH4DJFOUJmD manuscript of Euclid’s"EWJTPSZ#PBSEPG$.*"MBJO$POOFT "SUIVS+BGGF "OESFX8JMFT BOE Elements, dated to 888 AD, &EXBSE8JUUFOBGUFSDPOTVMUJOHXJUIPUIFSMFBEJOHNBUIFNBUJDJBOT 5IF.JMMFOOJVN when it was5IFJSBJNXBTTPNFXIBUEJGGFSFOUUIBOUIBUPG)JMCFSUOPUUPEFmOFOFX copied from a predecessor in Constantinople. DIBMMFOHFT CVUUPSFDPSETPNFPGUIFNPTUEJGmDVMUJTTVFTXJUIXIJDIFor the first time, a facsimile of NBUIFNBUJDJBOTXFSFTUSVHHMJOHBUUIFUVSOPGUIFTFDPOENJMMFOOJVNUP 1SJ[F1SPCMFNT the founding documentSFDPHOJ[FBDIJFWFNFOUJONBUIFNBUJDTPGIJTUPSJDBMEJNFOTJPOUPFMFWBUF of mathematics is widely JOUIFDPOTDJPVTOFTTPGUIFHFOFSBMQVCMJDUIFGBDUUIBUJONBUIFNBUJDT UIF available. SecondGSPOUJFSJTTUJMMPQFOBOEBCPVOETJOJNQPSUBOUVOTPMWFEQSPCMFNTBOEUP is the James Arthur Archive on +$BSMTPO "+BGGF BOE"8JMFT &EJUPST the CMI website.FNQIBTJ[FUIFJNQPSUBODFPGXPSLJOHUPXBSETBTPMVUJPOPGUIFEFFQFTU This is an online library of the Letter from the president NPTUEJGmDVMUQSPCMFNT collected works 5IFQSFTFOUWPMVNFTFUTGPSUIUIFPGmDJBMEFTDSJQUJPOPGFBDIPGUIFTFWFOof Toronto mathematician James QSPCMFNTBOEUIFSVMFTHPWFSOJOHUIFQSJ[FT*UBMTPDPOUBJOTBOFTTBZCZ Arthur, noted for +FSFNZ(SBZPOUIFIJTUPSZPGQSJ[FQSPCMFNTJONBUIFNBUJDThis achievements in automorphic forms and representation theory. James Arthur will +$BSMTPO "+BGGF BOE"8JMFT &EJUPST be adding further material to the archive, including his own comments. The Clay Mathematics Institute ")JTUPSZPG1SJ[FTJO.BUIFNBUJDT +FSFNZ(SBZ hopes that there will be further efforts of this kind, #JSDIBOE4XJOOFSUPO%ZFS$POKFDUVSF "OESFX8JMFT )PEHF$POKFDUVSF 1JFSSF%FMJHOF both at CMI and elsewhere. The third example is the /BWJFSo4UPLFT&RVBUJPO $IBSMFT-'FGGFSNBO Institute’s support of George Csicsery’s documentary 1PJODBSÏ$POKFDUVSF +PIO.JMOPS 1WFSTVT/11SPCMFN 4UFQIFO$PPL film on the life and work of JuliaXXXDMBZNBUIPSH Robinson, noted 3JFNBOO)ZQPUIFTJT &OSJDP#PNCJFSJ for her key role in the solution XXXBNTPSHof Hilbert’s tenth 2VBOUVN:BOHo.JMMT5IFPSZ "SUIVS+BGGFBOE&EXBSE8JUUFO James Carlson problem. Robinson’s inspiring story will be of interest to both mathematicians and the general public. Finally, the Institute.13*;& is supporting two small Dear Friends of Mathematics ventures in Vietnam and India. The first, part ofBao- Châu Ngô’s research award in 2004, is a donation of This past year marked the sixth anniversary of books to the Mathematical Institute in Hanoi. The the Clay Mathematics Institute’s program of second, part of Manjul Bhargava’s research award summer schools. The first, held at Pine Manor in 2005, is two years of support for the Ramanujan College, was dedicated to mirror symmetry. The Mathematical Society (RMS) in Mumbai. The RMS last, held at MSRI in Berkeley, was on Ricci flow, will offer one or two Clay–Bhargava fellowships of 3-manifolds, and geometry. It was of special interest 50,000 Rupees to promising graduate students. because of Perelman’s proposed solution to the Poincaré conjecture and to Thurston’s geometrization The programs and projects mentioned above conjecture. It was also the culmination of Hamilton’s illustrate a guiding principle of the Clay Mathematics Ricci flow program and the deep work of many Institute: support a broad spectrum of initiatives in mathematicians who have dedicated their life’s work mathematics, large and small, in order to foster the to geometry and analysis. The aim of the summer creation of new knowledge. schools is to provide participants – graduate students and recent PhD’s within five years of their degree – with the background needed to work successfully Sincerely, in an active and important area of mathematics. The next two schools, one on arithmetic geometry, the other on homogenous flows, dynamics, and number theory, will be held in Göttingen and Pisa, respectively. James A. Carlson CMI ANNUAL REPORT The expected publication date is July 23, 2006. Copies of the book will be available at the ICM in Madrid, August 22–30, 2006, and also The prize problems sold at www.ams.org/bookstore The Millennium Prize Problems $.* $MBZ.BUIFNBUJDT*OTUJUVUF ".4 "NFSJDBO.BUIFNBUJDBM4PDJFUZ 0O"VHVTU BUUIFTFDPOE*OUFSOBUJPOBM$POHSFTTPG.BUIFNBUJDJBOT mathematics of historical dimension; to elevate in JO1BSJT %BWJE)JMCFSUEFMJWFSFEIJTGBNPVTMFDUVSFJOXIJDIIFEFTDSJCFE UXFOUZUISFFQSPCMFNTUIBUXFSFUPQMBZBOJOnVFOUJBMSPMFJONBUIFNBUJDBM 5IF.JMMFOOJVN1SJ[F1SPCMFNT the consciousness of the general public the fact that SFTFBSDI"DFOUVSZMBUFS PO.BZ BUBNFFUJOHBUUIF$PMMÒHFEF 'SBODF UIF$MBZ.BUIFNBUJDT*OTUJUVUF $.* BOOPVODFEUIFDSFBUJPOPGB in mathematics the frontier is still open and abounds 64NJMMJPOQSJ[FGVOEGPSUIFTPMVUJPOPGTFWFOJNQPSUBOUDMBTTJDQSPCMFNT XIJDIIBWFSFTJTUFETPMVUJPO5IFQSJ[FGVOEJTEJWJEFEFRVBMMZBNPOHUIF in important unsolved problems; and to emphasize TFWFOQSPCMFNT5IFSFJTOPUJNFMJNJUGPSUIFJSTPMVUJPO the importance of working toward a solution of the 5IF.JMMFOOJVN1SJ[F1SPCMFNTXFSFTFMFDUFECZUIFGPVOEJOH4DJFOUJmD deepest, most difficult problems. "EWJTPSZ#PBSEPG$.*"MBJO$POOFT "SUIVS+BGGF "OESFX8JMFT BOE 5IF.JMMFOOJVN &EXBSE8JUUFOBGUFSDPOTVMUJOHXJUIPUIFSMFBEJOHNBUIFNBUJDJBOT 5IFJSBJNXBTTPNFXIBUEJGGFSFOUUIBOUIBUPG)JMCFSUOPUUPEFmOFOFX DIBMMFOHFT CVUUPSFDPSETPNFPGUIFNPTUEJGmDVMUJTTVFTXJUIXIJDI The Millennium Prize Problems gives the official NBUIFNBUJDJBOTXFSFTUSVHHMJOHBUUIFUVSOPGUIFTFDPOENJMMFOOJVNUP 1SJ[F1SPCMFNT SFDPHOJ[FBDIJFWFNFOUJONBUIFNBUJDTPGIJTUPSJDBMEJNFOTJPOUPFMFWBUF description of each of the seven problems and the JOUIFDPOTDJPVTOFTTPGUIFHFOFSBMQVCMJDUIFGBDUUIBUJONBUIFNBUJDT UIF +$BSMTPO "+BGGF BOE"8JMFT &EJUPST GSPOUJFSJTTUJMMPQFOBOEBCPVOETJOJNQPSUBOUVOTPMWFEQSPCMFNTBOEUP rules governing the prizes. It also contains an essay FNQIBTJ[FUIFJNQPSUBODFPGXPSLJOHUPXBSETBTPMVUJPOPGUIFEFFQFTU NPTUEJGmDVMUQSPCMFNT by Jeremy Gray on the history of prize problems in 5IFQSFTFOUWPMVNFTFUTGPSUIUIFPGmDJBMEFTDSJQUJPOPGFBDIPGUIFTFWFO mathematics. QSPCMFNTBOEUIFSVMFTHPWFSOJOHUIFQSJ[FT*UBMTPDPOUBJOTBOFTTBZCZ +FSFNZ(SBZPOUIFIJTUPSZPGQSJ[FQSPCMFNTJONBUIFNBUJDT +$BSMTPO "+BGGF BOE"8JMFT &EJUPST The seven Millennium Prize Problems range from the oldest, the Riemann Hypothesis, a problem in number ")JTUPSZPG1SJ[FTJO.BUIFNBUJDT +FSFNZ(SBZ theory stated in 1859, to the youngest, the P versus NP #JSDIBOE4XJOOFSUPO%ZFS$POKFDUVSF "OESFX8JMFT problem, a problem in theoretical computer science stated )PEHF$POKFDUVSF 1JFSSF%FMJHOF in 1971. Informal descriptions are given below. See the /BWJFSo4UPLFT&RVBUJPO $IBSMFT-'FGGFSNBO individual articles in the book for official statements 1PJODBSÏ$POKFDUVSF +PIO.JMOPS and background material. See also www.claymath.org/ 1WFSTVT/11SPCMFN 4UFQIFO$PPL XXXDMBZNBUIPSH millennium 3JFNBOO)ZQPUIFTJT &OSJDP#PNCJFSJ XXXBNTPSH 2VBOUVN:BOHo.JMMT5IFPSZ "SUIVS+BGGFBOE&EXBSE8JUUFO The Birch and Swinnerton-Dyer Conjecture: Let C be an elliptic curve over the rational numbers. The order to which its L function vanishes at s = 1 is the rank of the .13*;& group of rational points. The Hodge Conjecture: A rational cohomology class of type (p, p) on a projective algebraic manifold is represented by a rational sum of algebraic subvarieties. On August 8, 1900, at the second International The Navier–Stokes Equation. Show that the Navier– Congress of Mathematicians in Paris, David Hilbert Stokes equations on Euclidean 3-space have a unique, delivered the famous lecture in which he described smooth, finite energy solution for all time greater than twenty-three problems that were to play an or equal to zero, given smooth, divergence-free, initial influential role in future mathematical research. A conditions which “decay rapidly at large distances.” century later, on May 24, 2000, at a meeting at the Alternatively, show that there is no such
Load more

Recommended publications
  • Forbidden Subgraph Characterization of Quasi-Line Graphs Medha Dhurandhar [email protected]
    Forbidden Subgraph Characterization of Quasi-line Graphs Medha Dhurandhar [email protected] Abstract: Here in particular, we give a characterization of Quasi-line Graphs in terms of forbidden induced subgraphs. In general, we prove a necessary and sufficient condition for a graph to be a union of two cliques. 1. Introduction: A graph is a quasi-line graph if for every vertex v, the set of neighbours of v is expressible as the union of two cliques. Such graphs are more general than line graphs, but less general than claw-free graphs. In [2] Chudnovsky and Seymour gave a constructive characterization of quasi-line graphs. An alternative characterization of quasi-line graphs is given in [3] stating that a graph has a fuzzy reconstruction iff it is a quasi-line graph and also in [4] using the concept of sums of Hoffman graphs. Here we characterize quasi-line graphs in terms of the forbidden induced subgraphs like line graphs. We consider in this paper only finite, simple, connected, undirected graphs. The vertex set of G is denoted by V(G), the edge set by E(G), the maximum degree of vertices in G by Δ(G), the maximum clique size by (G) and the chromatic number by G). N(u) denotes the neighbourhood of u and N(u) = N(u) + u. For further notation please refer to Harary [3]. 2. Main Result: Before proving the main result we prove some lemmas, which will be used later. Lemma 1: If G is {3K1, C5}-free, then either 1) G ~ K|V(G)| or 2) If v, w V(G) are s.t.
    [Show full text]
  • COMP 761: Lecture 9 – Graph Theory I
    COMP 761: Lecture 9 – Graph Theory I David Rolnick September 23, 2020 David Rolnick COMP 761: Graph Theory I Sep 23, 2020 1 / 27 Problem In Königsberg (now called Kaliningrad) there are some bridges (shown below). Is it possible to cross over all of them in some order, without crossing any bridge more than once? (Please don’t post your ideas in the chat just yet, we’ll discuss the problem soon in class.) David Rolnick COMP 761: Graph Theory I Sep 23, 2020 2 / 27 Problem Set 2 will be due on Oct. 9 Vincent’s optional list of practice problems available soon on Slack (we can give feedback on your solutions, but they will not count towards a grade) Course Announcements David Rolnick COMP 761: Graph Theory I Sep 23, 2020 3 / 27 Vincent’s optional list of practice problems available soon on Slack (we can give feedback on your solutions, but they will not count towards a grade) Course Announcements Problem Set 2 will be due on Oct. 9 David Rolnick COMP 761: Graph Theory I Sep 23, 2020 3 / 27 Course Announcements Problem Set 2 will be due on Oct. 9 Vincent’s optional list of practice problems available soon on Slack (we can give feedback on your solutions, but they will not count towards a grade) David Rolnick COMP 761: Graph Theory I Sep 23, 2020 3 / 27 A graph G is defined by a set V of vertices and a set E of edges, where the edges are (unordered) pairs of vertices fv; wg.
    [Show full text]
  • I. Overview of Activities, April, 2005-March, 2006 …
    MATHEMATICAL SCIENCES RESEARCH INSTITUTE ANNUAL REPORT FOR 2005-2006 I. Overview of Activities, April, 2005-March, 2006 …......……………………. 2 Innovations ………………………………………………………..... 2 Scientific Highlights …..…………………………………………… 4 MSRI Experiences ….……………………………………………… 6 II. Programs …………………………………………………………………….. 13 III. Workshops ……………………………………………………………………. 17 IV. Postdoctoral Fellows …………………………………………………………. 19 Papers by Postdoctoral Fellows …………………………………… 21 V. Mathematics Education and Awareness …...………………………………. 23 VI. Industrial Participation ...…………………………………………………… 26 VII. Future Programs …………………………………………………………….. 28 VIII. Collaborations ………………………………………………………………… 30 IX. Papers Reported by Members ………………………………………………. 35 X. Appendix - Final Reports ……………………………………………………. 45 Programs Workshops Summer Graduate Workshops MSRI Network Conferences MATHEMATICAL SCIENCES RESEARCH INSTITUTE ANNUAL REPORT FOR 2005-2006 I. Overview of Activities, April, 2005-March, 2006 This annual report covers MSRI projects and activities that have been concluded since the submission of the last report in May, 2005. This includes the Spring, 2005 semester programs, the 2005 summer graduate workshops, the Fall, 2005 programs and the January and February workshops of Spring, 2006. This report does not contain fiscal or demographic data. Those data will be submitted in the Fall, 2006 final report covering the completed fiscal 2006 year, based on audited financial reports. This report begins with a discussion of MSRI innovations undertaken this year, followed by highlights
    [Show full text]
  • Some Remarks on Even-Hole-Free Graphs
    Some remarks on even-hole-free graphs Zi-Xia Song∗ Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA Abstract A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky and Seymour asserts that every non-empty even-hole-free graph has a bisimplicial vertex. Both Hadwiger’s conjecture and the Erd˝os-Lov´asz Tihany conjecture have been shown to be true for quasi-line graphs, but are open for even-hole-free graphs. In this note, we prove that for all k ≥ 7, every even-hole-free graph with no Kk minor is (2k − 5)-colorable; every even-hole-free graph G with ω(G) < χ(G) = s + t − 1 satisfies the Erd˝os-Lov´asz Tihany conjecture provided that t ≥ s>χ(G)/3. Furthermore, we prove that every 9-chromatic graph G with ω(G) ≤ 8 has a K4 ∪ K6 minor. Our proofs rely heavily on the structural result of Chudnovsky and Seymour on even-hole-free graphs. 1 Introduction All graphs in this paper are finite and simple. For a graph G, we use V (G) to denote the vertex set, E(G) the edge set, |G| the number of vertices, e(G) the number of edges, δ(G) the minimum degree, ∆(G) the maximum degree, α(G) the independence number, ω(G) the clique number and χ(G) the chromatic number. A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges.
    [Show full text]
  • The Structure of Claw-Free Graphs
    The structure of claw-free graphs Maria Chudnovsky and Paul Seymour Abstract A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. At first sight, there seem to be a great variety of types of claw-free graphs. For instance, there are line graphs, the graph of the icosahedron, complements of triangle-free graphs, and the Schl¨afli graph (an amazingly highly-symmetric graph with 27 vertices), and more; for instance, if we arrange vertices in a circle, choose some intervals from the circle, and make the vertices in each interval adjacent to each other, the graph we produce is claw-free. There are several other such examples, which we regard as \basic" claw-free graphs. Nevertheless, it is possible to prove a complete structure theorem for claw- free graphs. We have shown that every connected claw-free graph can be ob- tained from one of the basic claw-free graphs by simple expansion operations. In this paper we explain the precise statement of the theorem, sketch the proof, and give a few applications. 1 Introduction A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. (Graphs in this paper are finite and simple.) Line graphs are claw-free, and it has long been recognized that claw-free graphs are an interesting generalization of line graphs, sharing some of the same properties. For instance, Minty [16] showed in 1980 that there is a polynomial-time algorithm to find a stable set of maximum weight in a claw-free graph, generalizing the algorithm of Edmonds [9, 10] to find a maximum weight matching in a graph.
    [Show full text]
  • David Donoho COMMENTARY 52 Cliff Ord J
    ISSN 0002-9920 (print) ISSN 1088-9477 (online) of the American Mathematical Society January 2018 Volume 65, Number 1 JMM 2018 Lecture Sampler page 6 Taking Mathematics to Heart y e n r a page 19 h C th T Ru a Columbus Meeting l i t h i page 90 a W il lia m s r e lk a W ca G Eri u n n a r C a rl ss on l l a d n a R na Da J i ll C . P ip her s e v e N ré F And e d e r i c o A rd ila s n e k c i M . E d al Ron Notices of the American Mathematical Society January 2018 FEATURED 6684 19 26 29 JMM 2018 Lecture Taking Mathematics to Graduate Student Section Sampler Heart Interview with Sharon Arroyo Conducted by Melinda Lanius Talithia Williams, Gunnar Carlsson, Alfi o Quarteroni Jill C. Pipher, Federico Ardila, Ruth WHAT IS...an Acylindrical Group Action? Charney, Erica Walker, Dana Randall, by omas Koberda André Neves, and Ronald E. Mickens AMS Graduate Student Blog All of us, wherever we are, can celebrate together here in this issue of Notices the San Diego Joint Mathematics Meetings. Our lecture sampler includes for the first time the AMS-MAA-SIAM Hrabowski-Gates-Tapia-McBay Lecture, this year by Talithia Williams on the new PBS series NOVA Wonders. After the sampler, other articles describe modeling the heart, Dürer's unfolding problem (which remains open), gerrymandering after the fall Supreme Court decision, a story for Congress about how geometry has advanced MRI, “My Father André Weil” (2018 is the 20th anniversary of his death), and a profile on Donald Knuth and native script by former Notices Senior Writer and Deputy Editor Allyn Jackson.
    [Show full text]
  • Tree-Decomposition Graph Minor Theory and Algorithmic Implications
    DIPLOMARBEIT Tree-Decomposition Graph Minor Theory and Algorithmic Implications Ausgeführt am Institut für Diskrete Mathematik und Geometrie der Technischen Universität Wien unter Anleitung von Univ.Prof. Dipl.-Ing. Dr.techn. Michael Drmota durch Miriam Heinz, B.Sc. Matrikelnummer: 0625661 Baumgartenstraße 53 1140 Wien Datum Unterschrift Preface The focus of this thesis is the concept of tree-decomposition. A tree-decomposition of a graph G is a representation of G in a tree-like structure. From this structure it is possible to deduce certain connectivity properties of G. Such information can be used to construct efficient algorithms to solve problems on G. Sometimes problems which are NP-hard in general are solvable in polynomial or even linear time when restricted to trees. Employing the tree-like structure of tree-decompositions these algorithms for trees can be adapted to graphs of bounded tree-width. This results in many important algorithmic applications of tree-decomposition. The concept of tree-decomposition also proves to be useful in the study of fundamental questions in graph theory. It was used extensively by Robertson and Seymour in their seminal work on Wagner’s conjecture. Their Graph Minors series of papers spans more than 500 pages and results in a proof of the graph minor theorem, settling Wagner’s conjecture in 2004. However, it is not only the proof of this deep and powerful theorem which merits mention. Also the concepts and tools developed for the proof have had a major impact on the field of graph theory. Tree-decomposition is one of these spin-offs. Therefore, we will study both its use in the context of graph minor theory and its several algorithmic implications.
    [Show full text]
  • IMS Council Election Results
    Volume 42 • Issue 5 IMS Bulletin August 2013 IMS Council election results The annual IMS Council election results are in! CONTENTS We are pleased to announce that the next IMS 1 Council election results President-Elect is Erwin Bolthausen. This year 12 candidates stood for six places 2 Members’ News: David on Council (including one two-year term to fill Donoho; Kathryn Roeder; Erwin Bolthausen Richard Davis the place vacated by Erwin Bolthausen). The new Maurice Priestley; C R Rao; IMS Council members are: Richard Davis, Rick Durrett, Steffen Donald Richards; Wenbo Li Lauritzen, Susan Murphy, Jane-Ling Wang and Ofer Zeitouni. 4 X-L Files: From t to T Ofer will serve the shorter term, until August 2015, and the others 5 Anirban’s Angle: will serve three-year terms, until August 2016. Thanks to Council Randomization, Bootstrap members Arnoldo Frigessi, Nancy Lopes Garcia, Steve Lalley, Ingrid and Sherlock Holmes Van Keilegom and Wing Wong, whose terms will finish at the IMS Rick Durrett Annual Meeting at JSM Montreal. 6 Obituaries: George Box; William Studden IMS members also voted to accept two amendments to the IMS Constitution and Bylaws. The first of these arose because this year 8 Donors to IMS Funds the IMS Nominating Committee has proposed for President-Elect a 10 Medallion Lecture Preview: current member of Council (Erwin Bolthausen). This brought up an Peter Guttorp; Wald Lecture interesting consideration regarding the IMS Bylaws, which are now Preview: Piet Groeneboom reworded to take this into account. Steffen Lauritzen 14 Viewpoint: Are professional The second amendment concerned Organizational Membership.
    [Show full text]
  • An Extensive on Graph English Language Bibliograp Theory and Its A
    NATIONAL AERONAUTICS AND SPACE AD Technical Report 32-7473 An Extensive English Language Bibliograp on Graph Theory and Its A Narsingh De0 JET PROPULS N LABORATORY CALIFORNIA INSTITUTE OF TECHNOLOGY PASADENA, CALIFORNIA October 15,1969 NATIONAL AERONAUTICS AND SPACE ADMINISTRATION Technical Report 32-7473 An Extensive English Language Bibliography on Graph Theory and Its Applications Narsingh Deo JET PROPULSION LABORATORY CALIFORNIA INSTITUTE OF TECHNOLOGY PASADENA, CALIFORNIA October 15, 1969 Prepared Under Contract No. NAS 7-100 National Aeronautics and Space Administration Preface The work described in this report was performed under the cognizance of the Guidance and Control Division of the Jet Propulsion Laboratory. The author delivered a series of 16 lectures on Graph Theory and Its Applica- tion at Jet Propulsion Laboratory’s Applied Mathematics Seminar during Jan.- Mar., 1968. Since that time he has received numerous requests-from his col- leagues at JPL, from students and faculty at Gal Tech, and from outside-for bibliographies in theory and applications of graphs. This technical report is compiled chiefly to meet this need. As far as the author knows, the most extensive existing bibliography on the theory of linear graphs was compiled by A. A. Zykov in early 1963 for the sym- posium held at Smoleniee, Czechoslovakia in June 1963. This bibliography was an extension of an earlier bibliography by J. W. Moon and L. Moser. Although Zykov’s bibliography has served as an excellent source of informa- tion for research workers and students, it has its shortcomings. It is 6 years old and hence is in obvious need of updating.
    [Show full text]
  • Strings and Geometry
    Clay Mathematics Proceedings This volume is the proceedings of Volume 3 the 2002 Clay Mathematics Institute 3 School on Geometry and String Theory. This month-long program Strings and was held at the Isaac Newton Institute for Mathematical Sciences in Cambridge, England, and was organized by both mathematicians and physicists: A. Corti, R. Dijkgraaf, M. Douglas, J. Gauntlett, M. Gross, C. Hull, A. Jaffe and M. Reid. The early part of the school had many lectures that introduced various G STRINGS AND concepts of algebraic geometry eometry and string theory with a focus on improving communication between GEOMETRY these two fields. During the latter Proceedings of the part of the program there were also Clay Mathematics Institute a number of research level talks. 2002 Summer School This volume contains a selection of expository and research articles Isaac Newton Institute by lecturers at the school, and D Cambridge, United Kingdom highlights some of the current ouglas, interests of researchers working March 24–April 20, 2002 at the interface between string theory and algebraic geometry. The topics covered include manifolds G Michael Douglas of special holonomy, supergravity, auntlett and Jerome Gauntlett supersymmetry, D-branes, the McKay correspondence and the Mark Gross Fourier-Mukai transform. Editors G ross, Editors CMIP/3 www.ams.org American Mathematical Society AMS www.claymath.org CMI Clay Mathematics Institute 4-color process 392 pages • 3/4” spine STRINGS AND GEOMETRY Clay Mathematics Proceedings Volume 3 STRINGS AND GEOMETRY Proceedings of the Clay Mathematics Institute 2002 Summer School on Strings and Geometry Isaac Newton Institute Cambridge, United Kingdom March 24–April 20, 2002 Michael Douglas Jerome Gauntlett Mark Gross Editors American Mathematical Society Clay Mathematics Institute 2000 Mathematics Subject Classification.
    [Show full text]
  • Rigid Surface Operators
    c 2010 International Press Adv. Theor. Math. Phys. 14 (2010) 87–177 Rigid surface operators Sergei Gukov1,2,4 and Edward Witten3 1Department of Physics, University of California, Santa Barbara, CA 93106, USA 2School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA [email protected] 3School of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, USA 4On leave from California Institute of Technology. Abstract Surface operators in gauge theory are analogous to Wilson and ’t Hooft line operators except that they are supported on a two-dimensional sur- face rather than a one-dimensional curve. In a previous paper, we con- structed a certain class of half-BPS surface operators in N = 4 super Yang–Mills theory, and determined how they transform under S-duality. Those surface operators depend on a relatively large number of freely adjustable parameters. In the present paper, we consider the opposite case of half-BPS surface operators that are “rigid” in the sense that they do not depend on any parameters at all. We present some simple con- structions of rigid half-BPS surface operators and attempt to determine how they transform under duality. This attempt is only partially suc- cessful, suggesting that our constructions are not the whole story. The partial match suggests interesting connections with quantization. We discuss some possible refinements and some string theory constructions which might lead to a more complete picture. e-print archive: http://lanl.arXiv.org/abs/hep-th//0804.1561 88 SERGEI
    [Show full text]
  • Chern-Simons Gauge Theory: 20 Years After
    %17-4 7XYHMIWMR Advanced 1EXLIQEXMGW S.-T. Yau, 7IVMIW Editor Chern-Simons Gauge Theory: 20 Years After Jørgen E. Andersen Hans U. Boden Atle Hahn Benjamin Himpel Editors %QIVMGER1EXLIQEXMGEP7SGMIX]-RXIVREXMSREP4VIWW Chern-Simons Gauge Theory: 20 Years After https://doi.org/10.1090/amsip/050 AMS/IP Studies in Advanced Mathematics Volume 50 Chern-Simons Gauge Theory: 20 Years After Jørgen E. Andersen Hans U. Boden Atle Hahn Benjamin Himpel Editors American Mathematical Society • International Press Shing-Tung Yau, General Editor 2000 Mathematics Subject Classification. Primary 11F23, 14E20, 16S10, 19L10, 20C20, 20F99, 20L05, 30F60, 32G15, 46E25, 53C50, 53D20, 53D99, 54C40, 55R80, 57M25, 57M27, 57M60, 57M50, 57N05, 57N10, 57R56, 58D27, 58D30, 58E09, 58J28, 58J30, 58J52, 58Z05, 70S15, 81T08, 81T13, 81T25, 81T30, 81T45, 83C80. Library of Congress Cataloging-in-Publication Data Chern-Simons gauge theory: 20 years after / Jørgen E. Andersen ...[et al.], editors. p. cm. (AMS/IP studies in advanced mathematics ; v. 50) Proceedings of a workshop held at the Max Planck Institute for Mathematics in Bonn, Aug. 3–7, 2009. Includes bibliographical references. ISBN 978-0-8218-5353-5 (alk. paper) 1. Number theory—Congresses. 2. Algebraic topology—Congresses. 3. Associative rings— Congresses. 4. K-theory—Congresses. 5. Group theory—Congresses. I. Andersen, Jørgen E. 1965– QA241.C6355 2010 514.74—dc22 2011012166 Copying and reprinting. Material in this book may be reproduced by any means for edu- cational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents and provided that the customary acknowledg- ment of the source is given.
    [Show full text]