On orthogonal matrices with zero diagonal

DOI10.13001/1081-3810.3918MaRDI QIDQ5230554zbMATHOpenAlexFDO

Authors Robert F. Bailey, Robert Craigen

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

orthogonal matrixdistinct eigenvalueszero diagonalorthogonal pattern

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal matrices (15B10)

Abstract: We consider real orthogonal $nimesn$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $mathrmOMZD(n)$. We show that there exists an $mathrmOMZD(n)$ if and only if $neq1,3$, and that a symmetric $mathrmOMZD(n)$ exists if and only if $n$ is even and $neq4$. We also give a construction of $mathrmOMZD(n)$ obtained from doubly regular tournaments. Finally, we apply our results to determine the minimum number of distinct eigenvalues of matrices associated with some families of graphs, and consider the related notion of orthogonal matrices with partially-zero diagonal.

Recommendations

• Rational orthogonal versus real orthogonal
• Row and column orthogonal (0,1)-matrices
• Eigenvalues of a class of \((0,\pm{} 1)\) symmetric matrices
• The possible numbers of zeros in a orthogonal matrix
• Minimum rank with zero diagonal

Cites work

• scientific article; zbMATH DE number 510850 (Why is no real title available?)
• A lower bound for the number of distinct eigenvalues of some real symmetric matrices
• A skew-Hadamard matrix of order 92
• Combinatorics of symmetric designs
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• Equivalence classes of inverse orthogonal and unit Hadamard 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
• Matrix algebra. Theory, computations and applications in statistics
• Minimum number of distinct eigenvalues of graphs
• On Orthogonal Matrices
• On skew-Hadamard matrices
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Orthogonal Matrices with Zero Diagonal
• Orthogonal Matrices with Zero Diagonal. II
• Smith normal form and acyclic matrices
• Some \((1, -1)\) matrices
• The CRC handbook of combinatorial designs
• The minimum rank of symmetric matrices described by a graph: a survey
• The minimum semidefinite rank of a triangle-free graph
• The possible numbers of zeros in a orthogonal matrix

Cited in

(11)

• Row and column orthogonal (0,1)-matrices
• Diagonal unitary and orthogonal symmetries in quantum theory. II: Evolution operators
• Sign patterns of orthogonal matrices and the strong inner product property
• Zero-diagonality as a linear structure
• Orthogonal realizations of random sign patterns and other applications of the SIPP
• Column orthogonal (0,1,-1)-matrices
• Circulant matrices with orthogonal rows and off-diagonal entries of absolute value 1
• Rational orthogonal versus real orthogonal
• scientific article; zbMATH DE number 2206853 (Why is no real title available?)
• Regular graphs of degree at most four that allow two distinct eigenvalues
• On Zero Determinant Matrices that are Full

This page was built for publication: On orthogonal matrices with zero diagonal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230554)