Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
From MaRDI portal
Publication:3679329
DOI10.1080/03081088508817666zbMath0565.15007OpenAlexW2084023622MaRDI QIDQ3679329
Publication date: 1985
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081088508817666
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Algebraic systems of matrices (15A30) Matrices of integers (15B36)
Related Items (4)
On algebras of Toeplitz plus Hankel matrices ⋮ Structure of algebras of commutative matrices ⋮ \(h\)-space structure in matrix displacement formulas ⋮ Closure, commutativity and minimal complexity of some spaces of matrices
Cites Work
- Spectral and computational properties of band symmetric Toeplitz matrices
- On the group matrices for a generalized dihedral group
- On the algorithmic complexity of associative algebras
- On some theorems on circulant matrices
- Permutation-matrix groups with positive sum
- On some sets of permutation matrices
- Simultaneous quasi-diagonalization of normal matrices
- Optimum computation of p bilinear forms
- Some elementary proofs of lower bounds in complexity theory
- On the optimal evaluation of a set of bilinear forms
- Simultaneous block triangularization and block diagonalization of sets of matrices
- On the optimal computation of a set of symmetric and persymmetric bilinear forms
- On some properties of circulant matrices
- Determinants of integral group matrices for some nonabelian 2-generator groups
- Algebras Having Linear Multiplicative Complexities
- Tensor Rank and Border Rank of Band Toeplitz Matrices
This page was built for publication: Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
