How sparse can a matrix with orthogonal rows be?

DOI10.1006/jcta.1998.2898zbMath0917.05014OpenAlexW2035494699MaRDI QIDQ1279655

Bryan L. Shader, Gi-Sang Cheon

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

sparse matrixindecomposable matrixFiedler's conjectureconnected matrixrow-orthogonal

Mathematics Subject Classification ID

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

Related Items (4)

Sparse orthogonal matrices. ⋮ Sparsity of orthogonal matrices with restrictions ⋮ Sparse orthogonal matrices and the Haar wavelet ⋮ ± sign pattern matrices that allow orthogonality

Cites Work

• Unnamed Item
• A simple proof of Fiedler's conjecture concerning orthogonal matrices
• Sign pattern matrices that allow orthogonality

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