Skip to main content
Log in

The Number of Negative Entries in a Sign Pattern Allowing Orthogonality

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

A ± sign pattern is a matrix whose entries are in the set {+,−}. An n×n ± sign pattern A allows orthogonality if there exists a real orthogonal matrix B in the qualitative class of A. In this paper, we prove that for n≥3 there is an n×n ± sign pattern A allowing orthogonality with exactly k negative entries if and only if n−1≤kn2n+1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yubin Gao.

Additional information

Research supported by Shanxi Natural Science Foundation 20011006, 20041010

Final version received: October 22, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, Y., Shao, Y. The Number of Negative Entries in a Sign Pattern Allowing Orthogonality. Graphs and Combinatorics 20, 311–317 (2004). https://doi.org/10.1007/s00373-004-0575-y

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-004-0575-y

Key words

Navigation