Skip to main content
7 of 10
added 8 characters in body
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Characterizing matrices with rank constraint

Given matrix $M\in\Bbb R^{n\times n}$, is there a nice method to characterize matrices $Q\in\Bbb R^{n\times n}$ such that $$\mathsf{rank}(M+Q)\leq s\cdot\mathsf{rank}(Q)$$with some fixed $s>0$?

What if $M\in\Bbb Z_{\geq0}^{n\times n}$ with highest entry $b$?

Turbo
  • 13.9k
  • 1
  • 27
  • 76