On random matrices with large corank
Abstract
Let 1 k n and M be a random n× n matrix with independent uniformly random \ 1\-entries. We show that there exists an absolute constant c > 0 such that \[P[rank(M) n-k] (-c nk).\]
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.