Richard Rado
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students. -
A Direct Approach to Robustness Optimization
A Direct Approach to Robustness Optimization Thesis by Seungil You In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2016 (Defended August 12, 2015) ii c 2016 Seungil You All Rights Reserved iii To My Family iv Acknowledgments First and foremost, my gratitude goes to my advisor, John. He encouraged me to pursue my own ideas, and always gave me great feedback with a sense of humor. His unique research style made my academic journey at Caltech very special, and changed my way of looking at problems. I was simply lucky to have him as my advisor. I am also thankful to my thesis committee members: Richard Murray, Babak Hassibi, and Venkat Chandrasekaran. Richard has guided me at every milestone of my PhD studies, despite of his impossible schedule. Babak gladly agreed to be my committee member. I was in Venkat’s first class at Caltech on advanced topics in convex optimization. Of course, I was fascinated by the results he taught, and deeply influenced by his genuine point of view on solving mathematical problems. I learned convex optimization from Joel Tropp, and was immediately thrilled by the subject. His endless effort to establish a minimal, elegant theoretical framework for many challenging math problems had a profound impact on me. Lijun Chen taught me how to write a scientific paper, as well as how to formulate the problem in a concrete manner. Under his guidance, I was able to become an independent researcher. I met Ather Gattami in Florence, Italy, during CDC. -
Norms on Complex Matrices Induced by Complete
NORMS ON COMPLEX MATRICES INDUCED BY COMPLETE HOMOGENEOUS SYMMETRIC POLYNOMIALS KONRAD AGUILAR, ÁNGEL CHÁVEZ, STEPHAN RAMON GARCIA, AND JURIJ VOLCIˇ Cˇ Abstract. We introduce a remarkable new family of norms on the space of n × n complex matrices. These norms arise from the combinatorial properties of sym- metric functions, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. Our norms enjoy many desirable analytic and algebraic properties, such as an ele- gant determinantal interpretation and the ability to distinguish certain graphs that other matrix norms cannot. Furthermore, they give rise to new dimension- independent tracial inequalities. Their potential merits further investigation. 1. Introduction In this note we introduce a family of norms on complex matrices. These are ini- tially defined in terms of certain symmetric functions of eigenvalues of complex Hermitian matrices. The fact that we deal with eigenvalues, as opposed to their absolute values, is notable. First, it prevents standard machinery, such as the the- ory of symmetric gauge functions, from applying. Second, the techniques used to establish that we indeed have norms are more complicated than one might ex- pect. For example, combinatorics, probability theory, and Lewis’ framework for group invariance in convex matrix analysis each play key roles. These norms on the Hermitian matrices are of independent interest. They can be computed recursively or directly read from the characteristic polyno- mial. Moreover, our norms distinguish certain pairs of graphs which the standard norms (operator, Frobenius, Schatten-von Neumann, Ky Fan) cannot distinguish. Our norms extend in a natural and nontrivial manner to all complex matrices. -
Embedding Graphs Into Larger Graphs: Results, Methods, and Problems
Embedding graphs into larger graphs: results, methods, and problems Mikl´os Simonovits and Endre Szemer´edi Alfr´ed R´enyi Institute of Mathematics, Hungarian Academy of Sciences, email: [email protected], [email protected] arXiv:1912.02068v1 [math.CO] 4 Dec 2019 2 Mikl´os Simonovits and Endre Szemer´edi: March29, 2019 Contents 1 Introduction.............................. 6 2 Thebeginnings............................ 9 2.1 Veryearlyresults....................... 9 2.2 Constructions......................... 13 2.3 Somehistoricalremarks . .. .. .. .. .. .. .. 13 2.4 Earlyresults ......................... 14 2.5 WhichUniverse? ....................... 16 2.6 Ramseyordensity? ..................... 21 2.7 Whyaretheextremalproblemsinteresting? . 22 2.8 Ramsey Theory and the birth of the Random Graph Method 23 2.9 Dichotomy, randomness and matrix graphs . 24 2.10 Ramsey problems similar to extremal problems . 25 2.11 Applications in Continuous Mathematics . 26 2.12 TheStabilitymethod .................... 26 2.13 The“typicalstructure” . 29 2.14 SupersaturatedGraphs . 31 2.15 Lov´asz-Simonovits Stability theorem . 32 2.16 Degeneratevs Non-degenerateproblems . 33 2.17 Diractheorem:introduction. 36 2.18 Equitable Partition . 36 2.19 Packing, Covering, Tiling, L-factors ............ 37 3 “Classicalmethods” ......................... 40 3.1 DetourI:Induction? ..................... 40 3.2 Detour II: Applications of Linear Algebra . 41 4 Methods: Randomness and the Semi-random method . 43 4.1 Various ways to use randomness in Extremal Graph Theory 44 4.2 Thesemi-randommethod . 45 4.3 Independentsetsinuncrowdedgraphs . 45 4.4 Uncrowdedhypergraphs . 47 4.5 Ramseyestimates ...................... 48 4.6 InfiniteSidonsequences . .. .. .. .. .. .. .. 49 4.7 The Heilbronn problem, old results . 50 4.8 Generalizations of Heilbronn’s problem, new results . 50 4.9 TheHeilbronnproblem,anupperbound. 51 4.10 TheGowersproblem..................... 51 3 4 Mikl´os Simonovits and Endre Szemer´edi: March29, 2019 4.11 Pippenger-Spencertheorem . -
The Role of GH Hardy and the London Mathematical Society
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Historia Mathematica 30 (2003) 173–194 www.elsevier.com/locate/hm The rise of British analysis in the early 20th century: the role of G.H. Hardy and the London Mathematical Society Adrian C. Rice a and Robin J. Wilson b,∗ a Department of Mathematics, Randolph-Macon College, Ashland, VA 23005-5505, USA b Department of Pure Mathematics, The Open University, Milton Keynes MK7 6AA, UK Abstract It has often been observed that the early years of the 20th century witnessed a significant and noticeable rise in both the quantity and quality of British analysis. Invariably in these accounts, the name of G.H. Hardy (1877–1947) features most prominently as the driving force behind this development. But how accurate is this interpretation? This paper attempts to reevaluate Hardy’s influence on the British mathematical research community and its analysis during the early 20th century, with particular reference to his relationship with the London Mathematical Society. 2003 Elsevier Inc. All rights reserved. Résumé On a souvent remarqué que les premières années du 20ème siècle ont été témoins d’une augmentation significative et perceptible dans la quantité et aussi la qualité des travaux d’analyse en Grande-Bretagne. Dans ce contexte, le nom de G.H. Hardy (1877–1947) est toujours indiqué comme celui de l’instigateur principal qui était derrière ce développement. Mais, est-ce-que cette interprétation est exacte ? Cet article se propose d’analyser à nouveau l’influence d’Hardy sur la communauté britannique sur la communauté des mathématiciens et des analystes britanniques au début du 20ème siècle, en tenant compte en particulier de son rapport avec la Société Mathématique de Londres. -
Paul Erdos: the Master of Collaboration
Paul Erdos: The Master of Collaboration Jerrold W. Grossman Department of Mathematical Sciences, Oakland University, Rochester, MI48309- 4401 Over a span of more than 60 years, Paul Erdos has taken the art of col laborative research in mathematics to heights never before achieved. In this brief look at his collaborative efforts, we will explore the breadth of Paul's interests, the company he has kept, and the influence of his collaboration in the mathematical community. Rather than focusing on the mathematical content of his work or the man himself, we will see what conclusions can be drawn by looking mainly at publication lists. Thus our approach will be mostly bibliographical, rather than either mathematical or biographical. The data come mainly from the bibliography in this present volume and records kept by Mathematical Reviews (MR) [13]. Additional useful sources of infor mation include The Hypertext Bibliography Project (a database of articles in theoretical computer science) [11], Zentralblatt [16], the Jahrbuch [10]' vari ous necrological articles too numerous to list, and personal communications. Previous articles on these topics can be found in [3,4,7,8,14]. Paul has certainly become a legend, whose fame (as well as his genius and eccentricity) has spread beyond the circles of research mathematicians. We find a popular videotape about him [2], articles in general circulation maga zines [9,15] (as well as in mathematical publications-see [1] for a wonderful example), and graffiti on the Internet (e.g., his quotation that a mathemati cian is a device for turning coffee into theorems, on a World Wide Web page designed as a sample of the use of the html language [12]). -
Front Matter
Cambridge University Press 0521865654 - Combinatorial Matrix Classes Richard A. Brualdi Frontmatter More information ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS FOUNDED BY G.-C. ROTA Editorial Board P. Flajolet, M. Ismail, E. Lutwak Volume 108 Combinatorial Matrix Classes © Cambridge University Press www.cambridge.org Cambridge University Press 0521865654 - Combinatorial Matrix Classes Richard A. Brualdi Frontmatter More information ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS FOUNDED EDITOR G.-C. ROTA Editorial Board P. Flajolet, M. Ismail, E. Lutwak 40 N. White (ed.) Matroid Applications 41 S. Sakai Operator Algebras in Dynamical Systems 42 W. Hodges Basic Model Theory 43 H. Stahl and V. Totik General Orthogonal Polynomials 45 G. Da Prato and J. Zabczyk Stochastic Equations in Infinite Dimensions 46 A. Bj¨orner et al. Oriented Matroids 47 G. Edgar and L. Sucheston Stopping Times and Directed Processes 48 C. Sims Computation with Finitely Presented Groups 49 T. Palmer Banach Algebras and the General Theory of *-Algebras I 50 F. Borceux Handbook of Categorical Algebra I 51 F. Borceux Handbook of Categorical Algebra II 52 F. Borceux Handbook of Categorical Algebra III 53 V. F. Kolchin Random Graphs 54 A. Katok and B. Hasselblatt Introduction to the Modern Theory of Dynamical Systems 55 V. N. Sachkov Combinatorial Methods in Discrete Mathematics 56 V. N. Sachkov Probabilistic Methods in Discrete Mathematics 57 P. M. Cohn Skew Fields 58 R. Gardner Geometric Tomography 59 G. A. Baker, Jr., and P. Graves-Morris Pad´e Approximants, 2nd edn 60 J. Krajicek Bounded Arithmetic, Propositional Logic, and Complexity Theory 61 H. Groemer Geometric Applications of Fourier Series and Spherical Harmonics 62 H. -
Gradients for the Loss!
Gradients for the Loss! Towards Provable Gradient Algorithms for Non-Convex Problems Fotis Iliopoulos, Vrettos Moulous, Vaishaal Shankar, Max Simchowitz EE227 BT Department of EECSS Contents 1 Convergence of Stochastic Gradient for PCA3 1.1 SGD for Rank 1 Stochastic PCA........................3 1.1.1 A brief overview of Shamir's result...................4 1.1.2 Rank 1 Stochastic PCA Experiments..................7 1.2 The Alecton Algorithm for Higher Rank PCA.................7 1.2.1 Algorithm Intuition...........................8 1.2.2 Precise Setup...............................9 1.3 Sketching the Proof of Theorem 1.2.1...................... 10 1.3.1 Martingales................................ 10 1.3.2 Preliminaries............................... 10 1.3.3 Main Arguments and Completing the proof.............. 11 1.3.4 Experiments for Alecton......................... 14 1.3.5 Toy Convexity in Two Dimensions................... 14 1.3.6 Convexity Results in Higher Dimensions................ 15 1.3.7 Experimental Results.......................... 17 2 Dropping Convexity for Faster Semi-definite Optimization 19 2.1 Introduction: Back to Rank r-PCA....................... 19 2.2 From PCA to General Rank-Constrained Optimization............ 20 2.2.1 Notation and Assumptions....................... 21 2.2.2 Results.................................. 23 2.2.3 A Note on Step Size Selection...................... 24 2.3 Proof Sketch of Results............................. 24 2.4 Initialization................................... 27 2.4.1 Test case: Matrix sensing problem................... 27 3 Noisy Gradients in the Presence of Saddle Points 29 3.1 The Strict Saddle Property........................... 30 3.1.1 Sketch of the Proof............................ 31 3.1.2 Proof Sketch of Lemma 3.1.4...................... 32 3.2 Gradient Descent with Manifold Constraints.................. 34 3.2.1 The Tangent and Normal Space.................... -
Introduction to Ramsey Theory
Introduction to Ramsey Theory Lecture notes for undergraduate course Introduction to Ramsey Theory Lecture notes for undergraduate course Veselin Jungic Simon Fraser University Production Editor: Veselin Jungic Edition: Second Edition ©2014-–2021 Veselin Jungic This work is licensed under the Creative Commons Attribution-NonCommercialShareAlike 4.0 International License. Youcan view a copy of the license at http://creativecommons.org/ licenses/by-nc-sa/4.0/. To my sons, my best teachers. - Veselin Jungic Acknowledgements Drawings of Alfred Hale, Robert Jewett, Richard Rado, Frank Ramsey, Issai Schur, and Bartel van der Waerden were created by Ms. Kyra Pukanich under my directions. The drawing of Frank Ramsey displayed at the end of Section 1.3 was created by Mr. Simon Roy under my directions. I am grateful to Professor Tom Brown, Mr. Rashid Barket, Ms. Jana Caine, Mr. Kevin Halasz, Ms. Arpit Kaur, Ms. Ha Thu Nguyen, Mr. Andrew Poelstra, Mr. Michael Stephen Paulgaard, and Ms. Ompreet Kaur Sarang for their comments and suggestions which have been very helpful in improving the manuscript. I would like to acknowledge the following colleagues for their help in creating the PreTeXt version of the text. • Jana Caine, Simon Fraser University • David Farmer, American Institute of Mathematics • Sean Fitzpatrick , University of Lethbridge • Damir Jungic, Burnaby, BC I am particularly thankful to Dr. Sean Fitzpatrick for inspiring and encouraging me to use PreTeXt. Veselin Jungic vii Preface The purpose of these lecture notes is to serve as a gentle introduction to Ramsey theory for those undergraduate students interested in becoming familiar with this dynamic segment of contemporary mathematics that combines, among others, ideas from number theory and combinatorics. -
Proscribed Normal Decompositions of Euclidean Jordan Algebras
Proscribed normal decompositions of Euclidean Jordan algebras Michael Orlitzky June 30, 2020 Abstract Normal decomposition systems unify many results from convex ma- trix analysis regarding functions that are invariant with respect to a group of transformations—particularly those matrix functions that are unitarily-invariant and the affiliated permutation-invariant “spectral func- tions” that depend only on eigenvalues. Spectral functions extend in a nat- ural way to Euclidean Jordan algebras, and several authors have studied the problem of making a Euclidean Jordan algebra into a normal decom- position system. In particular it is known to be possible with respect to the “eigenvalues of” map when the algebra is essentially-simple. We show the converse, that essential-simplicity is essential to that process. 1 Notation All spaces we encounter will be finite-dimensional real inner-product spaces with the generic hx, yi denoting the inner product of x and y. If V is such a space, then B (V ) is the set of all linear operators on V and Aut (X) is the linear automorphism group of X ⊆ V . The inner product on V induces a norm, and Isom (V ) is the group of linear isometries on V under composition. Explicitly, −1 Aut (X) := L ∈ B (V ) L exists and L (X) = X , Isom (V ) := {L ∈ Aut (V ) | kL (x)k = kxk for all x in V } . The group Isom (V ) is endowed with the natural topology [16] so that Ln ap- proaches L in Isom (V ) if and only if Ln (x) approaches L (x) for all x ∈ V . The adjoint of any L ∈ B (V ) is denoted by L∗, and thus L∗ = L−1 when L ∈ Isom (V ). -
Claude Ambrose Rogers. 1 November 1920- 5 December 2005
Kenneth Falconer, Peter M. Gruber, Adam Ostaszewski and Trevor Stuart Claude Ambrose Rogers. 1 November 1920- 5 December 2005 Article (Published version) (Refereed) Original citation: Falconer, Kenneth, Gruber, Peter M., Ostaszewski, Adam and Stuart, Trevor (2015) Claude Ambrose Rogers. 1 November 1920 — 5 December 2005. Biographical Memoirs of Fellows of the Royal Society, 61 . pp. 403-435. ISSN 0080-4606 DOI: 10.1098/rsbm.2015.0007 © 2015 The Authors This version available at: http://eprints.lse.ac.uk/63494/ Available in LSE Research Online: November 2015 LSE has developed LSE Research Online so that users may access research output of the School. Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Users may download and/or print one copy of any article(s) in LSE Research Online to facilitate their private study or for non-commercial research. You may not engage in further distribution of the material or use it for any profit-making activities or any commercial gain. You may freely distribute the URL (http://eprints.lse.ac.uk) of the LSE Research Online website. Downloaded from http://rsbm.royalsocietypublishing.org/ on November 19, 2015 Claude Ambrose Rogers. 1 November 1920 −− 5 December 2005 Kenneth Falconer, Peter M. Gruber, Adam Ostaszewski and Trevor Stuart Biogr. Mems Fell. R. Soc. 2015 61, 403-435, published 2 September 2015 originally published online September 2, 2015 Supplementary data "Data Supplement" http://rsbm.royalsocietypublishing.org/content/suppl/2015/08 /27/rsbm.2015.0007.DC1.html Email alerting service Receive free email alerts when new articles cite this article - sign up in the box at the top right-hand corner of the article or click here To subscribe to Biogr. -
Arxiv:1602.02719V1 [Math.CO] 8 Feb 2016 Monotonicity
MONOTONE SUBSEQUENCES IN HIGH-DIMENSIONAL PERMUTATIONS NATHAN LINIAL AND MICHAEL SIMKIN Abstract. This paper is part of the ongoing effort to study high-dimensional permutations. We prove the analogue to the Erdős-Szekeres theorem: For every k ≥ 1, every order-n k-dimensional permutation contains a monotone p subsequence of length Ωk n , and this is tight. On the other hand, and unlike the classical case, the longest monotone subsequence in a random k- k dimensional permutation of order n is asymptotically almost surely Θk n k+1 . The study of monotone subsequences in permutations began with the famous Erdős-Szekeres theorem [5]. Since then numerous proofs and generalizations have emerged (see Steele’s survey [14]). We recall the theorem: Theoremp 1. Every permutation in Sn contains a monotone subsequence of length at least d ne, and this is tight: for every n there exists somep permutation in Sn in which all monotone subsequences are of length at most d ne. In order to derive a high-dimensional analogue of theorem 1 we need to define high-dimensional permutations and their monotone subsequences. If we view a permutation as a sequence of distinct real numbers, it is suggestive to consider se- quences of points in Rk, with coordinatewise monotonicity. The following argument is attributed by Kruskal [9] to de Bruijn: Repeatedly apply theorem 1 to conclude k that every sequence x1; x2; : : : ; xn 2 R must have a coordinatewise monotone sub- 1 sequence of length n 2k , and this is tight up to an additive constant. In [9] one considers projections of the points to a line and defines the length of the longest monotone subsequence according to the line with the longest such subsequence.