Rank of the vertex-edge incidence matrix of rr-out hypergraphs

preprint2022arXivOpen access

Abstract

We consider a space of sparse Boolean matrices of size n×nn \times n, which have finite co-rank over GF(2)GF(2) with high probability. In particular, the probability such a matrix has full rank, and is thus invertible, is a positive constant with value about 0.25740.2574 for large nn. 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 kk-uniform hypergraphs. For this latter model, the expected co-rank is linear in the number of vertices nn, \cite{ACO}, \cite{CFP}. For fields of higher order, the co-rank is typically Poisson distributed.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.