Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors
Thomas Voigt, Günter M. Ziegler
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.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan