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
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.