Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
100 views

On a random matrix construction

Given a symmetric matrix $M\in\Bbb Z^{n\times n}$ or rank $r$ with absolute value of any entry bound by $2^{b^2-1}-1$ and maximum eigenvalue at most $\lambda$. We consider the set $\mathcal T_b$ of $\...
Turbo's user avatar
  • 13.9k
1 vote
2 answers
478 views

Worst case difference in rank by column-row swapping

Given a matrix $m\in\{-1,+1\}^{n\times n}$. Consider $m^\sigma$ to be collection of all matrices obtained from $m$ by permuting rows and columns. Consider $\mathscr{M}[m^\sigma]$ to be collection of ...
Turbo's user avatar
  • 13.9k
1 vote
1 answer
220 views

Probabilistic statement on matrix ranks

Given $A\in\{0,1\}^{n\times n}$ with $\operatorname{rank}(A)=r=2^{O((\log_2n)^{\frac{1}{c+1}})}$. Denote $\mathsf{1_n}\in\{0,1\}^n$ as vector with $1$s. Does $$\lim_{n\rightarrow\infty}\mathsf{P_{A\...
Turbo's user avatar
  • 13.9k