Singularity of random combinatorial matrices

Abstract: 

Let QnQn be a random nn by nn matrix with entries in {0,1}{0,1} whose rows are independent vectors of exactly n/2n/2 zero components. We show that the probability that QnQn is singular is exponentially small, which is optimal up to a multiplicative factor in the exponent. We develop a general method to handle random matrices with dependent entries.

This is a seminar of the Combinatorial Mathematics Society of Australasia. To attend email cmsa-webinar@monash.edu with the subject 'subscribe' to receive zoom details. [You only need to subscribe once, not for future talks.]