Strings and Geometry
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Modern Coding Theory: the Statistical Mechanics and Computer Science Point of View
Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View Andrea Montanari1 and R¨udiger Urbanke2 ∗ 1Stanford University, [email protected], 2EPFL, ruediger.urbanke@epfl.ch February 12, 2007 Abstract These are the notes for a set of lectures delivered by the two authors at the Les Houches Summer School on ‘Complex Systems’ in July 2006. They provide an introduction to the basic concepts in modern (probabilistic) coding theory, highlighting connections with statistical mechanics. We also stress common concepts with other disciplines dealing with similar problems that can be generically referred to as ‘large graphical models’. While most of the lectures are devoted to the classical channel coding problem over simple memoryless channels, we present a discussion of more complex channel models. We conclude with an overview of the main open challenges in the field. 1 Introduction and Outline The last few years have witnessed an impressive convergence of interests between disciplines which are a priori well separated: coding and information theory, statistical inference, statistical mechanics (in particular, mean field disordered systems), as well as theoretical computer science. The underlying reason for this convergence is the importance of probabilistic models and/or probabilistic techniques in each of these domains. This has long been obvious in information theory [53], statistical mechanics [10], and statistical inference [45]. In the last few years it has also become apparent in coding theory and theoretical computer science. In the first case, the invention of Turbo codes [7] and the re-invention arXiv:0704.2857v1 [cs.IT] 22 Apr 2007 of Low-Density Parity-Check (LDPC) codes [30, 28] has motivated the use of random constructions for coding information in robust/compact ways [50]. -
Arxiv:1812.11658V1 [Hep-Th] 31 Dec 2018 Genitors of Black Holes And, Via the Brane-World, As Entire Universes in Their Own Right
IMPERIAL-TP-2018-MJD-03 Thirty years of Erice on the brane1 M. J. Duff Institute for Quantum Science and Engineering and Hagler Institute for Advanced Study, Texas A&M University, College Station, TX, 77840, USA & Theoretical Physics, Blackett Laboratory, Imperial College London, London SW7 2AZ, United Kingdom & Mathematical Institute, Andrew Wiles Building, University of Oxford, Oxford OX2 6GG, United Kingdom Abstract After initially meeting with fierce resistance, branes, p-dimensional extended objects which go beyond particles (p=0) and strings (p=1), now occupy centre stage in theo- retical physics as microscopic components of M-theory, as the seeds of the AdS/CFT correspondence, as a branch of particle phenomenology, as the higher-dimensional pro- arXiv:1812.11658v1 [hep-th] 31 Dec 2018 genitors of black holes and, via the brane-world, as entire universes in their own right. Notwithstanding this early opposition, Nino Zichichi invited me to to talk about su- permembranes and eleven dimensions at the 1987 School on Subnuclear Physics and has continued to keep Erice on the brane ever since. Here I provide a distillation of my Erice brane lectures and some personal recollections. 1Based on lectures at the International Schools of Subnuclear Physics 1987-2017 and the International Symposium 60 Years of Subnuclear Physics at Bologna, University of Bologna, November 2018. Contents 1 Introduction 5 1.1 Geneva and Erice: a tale of two cities . 5 1.2 Co-authors . 9 1.3 Nomenclature . 9 2 1987 Not the Standard Superstring Review 10 2.1 Vacuum degeneracy and the multiverse . 10 2.2 Supermembranes . -
Arxiv:Hep-Th/9905112V1 17 May 1999 C E a -Al [email protected]
SU-ITP-99/22 KUL-TF-99/16 PSU-TH-208 hep-th/9905112 May 17, 1999 Supertwistors as Quarks of SU(2, 2|4) Piet Claus†a, Murat Gunaydin∗b, Renata Kallosh∗∗c, J. Rahmfeld∗∗d and Yonatan Zunger∗∗e † Instituut voor theoretische fysica, Katholieke Universiteit Leuven, B-3001 Leuven, Belgium ∗ Physics Department, Penn State University, University Park, PA, 1682, USA ∗∗ Physics Department, Stanford University, Stanford, CA 94305-4060, USA Abstract 5 The GS superstring on AdS5 × S has a nonlinearly realized, spontaneously arXiv:hep-th/9905112v1 17 May 1999 broken SU(2, 2|4) symmetry. Here we introduce a two-dimensional model in which the unbroken SU(2, 2|4) symmetry is linearly realized. The basic vari- ables are supertwistors, which transform in the fundamental representation of this supergroup. The quantization of this supertwistor model leads to the complete oscillator construction of the unitary irreducible representations of the centrally extended SU(2, 2|4). They include the states of d = 4 SYM theory, massless and KK states of AdS5 supergravity, and the descendants on AdS5 of the standard mas- sive string states, which form intermediate and long massive supermultiplets. We present examples of long massive supermultiplets and discuss possible states of solitonic and (p,q) strings. a e-mail: [email protected]. b e-mail: [email protected]. c e-mail: [email protected]. d e-mail: [email protected]. e e-mail: [email protected]. 1 Introduction Supertwistors have not yet been fully incorporated into the study of the AdS/CFT correspondence [1]. -
Killing Spinor-Valued Forms and the Cone Construction
ARCHIVUM MATHEMATICUM (BRNO) Tomus 52 (2016), 341–355 KILLING SPINOR-VALUED FORMS AND THE CONE CONSTRUCTION Petr Somberg and Petr Zima Abstract. On a pseudo-Riemannian manifold M we introduce a system of partial differential Killing type equations for spinor-valued differential forms, and study their basic properties. We discuss the relationship between solutions of Killing equations on M and parallel fields on the metric cone over M for spinor-valued forms. 1. Introduction The subject of the present article are the systems of over-determined partial differential equations for spinor-valued differential forms, classified as atypeof Killing equations. The solution spaces of these systems of PDE’s are termed Killing spinor-valued differential forms. A central question in geometry asks for pseudo-Riemannian manifolds admitting non-trivial solutions of Killing type equa- tions, namely how the properties of Killing spinor-valued forms relate to the underlying geometric structure for which they can occur. Killing spinor-valued forms are closely related to Killing spinors and Killing forms with Killing vectors as a special example. Killing spinors are both twistor spinors and eigenspinors for the Dirac operator, and real Killing spinors realize the limit case in the eigenvalue estimates for the Dirac operator on compact Riemannian spin manifolds of positive scalar curvature. There is a classification of complete simply connected Riemannian manifolds equipped with real Killing spinors, leading to the construction of manifolds with the exceptional holonomy groups G2 and Spin(7), see [8], [1]. Killing vector fields on a pseudo-Riemannian manifold are the infinitesimal generators of isometries, hence they influence its geometrical properties. -
Gsm025-Endmatter.Pdf
http://dx.doi.org/10.1090/gsm/025 Selected Titles in This Series 25 Thomas Friedrich, Dirac operators in Riemannian geometry, 2000 24 Helmut Koch, Number theory: Algebraic numbers and functions, 2000 23 Alberto Candel and Lawrence Conlon, Foliations I, 2000 22 Giinter R. Krause and Thomas H. Lenagan, Growth of algebras and Gelfand-Kirillov dimension, 2000 21 John B. Conway, A course in operator theory, 2000 20 Robert E. Gompf and Andras I. Stipsicz, 4-manifolds and Kirby calculus, 1999 19 Lawrence C. Evans, Partial differential equations, 1998 18 Winfried Just and Martin Weese, Discovering modern set theory. II: Set-theoretic tools for every mathematician, 1997 17 Henryk Iwaniec, Topics in classical automorphic forms, 1997 16 Richard V. Kadison and John R. Ringrose, Fundamentals of the theory of operator algebras. Volume II: Advanced theory, 1997 15 Richard V. Kadison and John R. Ringrose, Fundamentals of the theory of operator algebras. Volume I: Elementary theory, 1997 14 Elliott H. Lieb and Michael Loss, Analysis, 1997 13 Paul C. Shields, The ergodic theory of discrete sample paths, 1996 12 N. V. Krylov, Lectures on elliptic and parabolic equations in Holder spaces, 1996 11 Jacques Dixmier, Enveloping algebras, 1996 Printing 10 Barry Simon, Representations of finite and compact groups, 1996 9 Dino Lorenzini, An invitation to arithmetic geometry, 1996 8 Winfried Just and Martin Weese, Discovering modern set theory. I: The basics, 1996 7 Gerald J. Janusz, Algebraic number fields, second edition, 1996 6 Jens Carsten Jantzen, Lectures on quantum groups, 1996 5 Rick Miranda, Algebraic curves and Riemann surfaces, 1995 4 Russell A. -
Spinors of Real Type As Polyforms and the Generalized Killing Equation 11
SPINORS OF REAL TYPE AS POLYFORMS AND THE GENERALIZED KILLING EQUATION VICENTE CORTÉS, CALIN LAZAROIU, AND C. S. SHAHBAZI Abstract. We develop a new framework for the study of generalized Killing spinors, where generalized Killing spinor equations, possibly with constraints, can be formulated equivalently as systems of partial differential equations for a polyform satisfying algebraic relations in the Kähler- Atiyah bundle constructed by quantizing the exterior algebra bundle of the underlying manifold. At the core of this framework lies the characterization, which we develop in detail, of the image of the spinor squaring map of an irreducible Clifford module Σ of real type as a real algebraic variety in the Kähler-Atiyah algebra, which gives necessary and sufficient conditions for a polyform to be the square of a real spinor. We apply these results to Lorentzian four-manifolds, obtaining a new description of a real spinor on such a manifold through a certain distribution of parabolic 2-planes in its cotangent bundle. We use this result to give global characterizations of real Killing spinors on Lorentzian four-manifolds and of four-dimensional supersymmetric configurations of heterotic supergravity. In particular, we find new families of Einstein and non-Einstein four-dimensional Lorentzian metrics admitting real Killing spinors, some of which are deformations of the metric of AdS4 space-time. Contents 1. Introduction 1 2. Representing real vectors as endomorphisms in a paired vectorspace 6 3. From real spinors to polyforms 14 4. Constrained Generalized Killing spinors of real type 28 5. Real Killing spinors on Lorentzian four-manifolds 39 6. Supersymmetric heterotic configurations 47 Appendix A. -
Modern Coding Theory: the Statistical Mechanics and Computer Science Point of View
Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View Andrea Montanari1 and R¨udiger Urbanke2 ∗ 1Stanford University, [email protected], 2EPFL, ruediger.urbanke@epfl.ch February 12, 2007 Abstract These are the notes for a set of lectures delivered by the two authors at the Les Houches Summer School on ‘Complex Systems’ in July 2006. They provide an introduction to the basic concepts in modern (probabilistic) coding theory, highlighting connections with statistical mechanics. We also stress common concepts with other disciplines dealing with similar problems that can be generically referred to as ‘large graphical models’. While most of the lectures are devoted to the classical channel coding problem over simple memoryless channels, we present a discussion of more complex channel models. We conclude with an overview of the main open challenges in the field. 1 Introduction and Outline The last few years have witnessed an impressive convergence of interests between disciplines which are a priori well separated: coding and information theory, statistical inference, statistical mechanics (in particular, mean field disordered systems), as well as theoretical computer science. The underlying reason for this convergence is the importance of probabilistic models and/or probabilistic techniques in each of these domains. This has long been obvious in information theory [53], statistical mechanics [10], and statistical inference [45]. In the last few years it has also become apparent in coding theory and theoretical computer science. In the first case, the invention of Turbo codes [7] and the re-invention of Low-Density Parity-Check (LDPC) codes [30, 28] has motivated the use of random constructions for coding information in robust/compact ways [50]. -
Arxiv:2105.02776V2 [Hep-Th] 19 May 2021
DESY 21-060 Intersecting Defects and Supergroup Gauge Theory Taro Kimuraa and Fabrizio Nierib aInstitut de Math´ematiquesde Bourgogne Universit´eBourgogne Franche-Comt´e,21078 Dijon, France. bDESY Theory Group Notkestraße 85, 22607 Hamburg, Germany. E-mail: [email protected], [email protected] Abstract: We consider 5d supersymmetric gauge theories with unitary groups in the Ω- background and study codim-2/4 BPS defects supported on orthogonal planes intersecting at the origin along a circle. The intersecting defects arise upon implementing the most generic Higgsing (geometric transition) to the parent higher dimensional theory, and they are described by pairs of 3d supersymmetric gauge theories with unitary groups interacting through 1d matter at the intersection. We explore the relations between instanton and gen- eralized vortex calculus, pointing out a duality between intersecting defects subject to the Ω-background and a deformation of supergroup gauge theories, the exact supergroup point being achieved in the self-dual or unrefined limit. Embedding our setup into refined topo- logical strings and in the simplest case when the parent 5d theory is Abelian, we are able to identify the supergroup theory dual to the intersecting defects as the supergroup version of refined Chern-Simons theory via open/closed duality. We also discuss the BPS/CFT side of the correspondence, finding an interesting large rank duality with super-instanton counting. arXiv:2105.02776v3 [hep-th] 21 Sep 2021 Keywords: Supersymmetric gauge theory, defects, -
The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001
The packing problem in statistics, coding theory and finite projective spaces: update 2001 J.W.P. Hirschfeld School of Mathematical Sciences University of Sussex Brighton BN1 9QH United Kingdom http://www.maths.sussex.ac.uk/Staff/JWPH [email protected] L. Storme Department of Pure Mathematics Krijgslaan 281 Ghent University B-9000 Gent Belgium http://cage.rug.ac.be/ ls ∼ [email protected] Abstract This article updates the authors’ 1998 survey [133] on the same theme that was written for the Bose Memorial Conference (Colorado, June 7-11, 1995). That article contained the principal results on the packing problem, up to 1995. Since then, considerable progress has been made on different kinds of subconfigurations. 1 Introduction 1.1 The packing problem The packing problem in statistics, coding theory and finite projective spaces regards the deter- mination of the maximal or minimal sizes of given subconfigurations of finite projective spaces. This problem is not only interesting from a geometrical point of view; it also arises when coding-theoretical problems and problems from the design of experiments are translated into equivalent geometrical problems. The geometrical interest in the packing problem and the links with problems investigated in other research fields have given this problem a central place in Galois geometries, that is, the study of finite projective spaces. In 1983, a historical survey on the packing problem was written by the first author [126] for the 9th British Combinatorial Conference. A new survey article stating the principal results up to 1995 was written by the authors for the Bose Memorial Conference [133]. -
Arxiv:1111.6055V1 [Math.CO] 25 Nov 2011 2 Definitions
Adinkras for Mathematicians Yan X Zhang Massachusetts Institute of Technology November 28, 2011 Abstract Adinkras are graphical tools created for the study of representations in supersym- metry. Besides having inherent interest for physicists, adinkras offer many easy-to-state and accessible mathematical problems of algebraic, combinatorial, and computational nature. We use a more mathematically natural language to survey these topics, suggest new definitions, and present original results. 1 Introduction In a series of papers starting with [8], different subsets of the “DFGHILM collaboration” (Doran, Faux, Gates, Hübsch, Iga, Landweber, Miller) have built and extended the ma- chinery of adinkras. Following the spirit of Feyman diagrams, adinkras are combinatorial objects that encode information about the representation theory of supersymmetry alge- bras. Adinkras have many intricate links with other fields such as graph theory, Clifford theory, and coding theory. Each of these connections provide many problems that can be compactly communicated to a (non-specialist) mathematician. This paper is a humble attempt to bridge the language gap and generate communication. We redevelop the foundations in a self-contained manner in Sections 2 and 4, using different definitions and constructions that we consider to be more mathematically natural for our purposes. Using our new setup, we prove some original results and make new interpretations in Sections 5 and 6. We wish that these purely combinatorial discussions will equip the readers with a mental model that allows them to appreciate (or to solve!) the original representation-theoretic problems in the physics literature. We return to these problems in Section 7 and reconsider some of the foundational questions of the theory. -
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 -
The Use of Coding Theory in Computational Complexity 1 Introduction
The Use of Co ding Theory in Computational Complexity Joan Feigenbaum ATT Bell Lab oratories Murray Hill NJ USA jfresearchattcom Abstract The interplay of co ding theory and computational complexity theory is a rich source of results and problems This article surveys three of the ma jor themes in this area the use of co des to improve algorithmic eciency the theory of program testing and correcting which is a complexity theoretic analogue of error detection and correction the use of co des to obtain characterizations of traditional complexity classes such as NP and PSPACE these new characterizations are in turn used to show that certain combinatorial optimization problems are as hard to approximate closely as they are to solve exactly Intro duction Complexity theory is the study of ecient computation Faced with a computational problem that can b e mo delled formally a complexity theorist seeks rst to nd a solution that is provably ecient and if such a solution is not found to prove that none exists Co ding theory which provides techniques for robust representation of information is valuable b oth in designing ecient solutions and in proving that ecient solutions do not exist This article surveys the use of co des in complexity theory The improved upp er b ounds obtained with co ding techniques include b ounds on the numb er of random bits used by probabilistic algo rithms and the communication complexity of cryptographic proto cols In these constructions co des are used to design small sample spaces that approximate the b ehavior