English

Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors

Combinatorics 2008-12-17 v3 Metric Geometry

Abstract

Let P(d)P(d) be the probability that a random 0/1-matrix of size d×dd \times d is singular, and let E(d)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)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)P(d) are equivalent to bounds on E(d)E(d): P(d)=(2dE(d)+d22d+1)(1+o(1)). P(d) = (2^{-d} E(d) + \frac{d^2}{2^{d+1}}) (1 + o(1)). We also report about computational experiments pertaining to these numbers.

Keywords

Cite

@article{arxiv.math/0308050,
  title  = {Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors},
  author = {Thomas Voigt and Günter M. Ziegler},
  journal= {arXiv preprint arXiv:math/0308050},
  year   = {2008}
}

Comments

9 pages

R2 v1 2026-07-22T16:56:48.943Z