On Orthogonal Matrices with Zero Diagonal
From MaRDI portal
Publication:5230554
DOI10.13001/1081-3810.3918zbMath1418.15023arXiv1810.08961OpenAlexW2969799148MaRDI QIDQ5230554
Publication date: 28 August 2019
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.08961
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonal matrices (15B10)
Related Items (4)
Diagonal unitary and orthogonal symmetries in quantum theory: II. Evolution operators ⋮ Regular graphs of degree at most four that allow two distinct eigenvalues ⋮ Orthogonal realizations of random sign patterns and other applications of the SIPP ⋮ Sign patterns of orthogonal matrices and the strong inner product property
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum semidefinite rank of a triangle-free graph
- On skew-Hadamard matrices
- The minimum rank of symmetric matrices described by a graph: a survey
- Smith normal form and acyclic matrices
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Graphs of unitary matrices and positive semidefinite zero forcing
- Some \((1, -1)\) matrices
- Doubly regular tournaments are equivalent to skew Hadamard matrices
- A lower bound for the number of distinct eigenvalues of some real symmetric matrices
- The possible numbers of zeros in a orthogonal matrix
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- Matrix Algebra
- On Orthogonal Matrices
- Orthogonal Matrices with Zero Diagonal
- Orthogonal Matrices with Zero Diagonal. II
- A skew-Hadamard matrix of order 92
- Minimum number of distinct eigenvalues of graphs
- Equivalence classes of inverse orthogonal and unit Hadamard matrices
This page was built for publication: On Orthogonal Matrices with Zero Diagonal
