The number of negative entries in a sign pattern allowing orthogonality

DOI10.1007/S00373-004-0575-YMaRDI QIDQ704842zbMATH OpenOpenAlexFDO

Authors Yanling Shao, Yubin Gao

Publication date 20 January 2005

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-004-0575-y

zbMATH Keywords

\(\pm\) signorthogonal matrixqualitative classsign pattern

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57)

Review text

The authors show that the following result holds for all \(n\geq 3\). Among the \(n\times n\) real orthogonal matrices without zero entries, the number of negative entries can take any integer value in the interval \([n-1,n^2-n+1]\). Values outside that interval clearly cannot be achieved since they would require the matrix to have two columns in which all entries have the same sign, and such columns cannot be orthogonal.

Recommendations

• ± sign pattern matrices that allow orthogonality
• The number of negative entries in the square of a sign pattern matrix with nonpositive square
• Sign patterns occurring in orthogonal matrices
• Sign-nonsingular matrices and orthogonal sign-patterns
• Sign pattern matrices that allow orthogonality

Cited in

(5)

• The number of negative entries in the square of a sign pattern matrix with nonpositive square
• scientific article; zbMATH DE number 2185792 (Why is no real title available?)
• Sign patterns occurring in orthogonal matrices
• The possible numbers of zeros in a orthogonal matrix
• How many negative entries can A^ 2 have?

This page was built for publication: The number of negative entries in a sign pattern allowing orthogonality

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