arXiv Analytics

Sign in

arXiv:math/0308050 [math.CO]AbstractReferencesReviewsResources

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

Thomas Voigt, Günter M. Ziegler

Published 2003-08-06, updated 2008-12-17Version 3

Let $P(d)$ be the probability that a random 0/1-matrix of size $d \times 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) + \frac{d^2}{2^{d+1}}) (1 + o(1)). \] We also report about computational experiments pertaining to these numbers.

Comments: 9 pages
Journal: Combinatorics, Probability & Computing, 15:463-471, 2006
Categories: math.CO, math.MG
Subjects: 15A52, 05B20, 05D40
Related articles: Most relevant | Search more
arXiv:1708.06790 [math.CO] (Published 2017-08-22)
Matroids with no $U_{2,n}$-minor and many hyperplanes
arXiv:2004.00938 [math.CO] (Published 2020-04-02)
Maximizing the expected number of components in an online search of a graph
arXiv:2212.03328 [math.CO] (Published 2022-12-06)
Slicing all Edges of an $n$-cube Requires $n^{2/3}$ Hyperplanes