Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors
Abstract
Let P(d) be the probability that a random 0/1-matrix of size d × d is singular, and let E(d) be the expected number of 0/1-vectors in the linear subspace spanned by d-1 random independent 0/1-vectors. (So E(d) is the expected number of cube vertices on a random affine hyperplane spanned by vertices of the cube.) We prove that bounds on P(d) are equivalent to bounds on E(d): \[ P(d) = (2-d E(d) + d22d+1) (1 + o(1)). \] We also report about computational experiments pertaining to these numbers.
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.