DOCSLIB.ORG

Hadamard Matrices

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Hadamard Matrices Hadamard Matrices: Truth & Hadamard Matrices: Consequences Raymond Nguyen Advisor: Peter Truth & Consequences Casazza The University of Missouri Math 8190 (Master’s Project) Basic Theory of Raymond Nguyen Hadamard Advisor: Peter Casazza Matrices Hadamard Matrix The University of Missouri Constructions Math 8190 (Master’s Project) Applications of Hadamard Matrices Spring 2020 1 / 55 Hadamard Matrices: Outline Truth & Consequences Raymond Nguyen Advisor: Peter Casazza The University of Missouri 1 Math 8190 Basic Theory of Hadamard Matrices (Master’s Project) Basic Theory of Hadamard 2 Hadamard Matrix Constructions Matrices Hadamard Matrix Constructions Applications of 3 Hadamard Applications of Hadamard Matrices Matrices 2 / 55 Hadamard Matrices: Table of Contents Truth & Consequences Raymond Nguyen Advisor: Peter 1 Basic Theory of Hadamard Matrices Casazza The University of Missouri Math 8190 Definition & Examples (Master’s Project) Basic Theory of Properties Hadamard Matrices Definition & Examples The Hadamard Conjecture Properties The Hadamard Conjecture Hadamard Matrix Constructions 2 Applications of Hadamard Matrix Constructions Hadamard Matrices 3 Applications of Hadamard Matrices 3 / 55 Hadamard Matrices: What is a Hadamard Matrix? Truth & Consequences Raymond Nguyen Advisor: Peter Definition (Hadamard Matrix) Casazza The University of Missouri A square matrix H of order n whose entries are +1 or −1 is called a Math 8190 Hadamard matrix of order n provided its rows are pairwise orthogonal – (Master’s Project) i.e., Basic Theory of T Hadamard HH = n · In. (1) Matrices Definition & Examples Properties The Hadamard Conjecture Note that (1) implies that H has an inverse 1 HT . Consequently, its Hadamard Matrix n Constructions columns are also pairwise orthogonal – i.e., Applications of Hadamard Matrices T H H = n · In. (2) 4 / 55 Hadamard Matrices: Examples Truth & Consequences Raymond Nguyen Hadamard Matrices of Order 1, 2, 4, and 8: Advisor: Peter Casazza The University of Missouri + + + + + + + + Math 8190 (Master’s Project) + − + − + − + − + + + + Basic Theory of Hadamard + + − − + + − − Matrices Definition & Examples + + + − + − Properties h i + − − + + − − + + , , , and The Hadamard Conjecture + − + + − − + + + + − − − − Hadamard Matrix Constructions + − + − − + − + Applications of + − − + Hadamard Matrices + + − − − − + + + − − + − + + − 5 / 55 Hadamard Matrices: “Anallagmatic Pavement” – J.J. Sylvester (1867) Truth & Consequences Raymond Nguyen Advisor: Peter Casazza Hadamard Matrices of Order 1, 2, 4, and 8: The University of Missouri Math 8190 (Master’s Project) Basic Theory of Hadamard Matrices Definition & Examples Properties The Hadamard Conjecture Hadamard Matrix Constructions Applications of Hadamard Matrices , , , and 6 / 55 Hadamard Matrices: James Joseph Sylvester (1814 – 1897) Truth & Consequences Raymond Nguyen Advisor: Peter Casazza 1. Discovered Hadamard matrices The University of Missouri in 1867. Math 8190 (Master’s Project) Basic Theory of 2. Coined the terms ”matrix”, Hadamard Matrices ”determinant”, and Definition & Examples Properties ”discriminant”. The Hadamard Conjecture Hadamard Matrix Constructions 3. Served as the very first math Applications of professor at Johns Hopkins Hadamard Matrices (Source: http://mathshistory.st-andrews.ac.uk/) University (1876-1883). 7 / 55 Hadamard Matrices: The Key Property of a Hadamard Matrix Truth & Consequences Recall that the defining property of a Hadamard matrix is that Raymond Nguyen T Advisor: Peter its rows are orthogonal – i.e., HH = n · In. This property does not change if Casazza The University of we: Missouri Math 8190 (Master’s Project) 1. Take the transpose of H. Basic Theory of Hadamard 2. Permute the rows of H. Matrices Definition & Examples Properties 3. Permute the columns of H. The Hadamard Conjecture Hadamard Matrix 4. Multiply any row by -1. Constructions Applications of 5. Multiply any column by -1. Hadamard Matrices Definition (Hadamard Equivalence) Two Hadamard matrices are called equivalent if they differ by some sequence of the 5 operations listed above. 8 / 55 Hadamard Matrices: The Normal Form of a Hadamard Matrix Truth & Consequences Raymond Nguyen Definition Advisor: Peter Casazza The University of A Hadamard matrix is called normalized if its first row and first column Missouri Math 8190 consist entirely of +1’s. (Master’s Project) Basic Theory of Hadamard For example, here is a normalized Hadamard matrix of order 4: Matrices Definition & Examples Properties + + + + The Hadamard Conjecture Hadamard Matrix Constructions + + − − Applications of Hadamard + − + − Matrices + − − + 9 / 55 Hadamard Matrices: Normalization Truth & Consequences Raymond Nguyen Advisor: Peter Fact Casazza The University of Every Hadamard matrix is equivalent to a normalized Hadamard matrix. Missouri Math 8190 (Master’s Project) Given a Hadamard matrix, we can write it in normal form by negating every row Basic Theory of Hadamard and every column whose first element is −1. Matrices Definition & Examples Properties + − + + + − + + + + + + The Hadamard Conjecture Hadamard Matrix + − − − + − − − + + − − Constructions negate 3rd row negate 2nd col −−−−−−−−−→ −−−−−−−−→ Applications of − − − + + + + − + − + − Hadamard Matrices + + − + + + − + + − − + 10 / 55 Hadamard Matrices: Properties of Normalized Hadamard Matrices Truth & Consequences Raymond Nguyen Advisor: Peter Lemma Casazza The University of Suppose H is a normalized Hadamard matrix. With the exception of the first row Missouri (column), every row (column) of H has the following properties: Math 8190 (Master’s Project) 1) Exactly half of the elements are +1’s and exactly half are −1’s. 2) Exactly half of the +1’s overlap with a +1 in any other given row (column). Basic Theory of Hadamard Matrices Definition & Examples Properties The Hadamard Conjecture + + + + + + + + + + + + + + + + Hadamard Matrix Constructions + (1) + + − − (1) & (2) + + − − (1) & (2) + + − − −−→ −−−−−→ −−−−−→ Applications of + + + − + − + − + − Hadamard Matrices + + + + − − + Up to equivalence, the matrix on the right is the unique Hadamard matrix of order 4. 11 / 55 Hadamard Matrices: How Many Distinct Hadamard Matrices of a Given Truth & Consequences Order Exist? Raymond Nguyen Advisor: Peter Casazza The University of Missouri Math 8190 (Master’s Project) Up to equivalence, there is a unique Hadamard matrix of order m Basic Theory of for m = 1, 2, 4, 8, and 12. For m > 12, the number of distinct Hadamard Hadamard Matrices matrices can be very large. Definition & Examples Properties The Hadamard Conjecture order 1 2 4 8 12 16 20 24 28 32 Hadamard Matrix # 1 1 1 1 1 4 3 36 294 > 1 million Constructions Applications of Hadamard (Source: I.M. Wanless, 2005) Matrices 12 / 55 Hadamard Matrices: A Necessary Condition for Existence Truth & Consequences Lemma Raymond Nguyen Advisor: Peter Suppose H is a normalized Hadamard matrix. With the exception of the first row Casazza The University of (column), every row (column) of H has the following properties: Missouri 1) Exactly half of the elements are +1’s and exactly half are −1’s. Math 8190 (Master’s Project) 2) Exactly half of the +1’s overlap with a +1 in any other given row (column). Basic Theory of Hadamard Matrices Theorem Definition & Examples Properties If a Hadamard matrix of order m exists, then m = 1, 2, or a multiple of 4. The Hadamard Conjecture Hadamard Matrix Constructions Applications of + + + + + ··· + + + + + + Hadamard + + ······ + + − − · · · · · · − − Matrices + + + ··· + − · · · − [+] , , or + − . . + 13 / 55 Hadamard Matrices: Question: Does there exist a Hadamard matrix for Truth & Consequences every order that is a multiple of 4? Raymond Nguyen Advisor: Peter Casazza The University of Missouri Math 8190 Answer: Nobody knows ... but go try this at home! (Master’s Project) Basic Theory of Hadamard The Hadamard Conjecture Matrices Definition & Examples A Hadamard matrix of order 4n exists for all positive integers n. Properties The Hadamard Conjecture Hadamard Matrix Constructions Raymond Paley (1933): “It seems probable that, whenever m is divisible by 4, it Applications of Hadamard is possible to construct an orthogonal matrix of order m composed of ±1, but Matrices the general theorem has every appearance of difficulty.” 14 / 55 Hadamard Matrices: Jacques Hadamard (1865 – 1963) Truth & Consequences Raymond Nguyen Advisor: Peter Casazza The University of 1. Showed in 1893 that if M is a square Missouri matrix of order n whose entries are ±1, Math 8190 √ (Master’s Project) then det(M) ≤ ( n)n and that this bound is achieved iff M is a Hadamard matrix. Basic Theory of Hadamard (This is a special case of Hadamard’s Matrices maximal determinant problem.) Definition & Examples Properties 2. Proved that if a Hadamard matrix exists The Hadamard Conjecture Hadamard Matrix (i.e., if the bound above is achieved), then Constructions its order must be 1, 2, or a multiple of 4. Applications of Hadamard 3. Was the first to construct Hadamard Matrices (Source: http://mathshistory.st-andrews.ac.uk/) matrices of orders 12 and 20. 15 / 55 Hadamard Matrices: Table of Contents Truth & Consequences Raymond Nguyen Advisor: Peter 1 Basic Theory of Hadamard Matrices Casazza The University of Missouri Math 8190 (Master’s Project) 2 Hadamard Matrix Constructions Basic Theory of Hadamard Sylvester’s Construction Matrices Hadamard Matrix Constructions Sylvester’s Construction Paley’s Construction Paley’s
Load more

Recommended publications
  • Chapter 7 Block Designs
    Chapter 7 Block Designs One simile that solitary shines In the dry desert of a thousand lines. Epilogue to the Satires, ALEXANDER POPE The collection of all subsets of cardinality k of a set with v elements (k < v) has the ³ ´ v¡t property that any subset of t elements, with 0 · t · k, is contained in precisely k¡t subsets of size k. The subsets of size k provide therefore a nice covering for the subsets of a lesser cardinality. Observe that the number of subsets of size k that contain a subset of size t depends only on v; k; and t and not on the specific subset of size t in question. This is the essential defining feature of the structures that we wish to study. The example we just described inspires general interest in producing similar coverings ³ ´ v without using all the k subsets of size k but rather as small a number of them as possi- 1 2 CHAPTER 7. BLOCK DESIGNS ble. The coverings that result are often elegant geometrical configurations, of which the projective and affine planes are examples. These latter configurations form nice coverings only for the subsets of cardinality 2, that is, any two elements are in the same number of these special subsets of size k which we call blocks (or, in certain instances, lines). A collection of subsets of cardinality k, called blocks, with the property that every subset of size t (t · k) is contained in the same number (say ¸) of blocks is called a t-design. We supply the reader with constructions for t-designs with t as high as 5.
    [Show full text]
  • Robert De Montessus De Ballore's 1902 Theorem on Algebraic
    Robert de Montessus de Ballore’s 1902 theorem on algebraic continued fractions : genesis and circulation Hervé Le Ferrand ∗ October 31, 2018 Abstract Robert de Montessus de Ballore proved in 1902 his famous theorem on the convergence of Padé approximants of meromorphic functions. In this paper, we will first describe the genesis of the theorem, then investigate its circulation. A number of letters addressed to Robert de Montessus by different mathematicians will be quoted to help determining the scientific context and the steps that led to the result. In particular, excerpts of the correspondence with Henri Padé in the years 1901-1902 played a leading role. The large number of authors who mentioned the theorem soon after its derivation, for instance Nörlund and Perron among others, indicates a fast circulation due to factors that will be thoroughly explained. Key words Robert de Montessus, circulation of a theorem, algebraic continued fractions, Padé’s approximants. MSC : 01A55 ; 01A60 1 Introduction This paper aims to study the genesis and circulation of the theorem on convergence of algebraic continued fractions proven by the French mathematician Robert de Montessus de Ballore (1870-1937) in 1902. The main issue is the following : which factors played a role in the elaboration then the use of this new result ? Inspired by the study of Sturm’s theorem by Hourya Sinaceur [52], the scientific context of Robert de Montessus’ research will be described. Additionally, the correlation with the other topics on which he worked will be highlighted,
    [Show full text]
  • Dirichlet Character Difference Graphs 1
    DIRICHLET CHARACTER DIFFERENCE GRAPHS M. BUDDEN, N. CALKINS, W. N. HACK, J. LAMBERT and K. THOMPSON Abstract. We define Dirichlet character difference graphs and describe their basic properties, includ- ing the enumeration of triangles. In the case where the modulus is an odd prime, we exploit the spectral properties of such graphs in order to provide meaningful upper bounds for their diameter. 1. Introduction Upon one's first encounter with abstract algebra, a theorem which resonates throughout the theory is Cayley's theorem, which states that every finite group is isomorphic to a subgroup of some symmetric group. The significance of such a result comes from giving all finite groups a common ground by allowing one to focus on groups of permutations. It comes as no surprise that algebraic graph theorists chose the name Cayley graphs to describe graphs which depict groups. More formally, if G is a group and S is a subset of G closed under taking inverses and not containing the identity, then the Cayley graph, Cay(G; S), is defined to be the graph with vertex set G and an edge occurring between the vertices g and h if hg−1 2 S [9]. Some of the first examples of JJ J I II Cayley graphs that are usually encountered include the class of circulant graphs. A circulant graph, denoted by Circ(m; S), uses Z=mZ as the group for a Cayley graph and the generating set S is Go back m chosen amongst the integers in the set f1; 2; · · · b 2 cg [2].
    [Show full text]
  • Codes and Modules Associated with Designs and T-Uniform Hypergraphs Richard M
    Codes and modules associated with designs and t-uniform hypergraphs Richard M. Wilson California Institute of Technology (1) Smith and diagonal form (2) Solutions of linear equations in integers (3) Square incidence matrices (4) A chain of codes (5) Self-dual codes; Witt’s theorem (6) Symmetric and quasi-symmetric designs (7) The matrices of t-subsets versus k-subsets, or t-uniform hy- pergaphs (8) Null designs (trades) (9) A diagonal form for Nt (10) A zero-sum Ramsey-type problem (11) Diagonal forms for matrices arising from simple graphs 1. Smith and diagonal form Given an r by m integer matrix A, there exist unimodular matrices E and F ,ofordersr and m,sothatEAF = D where D is an r by m diagonal matrix. Here ‘diagonal’ means that the (i, j)-entry of D is 0 unless i = j; but D is not necessarily square. We call any matrix D that arises in this way a diagonal form for A. As a simple example, ⎛ ⎞ 0 −13 10 314⎜ ⎟ 100 ⎝1 −1 −1⎠ = . 21 4 −27 050 01−2 The matrix on the right is a diagonal form for the middle matrix on the left. Let the diagonal entries of D be d1,d2,d3,.... ⎛ ⎞ 20 0 ··· ⎜ ⎟ ⎜0240 ···⎟ ⎜ ⎟ ⎝0 0 120 ···⎠ . ... If all diagonal entries di are nonnegative and di divides di+1 for i =1, 2,...,thenD is called the integer Smith normal form of A, or simply the Smith form of A, and the integers di are called the invariant factors,ortheelementary divisors of A.TheSmith form is unique; the unimodular matrices E and F are not.
    [Show full text]
  • Introducing the Mini-DML Project Thierry Bouche
    Introducing the mini-DML project Thierry Bouche To cite this version: Thierry Bouche. Introducing the mini-DML project. ECM4 Satellite Conference EMANI/DML, Jun 2004, Stockholm, Sweden. 11 p.; ISBN 3-88127-107-4. hal-00347692 HAL Id: hal-00347692 https://hal.archives-ouvertes.fr/hal-00347692 Submitted on 16 Dec 2008 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. Introducing the mini-DML project Thierry Bouche Université Joseph Fourier (Grenoble) WDML workshop Stockholm June 27th 2004 Introduction At the Göttingen meeting of the Digital mathematical library project (DML), in May 2004, the issue was raised that discovery and seamless access to the available digitised litterature was still a task to be acomplished. The ambitious project of a comprehen- sive registry of all ongoing digitisation activities in the field of mathematical research litterature was agreed upon, as well as the further investigation of many linking op- tions to ease user’s life. However, given the scope of those projects, their benefits can’t be expected too soon. Between the hope of a comprehensive DML with many eYcient entry points and the actual dissemination of heterogeneous partial lists of available material, there is a path towards multiple distributed databases allowing integrated search, metadata exchange and powerful interlinking.
    [Show full text]
  • Hadamard and Conference Matrices
    Hadamard and conference matrices Peter J. Cameron December 2011 with input from Dennis Lin, Will Orrick and Gordon Royle Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI. A matrix attaining the bound is a Hadamard matrix. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? A matrix attaining the bound is a Hadamard matrix. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI.
    [Show full text]
  • Some Applications of Hadamard Matrices
    ORIGINAL ARTICLE Jennifer Seberry · Beata J Wysocki · Tadeusz A Wysocki On some applications of Hadamard matrices Abstract Modern communications systems are heavily reliant on statistical tech- niques to recover information in the presence of noise and interference. One of the mathematical structures used to achieve this goal is Hadamard matrices. They are used in many different ways and some examples are given. This paper concentrates on code division multiple access systems where Hadamard matrices are used for user separation. Two older techniques from design and analysis of experiments which rely on similar processes are also included. We give a short bibliography (from the thousands produced by a google search) of applications of Hadamard matrices appearing since the paper of Hedayat and Wallis in 1978 and some appli- cations in telecommunications. 1 Introduction Hadamard matrices seem such simple matrix structures: they are square, have entries +1or−1 and have orthogonal row vectors and orthogonal column vectors. Yet they have been actively studied for over 138 years and still have more secrets to be discovered. In this paper we concentrate on engineering and statistical appli- cations especially those in communications systems, digital image processing and orthogonal spreading sequences for direct sequences spread spectrum code division multiple access. 2 Basic definitions and properties A square matrix with elements ±1 and size h, whose distinct row vectors are mutu- ally orthogonal, is referred to as an Hadamard matrix of order h. The smallest examples are: 2 Seberry et al. 111 1 11 − 1 − 1 (1) , , 1 − 11−− − 11− where − denotes −1. Such matrices were first studied by Sylvester (1867) who observed that if H is an Hadamard matrix, then HH H −H is also an Hadamard matrix.
    [Show full text]
  • The Mathematical Heritage of Henri Poincaré
    http://dx.doi.org/10.1090/pspum/039.1 THE MATHEMATICAL HERITAGE of HENRI POINCARE PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS Volume 39, Part 1 THE MATHEMATICAL HERITAGE Of HENRI POINCARE AMERICAN MATHEMATICAL SOCIETY PROVIDENCE, RHODE ISLAND PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS OF THE AMERICAN MATHEMATICAL SOCIETY VOLUME 39 PROCEEDINGS OF THE SYMPOSIUM ON THE MATHEMATICAL HERITAGE OF HENRI POINCARfe HELD AT INDIANA UNIVERSITY BLOOMINGTON, INDIANA APRIL 7-10, 1980 EDITED BY FELIX E. BROWDER Prepared by the American Mathematical Society with partial support from National Science Foundation grant MCS 79-22916 1980 Mathematics Subject Classification. Primary 01-XX, 14-XX, 22-XX, 30-XX, 32-XX, 34-XX, 35-XX, 47-XX, 53-XX, 55-XX, 57-XX, 58-XX, 70-XX, 76-XX, 83-XX. Library of Congress Cataloging in Publication Data Main entry under title: The Mathematical Heritage of Henri Poincare\ (Proceedings of symposia in pure mathematics; v. 39, pt. 1— ) Bibliography: p. 1. Mathematics—Congresses. 2. Poincare', Henri, 1854—1912— Congresses. I. Browder, Felix E. II. Series: Proceedings of symposia in pure mathematics; v. 39, pt. 1, etc. QA1.M4266 1983 510 83-2774 ISBN 0-8218-1442-7 (set) ISBN 0-8218-1449-4 (part 2) ISBN 0-8218-1448-6 (part 1) ISSN 0082-0717 COPYING AND REPRINTING. Individual readers of this publication, and nonprofit librar• ies acting for them are permitted to make fair use of the material, such as to copy an article for use in teaching or research. Permission is granted to quote brief passages from this publication in re• views provided the customary acknowledgement of the source is given.
    [Show full text]
  • One Method for Construction of Inverse Orthogonal Matrices
    ONE METHOD FOR CONSTRUCTION OF INVERSE ORTHOGONAL MATRICES, P. DIÞÃ National Institute of Physics and Nuclear Engineering, P.O. Box MG6, Bucharest, Romania E-mail: [email protected] Received September 16, 2008 An analytical procedure to obtain parametrisation of complex inverse orthogonal matrices starting from complex inverse orthogonal conference matrices is provided. These matrices, which depend on nonzero complex parameters, generalize the complex Hadamard matrices and have applications in spin models and digital signal processing. When the free complex parameters take values on the unit circle they transform into complex Hadamard matrices. 1. INTRODUCTION In a seminal paper [1] Sylvester defined a general class of orthogonal matrices named inverse orthogonal matrices and provided the first examples of what are nowadays called (complex) Hadamard matrices. A particular class of inverse orthogonal matrices Aa()ij are those matrices whose inverse is given 1 t by Aa(1ij ) (1 a ji ) , where t means transpose, and their entries aij satisfy the relation 1 AA nIn (1) where In is the n-dimensional unit matrix. When the entries aij take values on the unit circle A–1 coincides with the Hermitian conjugate A* of A, and in this case (1) is the definition of complex Hadamard matrices. Complex Hadamard matrices have applications in quantum information theory, several branches of combinatorics, digital signal processing, etc. Complex orthogonal matrices unexpectedly appeared in the description of topological invariants of knots and links, see e.g. Ref. [2]. They were called two- weight spin models being related to symmetric statistical Potts models. These matrices have been generalized to two-weight spin models, also called , Paper presented at the National Conference of Physics, September 10–13, 2008, Bucharest-Mãgurele, Romania.
    [Show full text]
  • Perron Spectratopes and the Real Nonnegative Inverse Eigenvalue Problem
    Perron Spectratopes and the Real Nonnegative Inverse Eigenvalue Problem a b, Charles R. Johnson , Pietro Paparella ∗ aDepartment of Mathematics, College of William & Mary, Williamsburg, VA 23187-8795, USA bDivision of Engineering and Mathematics, University of Washington Bothell, Bothell, WA 98011-8246, USA Abstract Call an n-by-n invertible matrix S a Perron similarity if there is a real non- 1 scalar diagonal matrix D such that SDS− is entrywise nonnegative. We give two characterizations of Perron similarities and study the polyhedra (S) := n 1 C x R : SDxS− 0;Dx := diag (x) and (S) := x (S): x1 = 1 , whichf 2 we call the Perron≥ spectracone andgPerronP spectratopef 2, respectively. C Theg set of all normalized real spectra of diagonalizable nonnegative matrices may be covered by Perron spectratopes, so that enumerating them is of interest. The Perron spectracone and spectratope of Hadamard matrices are of par- ticular interest and tend to have large volume. For the canonical Hadamard matrix (as well as other matrices), the Perron spectratope coincides with the convex hull of its rows. In addition, we provide a constructive version of a result due to Fiedler ([9, Theorem 2.4]) for Hadamard orders, and a constructive version of [2, Theorem 5.1] for Sule˘ımanova spectra. Keywords: Perron spectracone, Perron spectratope, real nonnegative inverse eigenvalue problem, Hadamard matrix, association scheme, relative gain array 2010 MSC: 15A18, 15B48, 15A29, 05B20, 05E30 1. Introduction The real nonnegative inverse eigenvalue problem (RNIEP) is to determine arXiv:1508.07400v2 [math.RA] 19 Nov 2015 which sets of n real numbers occur as the spectrum of an n-by-n nonnegative matrix.
    [Show full text]
  • Hadamard Matrices Include
    Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert, Dennis Lin, Augustyn Markiewicz, Will Orrick, Gordon Royle and many happy returns . Happy Birthday, MSG!! Happy Birthday, MSG!! and many happy returns . Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI. A matrix attaining the bound is a Hadamard matrix. This is a nice example of a continuous problem whose solution brings us into discrete mathematics. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? A matrix attaining the bound is a Hadamard matrix. This is a nice example of a continuous problem whose solution brings us into discrete mathematics. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI.
    [Show full text]
  • Introduction: Some Historical Markers
    Introduction: Some historical markers The aim of this introduction is threefold. First, to give a brief account of a paper of Jacques Hadamard (1865–1963) which is at the genesis of the theory of global proper- ties of surfaces of nonpositive Gaussian curvature. Then, to make a survey of several different notions of nonpositive curvature in metric spaces, each of which axioma- tizes in its own manner an analogue of the notion of nonpositive Gaussian curvature for surfaces and more generally of nonpositive sectional curvature for Riemannian manifolds. In particular, we mention important works by Menger, Busemann and Alexandrov in this domain. Finally, the aim of the introduction is also to review some of the connections between convexity theory and the theory of nonpositive curvature, which constitute the main theme that we develop in this book. The work of Hadamard on geodesics The theory of spaces of nonpositive curvature has a long and interesting history, and it is good to look at its sources. We start with a brief review of the pioneering paper by Hadamard, “Les surfaces à courbures opposées et leurs lignes géodésiques” [87]. This paper, which was written by the end of the nineteenth century (1898), can be considered as the foundational paper for the study of global properties of nonpositively curved spaces. Before that paper, Hadamard had written a paper, titled “Sur certaines propriétés des trajectoires en dynamique” (1893) [84], for which he had received the Borodin prize of the Académie des Sciences.1 The prize was given for a contest whose topic was “To improve in an important point the theory of geodesic lines”.
    [Show full text]