Rank bounds for design matrices with block entries and geometric applications
Rank bounds for design matrices with block entries and geometric applications, Discrete Analysis 2018:5, 24 pp. It is not hard to prove, when the statement is suitably formulated, that if $A$ is a random matrix, then it is not possible to reduce the rank of $A$ by changing only a few entries. Howev...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
|
| Series: | Discrete Analysis |
| Online Access: | http://discrete-analysis.scholasticahq.com/article/3118-rank-bounds-for-design-matrices-with-block-entries-and-geometric-applications.pdf |