A SIMPLE CONSTRUCTION FOR THE SPARSE MATRICES WITH ORTHOGONAL ROWS

  • Published : 2000.10.01

Abstract

We contain a simple construction for the sparse n x n connected orthogonal matrices which have a row of p nonzero entries with 2$\leq$p$\leq$n. Moreover, we study the analogous sparsity problem for an m x n connected row-orthogonal matrices.

Keywords

References

  1. Combinatorial Orthogonality, in Combinatorial and Graph-Theoretical Problems in Linear Algebra L. B. Beasley;R. A. Brualdi;B. L. Shader;R. A. Brualdi(ed.);S. Friedland(ed.);B. Klee(ed.)
  2. J. of Combinatorial Theory Series A v.85 How spares can a matrix with orthogonal rows be? G. -S. Cheon;B. L. Shader
  3. Bull. of Korean Math. Soc v.39 no.1 Constructions fo the sparsest orthogonal matrices G. -S. Cheon;B. L. Shader
  4. Discrete Applied Mathematics v.101 Sparse orthogonal matrices and the Gear wavelet G. -S. Cheon;B. L. Shader
  5. Linear Algebra and Its Applications v.306 Spasity of orthogonal matrices with restrictions G. -S. Cheon;B. L. Shader
  6. Electronic J. of Linear Algebra v.5 The Possible numvers of zeros in an orthogonal matrix G. -S. Cheon;C. R. johnson;S.-G. Lee; E. J. Pribble
  7. J. of Korean Mth. Soc. v.36 no.2 Constructions for sparse row-orthogonal matrices with al full row G. -S. Cheon;S. -W. Park;H. -G. Seol
  8. Rocky Mtn. Math. J. v.27 A simple proof of Fiedler's conjecture concerning orthogonal matrices B. L. Shader