The number of negative entries in a sign pattern allowing orthogonality (Q704842)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2130302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of negative entries in a sign pattern allowing orthogonality |
scientific article; zbMATH DE number 2130302 |
Statements
The number of negative entries in a sign pattern allowing orthogonality (English)
0 references
20 January 2005
0 references
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.
0 references
sign pattern
0 references
\(\pm\) sign
0 references
qualitative class
0 references
orthogonal matrix
0 references
0.8189743161201477
0 references
0.784402072429657
0 references
0.7822445631027222
0 references
0.7822445631027222
0 references
0.7671707272529602
0 references
