On the singularity of random combinatorial matrices
classification
🧮 math.CO
keywords
randomcombinatorialcomponentsexactlyindependentinverse-typelittlewood-offordmatrices
read the original abstract
It is shown that a random $(0,1)$ matrix whose rows are independent random vectors of exactly $n/2$ zero components is non-singular with probability $1-O(n^{-C})$ for any $C>0$. The proof uses a non-standard inverse-type Littlewood-Offord result.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.