Introduces the strong inner product property to construct infinite families of sign patterns allowing row orthogonality and develops algorithmic verification techniques.
On orthogonal matrices with zero diagonal
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and that a symmetric $\mathrm{OMZD}(n)$ exists if and only if $n$ is even and $n\neq 4$. We also give a construction of $\mathrm{OMZD}(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.
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sign Patterns of Orthogonal Matrices and the Strong Inner Product Property
Introduces the strong inner product property to construct infinite families of sign patterns allowing row orthogonality and develops algorithmic verification techniques.