Orthogonal realizations of random sign patterns and other applications of the SIPP

Main Article Content

Zachary Brennan
https://orcid.org/0000-0001-5704-2285
Christopher Cox
https://orcid.org/0000-0001-6327-578X
Bryan Curtis
https://orcid.org/0000-0003-4784-7172
Enrique Gomez-Leos
https://orcid.org/0000-0002-0064-0193
Kimberly Hadaway
https://orcid.org/0000-0002-5545-323X
Leslie Hogben
https://orcid.org/0000-0003-1673-3789
Conor Thompson
https://orcid.org/0000-0002-8727-7998

Abstract

A sign pattern is an array with entries in $\{+,-,0\}$. A real matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A. Curtis and B.L. Shader, Sign patterns of orthogonal matrices and the strong inner product property, Linear Algebra Appl. 592: 228-259, 2020], is an important tool when determining whether a sign pattern allows row orthogonality because it guarantees there is a nearby matrix with the same property, allowing zero entries to be perturbed to nonzero entries, while preserving the sign of every nonzero entry. This paper uses the SIPP to initiate the study of conditions under which random sign patterns allow row orthogonality with high probability. Building on prior work, $5\times n$ nowhere zero sign patterns that minimally allow orthogonality are determined. Conditions on zero entries in a sign pattern are established that guarantee any row orthogonal matrix with such a sign pattern has the SIPP.

Article Details

Section
Article