2000 character limit reached
Rank deficiency of random matrices
Published 3 Mar 2021 in math.PR and math.CO | (2103.02467v1)
Abstract: Let be a random matrix with i.i.d. entries. We show that for fixed , [\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.]
Paper Prompts
Sign up for free to create and run prompts on this paper.