pith. sign in

arxiv: 2112.14090 · v2 · pith:GQIFF7BPnew · submitted 2021-12-28 · 🧮 math.CO · cs.DM· math.PR

The full rank condition for sparse random matrices

classification 🧮 math.CO cs.DMmath.PR
keywords conditionmatricesentriesfullnon-zerorandomranksparse
0
0 comments X
read the original abstract

We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and $\{0,1\}$-matrices over the rationals. The sufficient condition is generally necessary as well.

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.