How sparse can a matrix with orthogonal rows be?

DOI10.1006/JCTA.1998.2898MaRDI QIDQ1279655zbMATH OpenOpenAlexFDO

Authors Gi-Sang Cheon, Bryan L. Shader

Publication date 11 August 1999

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcta.1998.2898

zbMATH Keywords

connected matrixFiedler's conjectureindecomposable matrixrow-orthogonalsparse matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Computational methods for sparse matrices (65F50)

Recommendations

• Sparsity of orthogonal matrices with restrictions
• A simple construction for the sparse matrices with orthogonal rows
• scientific article; zbMATH DE number 1300134

Cites work

• A simple proof of Fiedler's conjecture concerning orthogonal matrices
• scientific article; zbMATH DE number 510850 (Why is no real title available?)
• Sign pattern matrices that allow orthogonality

Cited in

(6)

• Sparse orthogonal matrices.
• Sparsity of orthogonal matrices with restrictions
• Sparse orthogonal matrices and the Haar wavelet
• A simple construction for the sparse matrices with orthogonal rows
• ± sign pattern matrices that allow orthogonality
• The possible numbers of zeros in a orthogonal matrix

This page was built for publication: How sparse can a matrix with orthogonal rows be?

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