Papers
Topics
Authors
Recent
Search
2000 character limit reached

The full rank condition for sparse random matrices

Published 28 Dec 2021 in math.CO, cs.DM, and math.PR | (2112.14090v2)

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.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.