Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rank deficiency of random matrices

Published 3 Mar 2021 in math.PR and math.CO | (2103.02467v1)

Abstract: Let MnM_n be a random n×nn\times n matrix with i.i.d. Bernoulli(1/2)\text{Bernoulli}(1/2) entries. We show that for fixed k≥1k\ge 1, [\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.]

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.