Kac–Moody Superalgebras and Integrability
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Simulating Quantum Field Theory with a Quantum Computer
Simulating quantum field theory with a quantum computer John Preskill Lattice 2018 28 July 2018 This talk has two parts (1) Near-term prospects for quantum computing. (2) Opportunities in quantum simulation of quantum field theory. Exascale digital computers will advance our knowledge of QCD, but some challenges will remain, especially concerning real-time evolution and properties of nuclear matter and quark-gluon plasma at nonzero temperature and chemical potential. Digital computers may never be able to address these (and other) problems; quantum computers will solve them eventually, though I’m not sure when. The physics payoff may still be far away, but today’s research can hasten the arrival of a new era in which quantum simulation fuels progress in fundamental physics. Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime particle collision molecular chemistry entangled electrons A quantum computer can simulate efficiently any physical process that occurs in Nature. (Maybe. We don’t actually know for sure.) superconductor black hole early universe Two fundamental ideas (1) Quantum complexity Why we think quantum computing is powerful. (2) Quantum error correction Why we think quantum computing is scalable. A complete description of a typical quantum state of just 300 qubits requires more bits than the number of atoms in the visible universe. Why we think quantum computing is powerful We know examples of problems that can be solved efficiently by a quantum computer, where we believe the problems are hard for classical computers. -
Geometric Algorithms
Geometric Algorithms primitive operations convex hull closest pair voronoi diagram References: Algorithms in C (2nd edition), Chapters 24-25 http://www.cs.princeton.edu/introalgsds/71primitives http://www.cs.princeton.edu/introalgsds/72hull 1 Geometric Algorithms Applications. • Data mining. • VLSI design. • Computer vision. • Mathematical models. • Astronomical simulation. • Geographic information systems. airflow around an aircraft wing • Computer graphics (movies, games, virtual reality). • Models of physical world (maps, architecture, medical imaging). Reference: http://www.ics.uci.edu/~eppstein/geom.html History. • Ancient mathematical foundations. • Most geometric algorithms less than 25 years old. 2 primitive operations convex hull closest pair voronoi diagram 3 Geometric Primitives Point: two numbers (x, y). any line not through origin Line: two numbers a and b [ax + by = 1] Line segment: two points. Polygon: sequence of points. Primitive operations. • Is a point inside a polygon? • Compare slopes of two lines. • Distance between two points. • Do two line segments intersect? Given three points p , p , p , is p -p -p a counterclockwise turn? • 1 2 3 1 2 3 Other geometric shapes. • Triangle, rectangle, circle, sphere, cone, … • 3D and higher dimensions sometimes more complicated. 4 Intuition Warning: intuition may be misleading. • Humans have spatial intuition in 2D and 3D. • Computers do not. • Neither has good intuition in higher dimensions! Is a given polygon simple? no crossings 1 6 5 8 7 2 7 8 6 4 2 1 1 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 2 18 4 18 4 19 4 19 4 20 3 20 3 20 1 10 3 7 2 8 8 3 4 6 5 15 1 11 3 14 2 16 we think of this algorithm sees this 5 Polygon Inside, Outside Jordan curve theorem. -
Introduction to Supersymmetry(1)
Introduction to Supersymmetry(1) J.N. Tavares Dep. Matem¶aticaPura, Faculdade de Ci^encias,U. Porto, 4000 Porto TQFT Club 1Esta ¶euma vers~aoprovis¶oria,incompleta, para uso exclusivo nas sess~oesde trabalho do TQFT club CONTENTS 1 Contents 1 Supersymmetry in Quantum Mechanics 2 1.1 The Supersymmetric Oscillator . 2 1.2 Witten Index . 4 1.3 A fundamental example: The Laplacian on forms . 7 1.4 Witten's proof of Morse Inequalities . 8 2 Supergeometry and Supersymmetry 13 2.1 Field Theory. A quick review . 13 2.2 SuperEuclidean Space . 17 2.3 Reality Conditions . 18 2.4 Supersmooth functions . 18 2.5 Supermanifolds . 21 2.6 Lie Superalgebras . 21 2.7 Super Lie groups . 26 2.8 Rigid Superspace . 27 2.9 Covariant Derivatives . 30 3 APPENDIX. Cli®ord Algebras and Spin Groups 31 3.1 Cli®ord Algebras . 31 Motivation. Cli®ord maps . 31 Cli®ord Algebras . 33 Involutions in V .................................. 35 Representations . 36 3.2 Pin and Spin groups . 43 3.3 Spin Representations . 47 3.4 U(2), spinors and almost complex structures . 49 3.5 Spinc(4)...................................... 50 Chiral Operator. Self Duality . 51 2 1 Supersymmetry in Quantum Mechanics 1.1 The Supersymmetric Oscillator i As we will see later the \hermitian supercharges" Q®, in the N extended SuperPoincar¶eLie Algebra obey the anticommutation relations: i j m ij fQ®;Q¯g = 2(γ C)®¯± Pm (1.1) m where ®; ¯ are \spinor" indices, i; j 2 f1; ¢ ¢ ¢ ;Ng \internal" indices and (γ C)®¯ a bilinear form in the spinor indices ®; ¯. When specialized to 0-space dimensions ((1+0)-spacetime), then since P0 = H, relations (1.1) take the form (with a little change in notations): fQi;Qjg = 2±ij H (1.2) with N \Hermitian charges" Qi; i = 1; ¢ ¢ ¢ ;N. -
Introduction to Computational Social Choice
1 Introduction to Computational Social Choice Felix Brandta, Vincent Conitzerb, Ulle Endrissc, J´er^omeLangd, and Ariel D. Procacciae 1.1 Computational Social Choice at a Glance Social choice theory is the field of scientific inquiry that studies the aggregation of individual preferences towards a collective choice. For example, social choice theorists|who hail from a range of different disciplines, including mathematics, economics, and political science|are interested in the design and theoretical evalu- ation of voting rules. Questions of social choice have stimulated intellectual thought for centuries. Over time the topic has fascinated many a great mind, from the Mar- quis de Condorcet and Pierre-Simon de Laplace, through Charles Dodgson (better known as Lewis Carroll, the author of Alice in Wonderland), to Nobel Laureates such as Kenneth Arrow, Amartya Sen, and Lloyd Shapley. Computational social choice (COMSOC), by comparison, is a very young field that formed only in the early 2000s. There were, however, a few precursors. For instance, David Gale and Lloyd Shapley's algorithm for finding stable matchings between two groups of people with preferences over each other, dating back to 1962, truly had a computational flavor. And in the late 1980s, a series of papers by John Bartholdi, Craig Tovey, and Michael Trick showed that, on the one hand, computational complexity, as studied in theoretical computer science, can serve as a barrier against strategic manipulation in elections, but on the other hand, it can also prevent the efficient use of some voting rules altogether. Around the same time, a research group around Bernard Monjardet and Olivier Hudry also started to study the computational complexity of preference aggregation procedures. -
Inönü–Wigner Contraction and D = 2 + 1 Supergravity
Eur. Phys. J. C (2017) 77:48 DOI 10.1140/epjc/s10052-017-4615-1 Regular Article - Theoretical Physics Inönü–Wigner contraction and D = 2 + 1 supergravity P. K. Concha1,2,a, O. Fierro3,b, E. K. Rodríguez1,2,c 1 Departamento de Ciencias, Facultad de Artes Liberales, Universidad Adolfo Ibáñez, Av. Padre Hurtado 750, Viña del Mar, Chile 2 Instituto de Ciencias Físicas y Matemáticas, Universidad Austral de Chile, Casilla 567, Valdivia, Chile 3 Departamento de Matemática y Física Aplicadas, Universidad Católica de la Santísima Concepción, Alonso de Rivera 2850, Concepción, Chile Received: 25 November 2016 / Accepted: 5 January 2017 / Published online: 25 January 2017 © The Author(s) 2017. This article is published with open access at Springerlink.com Abstract We present a generalization of the standard cannot always be obtained by rescaling the gauge fields and Inönü–Wigner contraction by rescaling not only the gener- considering some limit as in the (anti)commutation relations. ators of a Lie superalgebra but also the arbitrary constants In particular it is well known that, in the presence of the exotic appearing in the components of the invariant tensor. The Lagrangian, the Poincaré limit cannot be applied to a (p, q) procedure presented here allows one to obtain explicitly the AdS CS supergravity [7]. This difficulty can be overcome Chern–Simons supergravity action of a contracted superal- extending the osp (2, p) ⊗ osp (2, q) superalgebra by intro- gebra. In particular we show that the Poincaré limit can be ducing the automorphism generators so (p) and so (q) [9]. performed to a D = 2 + 1 (p, q) AdS Chern–Simons super- In such a case, the IW contraction can be applied and repro- gravity in presence of the exotic form. -
Supergravity Backgrounds and Symmetry Superalgebras
Turkish Journal of Physics Turk J Phys (2016) 40: 113 { 126 http://journals.tubitak.gov.tr/physics/ ⃝c TUB¨ ITAK_ Review Article doi:10.3906/fiz-1510-8 Supergravity backgrounds and symmetry superalgebras Umit¨ ERTEM∗ School of Mathematics, College of Science and Engineering, The University of Edinburgh, Edinburgh, United Kingdom Received: 12.10.2015 • Accepted/Published Online: 08.12.2015 • Final Version: 27.04.2016 Abstract: We consider the bosonic sectors of supergravity theories in ten and eleven dimensions corresponding to the low energy limits of string theories and M-theory. The solutions of supergravity field equations are known as supergravity backgrounds and the number of preserved supersymmetries in those backgrounds are determined by Killing spinors. We provide some examples of supergravity backgrounds that preserve different fractions of supersymmetry. An important invariant for the characterization of supergravity backgrounds is their Killing superalgebras, which are constructed out of Killing vectors and Killing spinors of the background. After constructing Killing superalgebras of some special supergravity backgrounds, we discuss the possibilities of the extensions of these superalgebras to include the higher degree hidden symmetries of the background. Key words: Supergravity backgrounds, Killing spinors, Killing superalgebras 1. Introduction The unification of fundamental forces of nature is one of the biggest aims in modern theoretical physics. The most promising approaches for that aim include the ten-dimensional supersymmetric string theories and their eleven-dimensional unification called M-theory. There are five different string theories in ten dimensions: type I, type IIA and IIB, and heterotic E8 × E8 and SO(32) theories. However, some dualities called T-duality, S-duality, and U-duality between strong coupling and weak coupling limits of these theories can be defined and these dualities can give rise to one unified M-theory in eleven dimensions [1, 2, 3, 4]. -
Representations of Centrally Extended Lie Superalgebra $\Mathfrak {Psl}(2
Representations of centrally extended Lie superalgebra psl(2|2) Takuya Matsumoto and Alexander Molev Abstract The symmetries provided by representations of the centrally extended Lie su- peralgebra psl(2|2) are known to play an important role in the spin chain models originated in the planar anti-de Sitter/conformal field theory correspondence and one- dimensional Hubbard model. We give a complete description of finite-dimensional irreducible representations of this superalgebra thus extending the work of Beisert which deals with a generic family of representations. Our description includes a new class of modules with degenerate eigenvalues of the central elements. Moreover, we construct explicit bases in all irreducible representations by applying the techniques of Mickelsson–Zhelobenko algebras. arXiv:1405.3420v2 [math.RT] 15 Sep 2014 Institute for Theoretical Physics and Spinoza Institute Utrecht University, Leuvenlaan 4, 3854 CE Utrecht, The Netherlands [email protected] School of Mathematics and Statistics University of Sydney, NSW 2006, Australia [email protected] 1 1 Introduction As discovered by Beisert [1, 2, 3], certain spin chain models originated in the planar anti-de Sitter/conformal field theory (AdS/CFT) correspondence admit hidden symmetries pro- vided by the action of the Yangian Y(g) associated with the centrally extended Lie super- algebra g = psl(2|2) ⋉C3. This is a semi-direct product of the simple Lie superalgebra psl(2|2) of type A(1, 1) and the abelian Lie algebra C3 spanned by elements C, K and P which are central in g. Due to the results of [6], psl(2|2) is distinguished among the basic classical Lie superalgebras by the existence of a three-dimensional central extension. -
Classification of Simple Linearly Compact N-Lie Superalgebras
Classification of simple linearly compact n-Lie superalgebras The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Cantarini, Nicoletta, and Victor G. Kac. “Classification of Simple Linearly Compact n-Lie Superalgebras.” Communications in Mathematical Physics 298.3 (2010): 833–853. Web. As Published http://dx.doi.org/10.1007/s00220-010-1049-0 Publisher Springer-Verlag Version Author's final manuscript Citable link http://hdl.handle.net/1721.1/71610 Terms of Use Creative Commons Attribution-Noncommercial-Share Alike 3.0 Detailed Terms http://creativecommons.org/licenses/by-nc-sa/3.0/ Classification of simple linearly compact n-Lie superalgebras Nicoletta Cantarini∗ Victor G. Kac∗∗ Abstract We classify simple linearly compact n-Lie superalgebras with n> 2 over a field F of charac- teristic 0. The classification is based on a bijective correspondence between non-abelian n-Lie Z n−1 superalgebras and transitive -graded Lie superalgebras of the form L = ⊕j=−1Lj, where dim Ln−1 = 1, L−1 and Ln−1 generate L, and [Lj ,Ln−j−1] = 0 for all j, thereby reducing it to the known classification of simple linearly compact Lie superalgebras and their Z-gradings. The list consists of four examples, one of them being the n+1-dimensional vector product n-Lie algebra, and the remaining three infinite-dimensional n-Lie algebras. Introduction Given an integer n ≥ 2, an n-Lie algebra g is a vector space over a field F, endowed with an n-ary anti-commutative product n Λ g → g , a1 ∧ . -
Randnla: Randomized Numerical Linear Algebra
review articles DOI:10.1145/2842602 generation mechanisms—as an algo- Randomization offers new benefits rithmic or computational resource for the develop ment of improved algo- for large-scale linear algebra computations. rithms for fundamental matrix prob- lems such as matrix multiplication, BY PETROS DRINEAS AND MICHAEL W. MAHONEY least-squares (LS) approximation, low- rank matrix approxi mation, and Lapla- cian-based linear equ ation solvers. Randomized Numerical Linear Algebra (RandNLA) is an interdisci- RandNLA: plinary research area that exploits randomization as a computational resource to develop improved algo- rithms for large-scale linear algebra Randomized problems.32 From a foundational per- spective, RandNLA has its roots in theoretical computer science (TCS), with deep connections to mathemat- Numerical ics (convex analysis, probability theory, metric embedding theory) and applied mathematics (scientific computing, signal processing, numerical linear Linear algebra). From an applied perspec- tive, RandNLA is a vital new tool for machine learning, statistics, and data analysis. Well-engineered implemen- Algebra tations have already outperformed highly optimized software libraries for ubiquitous problems such as least- squares,4,35 with good scalability in par- allel and distributed environments. 52 Moreover, RandNLA promises a sound algorithmic and statistical foundation for modern large-scale data analysis. MATRICES ARE UBIQUITOUS in computer science, statistics, and applied mathematics. An m × n key insights matrix can encode information about m objects ˽ Randomization isn’t just used to model noise in data; it can be a powerful (each described by n features), or the behavior of a computational resource to develop discretized differential operator on a finite element algorithms with improved running times and stability properties as well as mesh; an n × n positive-definite matrix can encode algorithms that are more interpretable in the correlations between all pairs of n objects, or the downstream data science applications. -
Mechanism, Mentalism, and Metamathematics Synthese Library
MECHANISM, MENTALISM, AND METAMATHEMATICS SYNTHESE LIBRARY STUDIES IN EPISTEMOLOGY, LOGIC, METHODOLOGY, AND PHILOSOPHY OF SCIENCE Managing Editor: JAAKKO HINTIKKA, Florida State University Editors: ROBER T S. COHEN, Boston University DONALD DAVIDSON, University o/Chicago GABRIEL NUCHELMANS, University 0/ Leyden WESLEY C. SALMON, University 0/ Arizona VOLUME 137 JUDSON CHAMBERS WEBB Boston University. Dept. 0/ Philosophy. Boston. Mass .• U.S.A. MECHANISM, MENT ALISM, AND MET AMA THEMA TICS An Essay on Finitism i Springer-Science+Business Media, B.V. Library of Congress Cataloging in Publication Data Webb, Judson Chambers, 1936- CII:J Mechanism, mentalism, and metamathematics. (Synthese library; v. 137) Bibliography: p. Includes indexes. 1. Metamathematics. I. Title. QA9.8.w4 510: 1 79-27819 ISBN 978-90-481-8357-9 ISBN 978-94-015-7653-6 (eBook) DOl 10.1007/978-94-015-7653-6 All Rights Reserved Copyright © 1980 by Springer Science+Business Media Dordrecht Originally published by D. Reidel Publishing Company, Dordrecht, Holland in 1980. Softcover reprint of the hardcover 1st edition 1980 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any informational storage and retrieval system, without written permission from the copyright owner TABLE OF CONTENTS PREFACE vii INTRODUCTION ix CHAPTER I / MECHANISM: SOME HISTORICAL NOTES I. Machines and Demons 2. Machines and Men 17 3. Machines, Arithmetic, and Logic 22 CHAPTER II / MIND, NUMBER, AND THE INFINITE 33 I. The Obligations of Infinity 33 2. Mind and Philosophy of Number 40 3. Dedekind's Theory of Arithmetic 46 4. -
World-Sheet Supersymmetry and Supertargets
Motivation World-Sheet SUSY Lie superalgebras From World-Sheet SUSY to Supertargets Outlook World-sheet supersymmetry and supertargets Peter Browne Rønne University of the Witwatersrand, Johannesburg Chapel Hill, August 19, 2010 arXiv:1006.5874 Thomas Creutzig, PR Motivation World-Sheet SUSY Lie superalgebras From World-Sheet SUSY to Supertargets Outlook Sigma-models on supergroups/cosets The Wess-Zumino-Novikov-Witten (WZNW) model of a Lie supergroup is a CFT with additional affine Lie superalgebra symmetry. Important role in physics • Statistical systems • String theory, AdS/CFT Notoriously hard: Deformations away from WZNW-point Use and explore the rich structure of dualities and correspondences in 2d field theories Motivation World-Sheet SUSY Lie superalgebras From World-Sheet SUSY to Supertargets Outlook Sigma models on supergroups: AdS/CFT The group of global symmetries of the gauge theory and also of the dual string theory is a Lie supergroup G. The dual string theory is described by a two-dimensional sigma model on a superspace. PSU(2; 2j4) AdS × S5 supercoset 5 SO(4; 1) × SO(5) PSU(1; 1j2) AdS × S2 supercoset 2 U(1) × U(1) 3 AdS3 × S PSU(1; 1j2) supergroup 3 3 AdS3 × S × S D(2; 1; α) supergroup Obtained using GS or hybrid formalism. What about RNS formalism? And what are the precise relations? Motivation World-Sheet SUSY Lie superalgebras From World-Sheet SUSY to Supertargets Outlook 3 4 AdS3 × S × T D1-D5 brane system on T 4 with near-horizon limit 3 4 AdS3 × S × T . After S-duality we have N = (1; 1) WS SUSY WZNW model on SL(2) × SU(2) × U4. -
A Mathematical Analysis of Student-Generated Sorting Algorithms Audrey Nasar
The Mathematics Enthusiast Volume 16 Article 15 Number 1 Numbers 1, 2, & 3 2-2019 A Mathematical Analysis of Student-Generated Sorting Algorithms Audrey Nasar Let us know how access to this document benefits ouy . Follow this and additional works at: https://scholarworks.umt.edu/tme Recommended Citation Nasar, Audrey (2019) "A Mathematical Analysis of Student-Generated Sorting Algorithms," The Mathematics Enthusiast: Vol. 16 : No. 1 , Article 15. Available at: https://scholarworks.umt.edu/tme/vol16/iss1/15 This Article is brought to you for free and open access by ScholarWorks at University of Montana. It has been accepted for inclusion in The Mathematics Enthusiast by an authorized editor of ScholarWorks at University of Montana. For more information, please contact [email protected]. TME, vol. 16, nos.1, 2&3, p. 315 A Mathematical Analysis of student-generated sorting algorithms Audrey A. Nasar1 Borough of Manhattan Community College at the City University of New York Abstract: Sorting is a process we encounter very often in everyday life. Additionally it is a fundamental operation in computer science. Having been one of the first intensely studied problems in computer science, many different sorting algorithms have been developed and analyzed. Although algorithms are often taught as part of the computer science curriculum in the context of a programming language, the study of algorithms and algorithmic thinking, including the design, construction and analysis of algorithms, has pedagogical value in mathematics education. This paper will provide an introduction to computational complexity and efficiency, without the use of a programming language. It will also describe how these concepts can be incorporated into the existing high school or undergraduate mathematics curriculum through a mathematical analysis of student- generated sorting algorithms.