LU Factorization of Discrete Random Matrices
arXiv:2608.08998
Abstract
We consider the probability that a discrete random matrix is \emph{strongly non-singular}, meaning all its leading principal submatrices are non-singular. This property is equivalent to the existence of an LU factorization. We show that for any discrete random variable with finite support and , there is a constant probability that is strongly non-singular with a growth factor bounded by . Furthermore, we provide a tight asymptotic lower bound for this probability as . Finally, we provide exact counts for strongly non-singular binary matrices up to and use these to derive improved upper bounds for the Bernoulli case.