On the singularity of random combinatorial matrices
Abstract
It is shown that a random (0,1) matrix whose rows are independent random vectors of exactly n/2 zero components is non-singular with probability 1-O(n-C) for any C>0. The proof uses a non-standard inverse-type Littlewood-Offord result.
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.