On orthogonal matrices with zero diagonal

DOI10.13001/1081-3810.3918zbMATH Open1418.15023arXiv1810.08961OpenAlexW2969799148MaRDI QIDQ5230554FDOQ5230554

Authors: Robert F. Bailey, Robert Craigen 

Publication date: 28 August 2019

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1810.08961

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

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

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)

Cites Work

• The CRC handbook of combinatorial designs
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Orthogonal Matrices with Zero Diagonal
• Minimum number of distinct eigenvalues of graphs
• On Orthogonal Matrices
• The minimum rank of symmetric matrices described by a graph: a survey
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• On skew-Hadamard matrices
• Combinatorics of symmetric designs
• Smith normal form and acyclic matrices
• Equivalence classes of inverse orthogonal and unit Hadamard matrices
• The minimum semidefinite rank of a triangle-free graph
• The possible numbers of zeros in a orthogonal matrix
• Title not available (Why is that?)
• Orthogonal Matrices with Zero Diagonal. II
• A skew-Hadamard matrix of order 92
• Some \((1, -1)\) matrices
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• A lower bound for the number of distinct eigenvalues of some real symmetric matrices
• Matrix algebra. Theory, computations and applications in statistics
• Graphs of unitary matrices and positive semidefinite zero forcing

Cited In (11)

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

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)