The binary rank of circulant block matrices
From MaRDI portal
Publication:2093516
DOI10.1016/j.laa.2022.10.006OpenAlexW4302362802MaRDI QIDQ2093516
Publication date: 8 November 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.08942
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boolean and Hadamard matrices (15B34) Special matrices (15B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum rank of regular classes of matrices of zeros and ones
- The geometry of an interchange: Minimal matrices and circulants
- Combinatorial equivalence of (0,1) circulant matrices
- The Rank of Circulant Matrices
- Minimal NFA Problems are Hard
- Communication Complexity
- On the Addressing Problem for Loop Switching
This page was built for publication: The binary rank of circulant block matrices