Officers and Committee Members, Volume 51, Number 9
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Questions About Boij-S\" Oderberg Theory
QUESTIONS ABOUT BOIJ–SODERBERG¨ THEORY DANIEL ERMAN AND STEVEN V SAM 1. Background on Boij–Soderberg¨ Theory Boij–S¨oderberg theory focuses on the properties and duality relationship between two types of numerical invariants. One side involves the Betti table of a graded free resolution over the polynomial ring. The other side involves the cohomology table of a coherent sheaf on projective space. The theory began with a conjectural description of the cone of Betti tables of finite length modules, given in [10]. Those conjectures were proven in [25], which also described the cone of cohomology tables of vector bundles and illustrated a sort of duality between Betti tables and cohomology tables. The theory itself has since expanded in many directions: allowing modules whose support has higher dimension, replacing vector bundles by coherent sheaves, working over rings other than the polynomial ring, and so on. But at its core, Boij–S¨oderberg theory involves: (1) A classification, up to scalar multiple, of the possible Betti tables of some class of objects (for example, free resolutions of finitely generated modules of dimension ≤ c). (2) A classification, up to scalar multiple, of the cohomology tables of some class of objects (for examples, coherent sheaves of dimension ≤ n − c). (3) Intersection theory-style duality results between Betti tables and cohomology tables. One motivation behind Boij and S¨oderberg’s conjectures was the observation that it would yield an immediate proof of the Cohen–Macaulay version of the Multiplicity Conjectures of Herzog–Huneke–Srinivasan [44]. Eisenbud and Schreyer’s [25] thus yielded an immediate proof of that conjecture, and the subsequent papers [11, 26] provided a proof of the Mul- tiplicity Conjecture for non-Cohen–Macaulay modules. -
Bibliography
Bibliography [1] Emil Artin. Galois Theory. Dover, second edition, 1964. [2] Michael Artin. Algebra. Prentice Hall, first edition, 1991. [3] M. F. Atiyah and I. G. Macdonald. Introduction to Commutative Algebra. Addison Wesley, third edition, 1969. [4] Nicolas Bourbaki. Alg`ebre, Chapitres 1-3.El´ements de Math´ematiques. Hermann, 1970. [5] Nicolas Bourbaki. Alg`ebre, Chapitre 10.El´ements de Math´ematiques. Masson, 1980. [6] Nicolas Bourbaki. Alg`ebre, Chapitres 4-7.El´ements de Math´ematiques. Masson, 1981. [7] Nicolas Bourbaki. Alg`ebre Commutative, Chapitres 8-9.El´ements de Math´ematiques. Masson, 1983. [8] Nicolas Bourbaki. Elements of Mathematics. Commutative Algebra, Chapters 1-7. Springer–Verlag, 1989. [9] Henri Cartan and Samuel Eilenberg. Homological Algebra. Princeton Math. Series, No. 19. Princeton University Press, 1956. [10] Jean Dieudonn´e. Panorama des mat´ematiques pures. Le choix bourbachique. Gauthiers-Villars, second edition, 1979. [11] David S. Dummit and Richard M. Foote. Abstract Algebra. Wiley, second edition, 1999. [12] Albert Einstein. Zur Elektrodynamik bewegter K¨orper. Annalen der Physik, 17:891–921, 1905. [13] David Eisenbud. Commutative Algebra With A View Toward Algebraic Geometry. GTM No. 150. Springer–Verlag, first edition, 1995. [14] Jean-Pierre Escofier. Galois Theory. GTM No. 204. Springer Verlag, first edition, 2001. [15] Peter Freyd. Abelian Categories. An Introduction to the theory of functors. Harper and Row, first edition, 1964. [16] Sergei I. Gelfand and Yuri I. Manin. Homological Algebra. Springer, first edition, 1999. [17] Sergei I. Gelfand and Yuri I. Manin. Methods of Homological Algebra. Springer, second edition, 2003. [18] Roger Godement. Topologie Alg´ebrique et Th´eorie des Faisceaux. -
The Quest for Pi David H. Bailey, Jonathan M. Borwein, Peter B
The Quest for Pi David H. Bailey, Jonathan M. Borwein, Peter B. Borwein and Simon Plouffe June 25, 1996 Ref: Mathematical Intelligencer, vol. 19, no. 1 (Jan. 1997), pg. 50–57 Abstract This article gives a brief history of the analysis and computation of the mathematical constant π =3.14159 ..., including a number of the formulas that have been used to compute π through the ages. Recent developments in this area are then discussed in some detail, including the recent computation of π to over six billion decimal digits using high-order convergent algorithms, and a newly discovered scheme that permits arbitrary individual hexadecimal digits of π to be computed. D. Bailey: NASA Ames Research Center, Mail Stop T27A-1, Moffett Field, CA 94035-1000. E-mail: [email protected]. J. Borwein: Dept. of Mathematics and Statistics, Simon Fraser University Burnaby, BC V5A 1S6 Canada. Email: [email protected]. This work was supported by NSERC and the Shrum Endowment at Simon Fraser University. P. Borwein: Dept. of Mathematics and Statistics, Simon Fraser University Burnaby, BC V5A 1S6 Canada. Email: [email protected]. S. Plouffe: Dept. of Mathematics and Statistics, Simon Fraser University Burnaby, BC V5A 1S6 Canada. Email: [email protected]. 1 Introduction The fascinating history of the constant we now know as π spans several millennia, almost from the beginning of recorded history up to the present day. In many ways this history parallels the advancement of science and technology in general, and of mathematics and computer technology in particular. An overview of this history is presented here in sections one and two. -
The Geometry of Syzygies
The Geometry of Syzygies A second course in Commutative Algebra and Algebraic Geometry David Eisenbud University of California, Berkeley with the collaboration of Freddy Bonnin, Clement´ Caubel and Hel´ ene` Maugendre For a current version of this manuscript-in-progress, see www.msri.org/people/staff/de/ready.pdf Copyright David Eisenbud, 2002 ii Contents 0 Preface: Algebra and Geometry xi 0A What are syzygies? . xii 0B The Geometric Content of Syzygies . xiii 0C What does it mean to solve linear equations? . xiv 0D Experiment and Computation . xvi 0E What’s In This Book? . xvii 0F Prerequisites . xix 0G How did this book come about? . xix 0H Other Books . 1 0I Thanks . 1 0J Notation . 1 1 Free resolutions and Hilbert functions 3 1A Hilbert’s contributions . 3 1A.1 The generation of invariants . 3 1A.2 The study of syzygies . 5 1A.3 The Hilbert function becomes polynomial . 7 iii iv CONTENTS 1B Minimal free resolutions . 8 1B.1 Describing resolutions: Betti diagrams . 11 1B.2 Properties of the graded Betti numbers . 12 1B.3 The information in the Hilbert function . 13 1C Exercises . 14 2 First Examples of Free Resolutions 19 2A Monomial ideals and simplicial complexes . 19 2A.1 Syzygies of monomial ideals . 23 2A.2 Examples . 25 2A.3 Bounds on Betti numbers and proof of Hilbert’s Syzygy Theorem . 26 2B Geometry from syzygies: seven points in P3 .......... 29 2B.1 The Hilbert polynomial and function. 29 2B.2 . and other information in the resolution . 31 2C Exercises . 34 3 Points in P2 39 3A The ideal of a finite set of points . -
Arxiv:2107.06030V2 [Math.HO] 18 Jul 2021 Jonathan Michael Borwein
Jonathan Michael Borwein 1951 { 2016: Life and Legacy Richard P. Brent∗ Abstract Jonathan M. Borwein (1951{2016) was a prolific mathematician whose career spanned several countries (UK, Canada, USA, Australia) and whose many interests included analysis, optimisation, number theory, special functions, experimental mathematics, mathematical finance, mathematical education, and visualisation. We describe his life and legacy, and give an annotated bibliography of some of his most significant books and papers. 1 Life and Family Jonathan (Jon) Michael Borwein was born in St Andrews, Scotland, on 20 May 1951. He was the first of three children of David Borwein (1924{2021) and Bessie Borwein (n´eeFlax). It was an itinerant academic family. Both Jon's father David and his younger brother Peter Borwein (1953{2020) are well-known mathematicians and occasional co-authors of Jon. His mother Bessie is a former professor of anatomy. The Borweins have an Ashkenazy Jewish background. Jon's father was born in Lithuania, moved in 1930 with arXiv:2107.06030v4 [math.HO] 15 Sep 2021 his family to South Africa (where he met his future wife Bessie), and moved with Bessie to the UK in 1948. There he obtained a PhD (London) and then a Lectureship in St Andrews, Scotland, where Jon was born and went to school at Madras College. The family, including Jon and his two siblings, moved to Ontario, Canada, in 1963. In 1971 Jon graduated with a BA (Hons ∗Mathematical Sciences Institute, Australian National University, Canberra, ACT. Email: <[email protected]>. 1 Math) from the University of Western Ontario. It was in Ontario that Jon met his future wife and lifelong partner Judith (n´eeRoots). -
Peter Borwein Professor and Burnaby Mountain Chair, Executive Director
Peter Borwein Professor and Burnaby Mountain Chair, Executive Director IRMACS (Interdisciplinary Research in the Mathematical and Computational Sciences) Simon Fraser University, Vancouver, B.C. DEGREES B.Sc. University of Western Ontario, Mathematics, 1974 M.Sc. University of British Columbia, Mathematics, 1976 Ph.D. University of British Columbia, Mathematics, 1979 He has authored six books and over a 150 research articles. His research interests span Diophantine and computational number theory, classical analysis and symbolic computation. He has a central interest in scientific collaboration and computational experimentation technologies. He is recipient of the Chauvenet Prize and the Hasse prize 1993 (with J. Borwein and D. Bailey); the 1996 CUFA/BC Academic of the Year (co-recipient); the University of Western Ontario National Alumni Merit Award 1999; the Ford Prize 2002 (with L. Jorgensen) He is nominated for the $100000 Edge of Computation Science Prize (with D.H. Bailey and S. Plouffe) for their work on the so called BBP algorithm He is Executive Director for the initiative in Interdisciplinary Research in the Mathematical and Computational Sciences (IRMACS). This is a major initiative funded by CFI, BCKDF and SFU. The IRMACS Centre is a unique, interdisciplinary research facility that enables collaborative interaction - intellectually, physically and virtually. It provides a versatile, computationally sophisticated infrastructure for nearly 200 scientists whose primary laboratory tool is the computer. See http://www.irmacs.ca/. He is also a principal investigator of a MITACS consortium MOCAA in the Mathematics of Computer Algebra and Analysis. This involves overseeing a national team of researchers, graduate students, programmers and post-docs. This project has as its major industrial sponsor Maple Inc. -
The Bibliography
Referenced Books [Ach92] N. I. Achieser. Theory of Approximation. Dover Publications Inc., New York, 1992. Reprint of the 1956 English translation of the 1st Rus- sian edition; the 2nd augmented Russian edition is available, Moscow, Nauka, 1965. [AH05] Kendall Atkinson and Weimin Han. Theoretical Numerical Analysis: A Functional Analysis Framework, volume 39 of Texts in Applied Mathe- matics. Springer, New York, second edition, 2005. [Atk89] Kendall E. Atkinson. An Introduction to Numerical Analysis. John Wiley & Sons Inc., New York, second edition, 1989. [Axe94] Owe Axelsson. Iterative Solution Methods. Cambridge University Press, Cambridge, 1994. [Bab86] K. I. Babenko. Foundations of Numerical Analysis [Osnovy chislennogo analiza]. Nauka, Moscow, 1986. [Russian]. [BD92] C. A. Brebbia and J. Dominguez. Boundary Elements: An Introductory Course. Computational Mechanics Publications, Southampton, second edition, 1992. [Ber52] S. N. Bernstein. Collected Works. Vol. I. The Constructive Theory of Functions [1905–1930]. Izdat. Akad. Nauk SSSR, Moscow, 1952. [Russian]. [Ber54] S. N. Bernstein. Collected Works. Vol. II. The Constructive Theory of Functions [1931–1953]. Izdat. Akad. Nauk SSSR, Moscow, 1954. [Russian]. [BH02] K. Binder and D. W. Heermann. Monte Carlo Simulation in Statistical Physics: An Introduction, volume 80 of Springer Series in Solid-State Sciences. Springer-Verlag, Berlin, fourth edition, 2002. [BHM00] William L. Briggs, Van Emden Henson, and Steve F. McCormick. A Multigrid Tutorial. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, second edition, 2000. [Boy01] John P. Boyd. Chebyshev and Fourier Spectral Methods. Dover Publi- cations Inc., Mineola, NY, second edition, 2001. [Bra84] Achi Brandt. Multigrid Techniques: 1984 Guide with Applications to Fluid Dynamics, volume 85 of GMD-Studien [GMD Studies]. -
Right Ideals of a Ring and Sublanguages of Science
RIGHT IDEALS OF A RING AND SUBLANGUAGES OF SCIENCE Javier Arias Navarro Ph.D. In General Linguistics and Spanish Language http://www.javierarias.info/ Abstract Among Zellig Harris’s numerous contributions to linguistics his theory of the sublanguages of science probably ranks among the most underrated. However, not only has this theory led to some exhaustive and meaningful applications in the study of the grammar of immunology language and its changes over time, but it also illustrates the nature of mathematical relations between chunks or subsets of a grammar and the language as a whole. This becomes most clear when dealing with the connection between metalanguage and language, as well as when reflecting on operators. This paper tries to justify the claim that the sublanguages of science stand in a particular algebraic relation to the rest of the language they are embedded in, namely, that of right ideals in a ring. Keywords: Zellig Sabbetai Harris, Information Structure of Language, Sublanguages of Science, Ideal Numbers, Ernst Kummer, Ideals, Richard Dedekind, Ring Theory, Right Ideals, Emmy Noether, Order Theory, Marshall Harvey Stone. §1. Preliminary Word In recent work (Arias 2015)1 a line of research has been outlined in which the basic tenets underpinning the algebraic treatment of language are explored. The claim was there made that the concept of ideal in a ring could account for the structure of so- called sublanguages of science in a very precise way. The present text is based on that work, by exploring in some detail the consequences of such statement. §2. Introduction Zellig Harris (1909-1992) contributions to the field of linguistics were manifold and in many respects of utmost significance. -
Representations of Finite Groups
Mathematisches Forschungsinstitut Oberwolfach Report No. 15/2006 Representations of Finite Groups Organised by Alexander S. Kleshchev (Eugene) Markus Linckelmann (Aberdeen) Gunter Malle (Kaiserslautern) Jeremy Rickard (Bristol) March 26th – April 1st, 2006 Abstract. The workshop ”Representations of finite groups” was organized by A. Kleshchev (Eugene), M. Linckelmann (Aberdeen), G. Malle (Kaiser- slautern) and J. Rickard (Bristol). It covered a wide variety of aspects of the representation theory of finite groups and related objects like Hecke algebras. Mathematics Subject Classification (2000): 20-06 20Cxx. Introduction by the Organisers The meeting was organized by A. Kleshchev (Eugene), M. Linckelmann (Ab- erdeen), G. Malle (Kaiserslautern) and J. Rickard (Bristol). This meeting was attended by over 50 participants with broad geographic representation. It covered a wide variety of aspects of the representation theory of finite groups and related objects like Hecke algebras. This workshop was sponsored by a project of the Eu- ropean Union which allowed us to invite in addition to established researchers also a couple of young people working on a PhD in representation theory. In eleven longer lectures of 40 minutes each and twentytwo shorter contributions of 30 min- utes each, recent progress in representation theory was presented and interesting new research directions were proposed. Besides the lectures, there was plenty of time for informal discussion between the participants, either continuing ongoing research cooperation or starting new projects. The topics of the talks came roughly from two major areas: on the one hand side, the investigation of representation theoretic properties of general finite groups and related objects, on the other hand the determination and detailed analysis of representations of special classes of finite groups and related objects like Hecke algebras. -
UCLA Electronic Theses and Dissertations
UCLA UCLA Electronic Theses and Dissertations Title Algorithms for Optimal Paths of One, Many, and an Infinite Number of Agents Permalink https://escholarship.org/uc/item/3qj5d7dj Author Lin, Alex Tong Publication Date 2020 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA Los Angeles Algorithms for Optimal Paths of One, Many, and an Infinite Number of Agents A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Alex Tong Lin 2020 c Copyright by Alex Tong Lin 2020 ABSTRACT OF THE DISSERTATION Algorithms for Optimal Paths of One, Many, and an Infinite Number of Agents by Alex Tong Lin Doctor of Philosophy in Mathematics University of California, Los Angeles, 2020 Professor Stanley J. Osher, Chair In this dissertation, we provide efficient algorithms for modeling the behavior of a single agent, multiple agents, and a continuum of agents. For a single agent, we combine the modeling framework of optimal control with advances in optimization splitting in order to efficiently find optimal paths for problems in very high-dimensions, thus providing allevia- tion from the curse of dimensionality. For a multiple, but finite, number of agents, we take the framework of multi-agent reinforcement learning and utilize imitation learning in order to decentralize a centralized expert, thus obtaining optimal multi-agents that act in a de- centralized fashion. For a continuum of agents, we take the framework of mean-field games and use two neural networks, which we train in an alternating scheme, in order to efficiently find optimal paths for high-dimensional and stochastic problems. -
Program of the Sessions San Diego, California, January 9–12, 2013
Program of the Sessions San Diego, California, January 9–12, 2013 AMS Short Course on Random Matrices, Part Monday, January 7 I MAA Short Course on Conceptual Climate Models, Part I 9:00 AM –3:45PM Room 4, Upper Level, San Diego Convention Center 8:30 AM –5:30PM Room 5B, Upper Level, San Diego Convention Center Organizer: Van Vu,YaleUniversity Organizers: Esther Widiasih,University of Arizona 8:00AM Registration outside Room 5A, SDCC Mary Lou Zeeman,Bowdoin upper level. College 9:00AM Random Matrices: The Universality James Walsh, Oberlin (5) phenomenon for Wigner ensemble. College Preliminary report. 7:30AM Registration outside Room 5A, SDCC Terence Tao, University of California Los upper level. Angles 8:30AM Zero-dimensional energy balance models. 10:45AM Universality of random matrices and (1) Hans Kaper, Georgetown University (6) Dyson Brownian Motion. Preliminary 10:30AM Hands-on Session: Dynamics of energy report. (2) balance models, I. Laszlo Erdos, LMU, Munich Anna Barry*, Institute for Math and Its Applications, and Samantha 2:30PM Free probability and Random matrices. Oestreicher*, University of Minnesota (7) Preliminary report. Alice Guionnet, Massachusetts Institute 2:00PM One-dimensional energy balance models. of Technology (3) Hans Kaper, Georgetown University 4:00PM Hands-on Session: Dynamics of energy NSF-EHR Grant Proposal Writing Workshop (4) balance models, II. Anna Barry*, Institute for Math and Its Applications, and Samantha 3:00 PM –6:00PM Marina Ballroom Oestreicher*, University of Minnesota F, 3rd Floor, Marriott The time limit for each AMS contributed paper in the sessions meeting will be found in Volume 34, Issue 1 of Abstracts is ten minutes. -
Boundary Value Problems for Systems That Are Not Strictly
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Applied Mathematics Letters 24 (2011) 757–761 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml On mixed initial–boundary value problems for systems that are not strictly hyperbolic Corentin Audiard ∗ Institut Camille Jordan, Université Claude Bernard Lyon 1, Villeurbanne, Rhone, France article info a b s t r a c t Article history: The classical theory of strictly hyperbolic boundary value problems has received several Received 25 June 2010 extensions since the 70s. One of the most noticeable is the result of Metivier establishing Received in revised form 23 December 2010 Majda's ``block structure condition'' for constantly hyperbolic operators, which implies Accepted 28 December 2010 well-posedness for the initial–boundary value problem (IBVP) with zero initial data. The well-posedness of the IBVP with non-zero initial data requires that ``L2 is a continuable Keywords: initial condition''. For strictly hyperbolic systems, this result was proven by Rauch. We Boundary value problem prove here, by using classical matrix theory, that his fundamental a priori estimates are Hyperbolicity Multiple characteristics valid for constantly hyperbolic IBVPs. ' 2011 Elsevier Ltd. All rights reserved. 1. Introduction In his seminal paper [1] on hyperbolic initial–boundary value problems, H.O. Kreiss performed the algebraic construction of a tool, now called the Kreiss symmetrizer, that leads to a priori estimates. Namely, if u is a solution of 8 d X C >@ u C A .x; t/@ u D f ;.t; x/ 2 × Ω; <> t j xj R jD1 (1) C >Bu D g;.t; x/ 2 @ × @Ω; :> R ujtD0 D 0; C Pd where the operator @t jD1 Aj@xj is assumed to be strictly hyperbolic and B satisfies the uniform Lopatinski˘ı condition, there is some γ0 > 0 such that u satisfies the a priori estimate p γ kuk 2 C C kuk 2 C ≤ C kf k 2 C C kgk 2 C ; (2) Lγ .R ×Ω/ Lγ .R ×@Ω/ Lγ .R ×Ω/ Lγ .R ×@Ω/ 2 2 −γ t for γ ≥ γ0.