Abstract
We consider a space of sparse Boolean matrices of size , which have finite co-rank over with high probability. In particular, the probability such a matrix has full rank, and is thus invertible, is a positive constant with value about for large . The matrices arise as the vertex-edge incidence matrix of 1-out 3-uniform hypergraphs The result that the null space is finite, can be contrasted with results for the usual models of sparse Boolean matrices, based on the vertex-edge incidence matrix of random -uniform hypergraphs. For this latter model, the expected co-rank is linear in the number of vertices , \cite{ACO}, \cite{CFP}. For fields of higher order, the co-rank is typically Poisson distributed.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.