Research Statement
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
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. -
Mathematical Methods of Classical Mechanics-Arnold V.I..Djvu
V.I. Arnold Mathematical Methods of Classical Mechanics Second Edition Translated by K. Vogtmann and A. Weinstein With 269 Illustrations Springer-Verlag New York Berlin Heidelberg London Paris Tokyo Hong Kong Barcelona Budapest V. I. Arnold K. Vogtmann A. Weinstein Department of Department of Department of Mathematics Mathematics Mathematics Steklov Mathematical Cornell University University of California Institute Ithaca, NY 14853 at Berkeley Russian Academy of U.S.A. Berkeley, CA 94720 Sciences U.S.A. Moscow 117966 GSP-1 Russia Editorial Board J. H. Ewing F. W. Gehring P.R. Halmos Department of Department of Department of Mathematics Mathematics Mathematics Indiana University University of Michigan Santa Clara University Bloomington, IN 47405 Ann Arbor, MI 48109 Santa Clara, CA 95053 U.S.A. U.S.A. U.S.A. Mathematics Subject Classifications (1991): 70HXX, 70005, 58-XX Library of Congress Cataloging-in-Publication Data Amol 'd, V.I. (Vladimir Igorevich), 1937- [Matematicheskie melody klassicheskoi mekhaniki. English] Mathematical methods of classical mechanics I V.I. Amol 'd; translated by K. Vogtmann and A. Weinstein.-2nd ed. p. cm.-(Graduate texts in mathematics ; 60) Translation of: Mathematicheskie metody klassicheskoi mekhaniki. Bibliography: p. Includes index. ISBN 0-387-96890-3 I. Mechanics, Analytic. I. Title. II. Series. QA805.A6813 1989 531 '.01 '515-dcl9 88-39823 Title of the Russian Original Edition: M atematicheskie metody klassicheskoi mekhaniki. Nauka, Moscow, 1974. Printed on acid-free paper © 1978, 1989 by Springer-Verlag New York Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer-Verlag, 175 Fifth Avenue, New York, NY 10010, U.S.A.), except for brief excerpts in connection with reviews or scholarly analysis. -
Introduction to Computational Social Choice Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D
Introduction to Computational Social Choice Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia To cite this version: Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia. Introduction to Computational Social Choice. Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia, Handbook of Computational Social Choice, Cambridge University Press, pp.1-29, 2016, 9781107446984. 10.1017/CBO9781107446984. hal-01493516 HAL Id: hal-01493516 https://hal.archives-ouvertes.fr/hal-01493516 Submitted on 21 Mar 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 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. -
Mathematical Foundations of Supersymmetry
MATHEMATICAL FOUNDATIONS OF SUPERSYMMETRY Lauren Caston and Rita Fioresi 1 Dipartimento di Matematica, Universit`adi Bologna Piazza di Porta S. Donato, 5 40126 Bologna, Italia e-mail: [email protected], fi[email protected] 1Investigation supported by the University of Bologna 1 Introduction Supersymmetry (SUSY) is the machinery mathematicians and physicists have developed to treat two types of elementary particles, bosons and fermions, on the same footing. Supergeometry is the geometric basis for supersymmetry; it was first discovered and studied by physicists Wess, Zumino [25], Salam and Strathde [20] (among others) in the early 1970’s. Today supergeometry plays an important role in high energy physics. The objects in super geometry generalize the concept of smooth manifolds and algebraic schemes to include anticommuting coordinates. As a result, we employ the techniques from algebraic geometry to study such objects, namely A. Grothendiek’s theory of schemes. Fermions include all of the material world; they are the building blocks of atoms. Fermions do not like each other. This is in essence the Pauli exclusion principle which states that two electrons cannot occupy the same quantum me- chanical state at the same time. Bosons, on the other hand, can occupy the same state at the same time. Instead of looking at equations which just describe either bosons or fermions separately, supersymmetry seeks out a description of both simultaneously. Tran- sitions between fermions and bosons require that we allow transformations be- tween the commuting and anticommuting coordinates. Such transitions are called supersymmetries. In classical Minkowski space, physicists classify elementary particles by their mass and spin. -
Renormalization and Effective Field Theory
Mathematical Surveys and Monographs Volume 170 Renormalization and Effective Field Theory Kevin Costello American Mathematical Society surv-170-costello-cov.indd 1 1/28/11 8:15 AM http://dx.doi.org/10.1090/surv/170 Renormalization and Effective Field Theory Mathematical Surveys and Monographs Volume 170 Renormalization and Effective Field Theory Kevin Costello American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Ralph L. Cohen, Chair MichaelA.Singer Eric M. Friedlander Benjamin Sudakov MichaelI.Weinstein 2010 Mathematics Subject Classification. Primary 81T13, 81T15, 81T17, 81T18, 81T20, 81T70. The author was partially supported by NSF grant 0706954 and an Alfred P. Sloan Fellowship. For additional information and updates on this book, visit www.ams.org/bookpages/surv-170 Library of Congress Cataloging-in-Publication Data Costello, Kevin. Renormalization and effective fieldtheory/KevinCostello. p. cm. — (Mathematical surveys and monographs ; v. 170) Includes bibliographical references. ISBN 978-0-8218-5288-0 (alk. paper) 1. Renormalization (Physics) 2. Quantum field theory. I. Title. QC174.17.R46C67 2011 530.143—dc22 2010047463 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294 USA. -
Supersymmetric Methods in Quantum and Statistical Physics Series: Theoretical and Mathematical Physics
springer.com Georg Junker Supersymmetric Methods in Quantum and Statistical Physics Series: Theoretical and Mathematical Physics The idea of supersymmetry was originally introduced in relativistic quantum field theories as a generalization of Poincare symmetry. In 1976 Nicolai sug• gested an analogous generalization for non-relativistic quantum mechanics. With the one-dimensional model introduced by Witten in 1981, supersym• metry became a major tool in quantum mechanics and mathematical, sta• tistical, and condensed-IIll;l. tter physics. Supersymmetry is also a successful concept in nuclear and atomic physics. An underlying supersymmetry of a given quantum-mechanical system can be utilized to analyze the properties of the system in an elegant and effective way. It is even possible to obtain exact results thanks to supersymmetry. The purpose of this book is to give an introduction to supersymmet• ric quantum mechanics and review some of the Softcover reprint of the original 1st ed. recent developments of vari• ous supersymmetric methods in quantum and statistical physics. 1996, XIII, 172 p. Thereby we will touch upon some topics related to mathematical and condensed-matter physics. A discussion of supersymmetry in atomic and nuclear physics is omit• ted. However, Printed book the reader will find some references in Chap. 9. Similarly, super• symmetric field theories and Softcover supergravity are not considered in this book. In fact, there exist already many excellent 89,99 € | £79.99 | $109.99 textbooks and monographs on these topics. A list may be found in Chap. 9. Yet, it is hoped that [1]96,29 € (D) | 98,99 € (A) | CHF this book may be useful in preparing a footing for a study of supersymmetric theories in 106,50 atomic, nuclear, and particle physics. -
Arxiv:2012.09211V1 [Math-Ph] 16 Dec 2020
Supersymmetry and Representation Theory in Low Dimensions Mathew Calkins1a;b, S. James Gates, Jr.2c;d, and Caroline Klivans3c;e;f aGoogle Search, 111 8th Ave, New York, NY 10011, USA, bCourant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012, USA cBrown Theoretical Physics Center, Box S, 340 Brook Street, Barus Hall, Providence, RI 02912, USA dDepartment of Physics, Brown University, Box 1843, 182 Hope Street, Barus & Holley, Providence, RI 02912, USA eDivision of Applied Mathematics, Brown University, 182 George Street, Providence, RI 02906, USA and f Institute for Computational & Experimental Research in Mathematics, Brown University, 121 South Main Street Providence, RI 02903, USA ABSTRACT Beginning from a discussion of the known most fundamental dynamical structures of the Standard Model of physics, extended into the realms of math- ematics and theory by the concept of \supersymmetry" or \SUSY," an introduc- tion to efforts to develop a complete representation theory is given. Techniques drawing from graph theory, coding theory, Coxeter Groups, Riemann surfaces, arXiv:2012.09211v1 [math-ph] 16 Dec 2020 and computational approaches to the study of algebraic varieties are briefly highlighted as pathways for future exploration and progress. PACS: 11.30.Pb, 12.60.Jv Keywords: algorithms, off-shell, optimization, supermultiplets, supersymmetry 1 [email protected] 2 sylvester−[email protected] 3 Caroline−[email protected] 1 Supersymmetry and the Standard Model As far as experiments in elementary particle physics reveal, the basic constituents of matter and interactions (i.e. forces excluding gravity) in our universe can be summarized in the list of particles shown in the table indicated in Fig. -
Discrete Mathematics Discrete Probability
Introduction Probability Theory Discrete Mathematics Discrete Probability Prof. Steven Evans Prof. Steven Evans Discrete Mathematics Introduction Probability Theory 7.1: An Introduction to Discrete Probability Prof. Steven Evans Discrete Mathematics Introduction Probability Theory Finite probability Definition An experiment is a procedure that yields one of a given set os possible outcomes. The sample space of the experiment is the set of possible outcomes. An event is a subset of the sample space. Laplace's definition of the probability p(E) of an event E in a sample space S with finitely many equally possible outcomes is jEj p(E) = : jSj Prof. Steven Evans Discrete Mathematics By the product rule, the number of hands containing a full house is the product of the number of ways to pick two kinds in order, the number of ways to pick three out of four for the first kind, and the number of ways to pick two out of the four for the second kind. We see that the number of hands containing a full house is P(13; 2) · C(4; 3) · C(4; 2) = 13 · 12 · 4 · 6 = 3744: Because there are C(52; 5) = 2; 598; 960 poker hands, the probability of a full house is 3744 ≈ 0:0014: 2598960 Introduction Probability Theory Finite probability Example What is the probability that a poker hand contains a full house, that is, three of one kind and two of another kind? Prof. Steven Evans Discrete Mathematics Introduction Probability Theory Finite probability Example What is the probability that a poker hand contains a full house, that is, three of one kind and two of another kind? By the product rule, the number of hands containing a full house is the product of the number of ways to pick two kinds in order, the number of ways to pick three out of four for the first kind, and the number of ways to pick two out of the four for the second kind. -
Why Theory of Quantum Computing Should Be Based on Finite Mathematics Felix Lev
Why Theory of Quantum Computing Should be Based on Finite Mathematics Felix Lev To cite this version: Felix Lev. Why Theory of Quantum Computing Should be Based on Finite Mathematics. 2018. hal-01918572 HAL Id: hal-01918572 https://hal.archives-ouvertes.fr/hal-01918572 Preprint submitted on 11 Nov 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Why Theory of Quantum Computing Should be Based on Finite Mathematics Felix M. Lev Artwork Conversion Software Inc., 1201 Morningside Drive, Manhattan Beach, CA 90266, USA (Email: [email protected]) Abstract We discuss finite quantum theory (FQT) developed in our previous publica- tions and give a simple explanation that standard quantum theory is a special case of FQT in the formal limit p ! 1 where p is the characteristic of the ring or field used in FQT. Then we argue that FQT is a more natural basis for quantum computing than standard quantum theory. Keywords: finite mathematics, quantum theory, quantum computing 1 Motivation Classical computer science is based on discrete mathematics for obvious reasons. Any computer can operate only with a finite number of bits, a bit represents the minimum amount of information and the notions of one half of the bit, one third of the bit etc. -
Two Problems in the Theory of Differential Equations
TWO PROBLEMS IN THE THEORY OF DIFFERENTIAL EQUATIONS D. LEITES Abstract. 1) The differential equation considered in terms of exterior differential forms, as E.Cartan´ did, singles out a differential ideal in the supercommutative superalgebra of differential forms, hence an affine supervariety. In view of this observation, it is evident that every differential equation has a supersymmetry (perhaps trivial). Superymmetries of which (systems of) classical differential equations are missed yet? 2) Why criteria of formal integrability of differential equations are never used in practice? To the memory of Ludvig Dmitrievich Faddeev 1. Introduction While the Large Hadron Collider is busy testing (among other things) the existence of supersymmetry in the high energy physics (more correctly, supersymmetry’s applicability to the models), the existence of supersymmetry in the solid body theory (more correctly, its usefulness for describing the models) is proved beyond any doubt, see the excitatory book [Ef], and later works by K. Efetov. Nonholonomic nature of our space-time, suggested in models due to Kaluza–Klein (and seldom remembered Mandel) was usually considered seperately from its super nature. In this note I give examples where the supersymmetry and non-holonomicity manifest themselves in various, sometimes unexpected, instances. In the models of super space-time, and super strings, as well as in the problems spoken about in this note, these notions appear together and interact. L.D. Faddeev would have liked these topics, each of them being related to what used to be of interest to him. Many examples will be only mentioned in passing. 1.1. History: Faddeev–Popov ghosts as analogs of momenta in “odd” mechanics. -
Mathematical Physics – Online Course
Professor: Luis A. Anchordoqui PHY-307 Physics-307: Mathematical Physics – Online course. General Information: This course is classified as "Zero Textbook Cost." The material for the course is available at the course website https://www.lehman.edu/faculty/anchordoqui/307.html I will be posting weekly announcements on blackboard. Each week the same relevant information you would find on the course website will also be posted on blackboard. The course consists of 12 modules. Each module has a synchronous lecture (Thursday from 4:00 to 5:40) and a session of group discussion (Tuesday from 4:00 to 5:40). Asynchronous participation in the discussion board forum is highly recommended. There will be 3 midterm exams (10/01/2020; 11/24/2020; 12/08/2020) and a comprehensive final exam (12/15/2020). At the end of each lecture we will have a quiz related to the material of the previous module. The layout of the document is as follows. We first present the online course development plan. After that we describe the methodology for assessment of student coursework. Finally, we provide some guidelines on how to be successful in the course, and a summary calendar. Contact information: [email protected] Professor: Luis A. Anchordoqui PHY-307 Course Development Plan Module 1 (Online) Date: 08/27/2020 (Lecture) & 09/01/2020 (Group discussion) Topic: Analytic Functions Description: Complex Analysis I: Complex Algebra. Functions of a Complex Variable. Learning Objectives: 1.The educational methodology of this subject proposes to integrate the domain of concepts and knowledge from mathematics into practical application of physics phenomena, and the development of abilities and skills to solve example problems. -
Mathematics 1
Mathematics 1 MATH 1030 College Algebra (MOTR MATH 130): 3 semester hours Mathematics Prerequisites: A satisfactory score on the UMSL Math Placement Examination, obtained at most one year prior to enrollment in this course, Courses or approval of the department. This is a foundational course in math. Topics may include factoring, complex numbers, rational exponents, MATH 0005 Intermediate Algebra: 3 semester hours simplifying rational functions, functions and their graphs, transformations, Prerequisites: A satisfactory score on the UMSL Math Placement inverse functions, solving linear and nonlinear equations and inequalities, Examination, obtained at most one year prior to enrollment in this polynomial functions, inverse functions, logarithms, exponentials, solutions course. Preparatory material for college level mathematics courses. to systems of linear and nonlinear equations, systems of inequalities, Covers systems of linear equations and inequalities, polynomials, matrices, and rates of change. This course fulfills the University's general rational expressions, exponents, quadratic equations, graphing linear education mathematics proficiency requirement. and quadratic functions. This course carries no credit towards any MATH 1035 Trigonometry: 2 semester hours baccalaureate degree. Prerequisite: MATH 1030 or MATH 1040, or concurrent registration in MATH 1020 Contemporary Mathematics (MOTR MATH 120): 3 either of these two courses, or a satisfactory score on the UMSL Math semester hours Placement Examination, obtained at most one year prior to enrollment Prerequisites: A satisfactory score on the UMSL Math Placement in this course. A study of the trigonometric and inverse trigonometric Examination, obtained at most one year prior to enrollment in this functions with emphasis on trigonometric identities and equations. course. This course presents methods of problem solving, centering on MATH 1045 PreCalculus (MOTR MATH 150): 5 semester hours problems and questions which arise naturally in everyday life.