AbstractHigher incidence matrices have proved an important tool both in design theory and extremal set theory. In the present paper some tight bounds on the rank over finite fields of some inclusion matrices are derived. In particular, a short proof of Wilson's mod p rank formula is given. A problem of Graham, Li, and Li concerning bases for so-called null t-designs is solved as well
AbstractGiven integers t, k, and v such that 0⩽t⩽k⩽v, let Wtk(v) be the inclusion matrix of t-subset...
We describe a lower bound for the rank of any real matrix in which all diagonal entries are signific...
AbstractA partial matrix over a field F is a matrix whose entries are either elements of F or indepe...
AbstractIn the paper “On the p-Rank of Incidence Matrices and a Question of E. S. Lander” (A. A. Bru...
Let A be the incidence matrix of a block design constructed from a relative difference set. Let rp b...
We study the rank of complex sparse matrices in which the supports of different columns have small i...
An entry pattern matrix (EPM for short) is a rectangular matrix in which each entry is an indetermin...
An entry pattern matrix (EPM for short) is a rectangular matrix in which each entry is an indetermin...
AbstractA formula is given for the rank in characteristic p (p = 0 or p is a prime) of the incidence...
Let S be an Sλ(t, t+1, v) with v>t+ 1 and let Rkp(S) be the rank over GF(p) of an incidence matrix o...
AbstractWe survey recent results on difference sets, p-ranks and Smith normal forms of certain set-i...
A set system is L-intersecting if any pairwise intersection size lies in L, where L is some set of s...
Abstract. Let r ≥ s ≥ 0 be integers and G be an r-graph. The higher inclusion matrix Mrs (G) is a {0...
Let S be an Sλ(t, t+1, v) with v>t+ 1 and let Rkp(S) be the rank over GF(p) of an incidence matrix o...
Rank bounds for design matrices with block entries and geometric applications, Discrete Analysis 201...
AbstractGiven integers t, k, and v such that 0⩽t⩽k⩽v, let Wtk(v) be the inclusion matrix of t-subset...
We describe a lower bound for the rank of any real matrix in which all diagonal entries are signific...
AbstractA partial matrix over a field F is a matrix whose entries are either elements of F or indepe...
AbstractIn the paper “On the p-Rank of Incidence Matrices and a Question of E. S. Lander” (A. A. Bru...
Let A be the incidence matrix of a block design constructed from a relative difference set. Let rp b...
We study the rank of complex sparse matrices in which the supports of different columns have small i...
An entry pattern matrix (EPM for short) is a rectangular matrix in which each entry is an indetermin...
An entry pattern matrix (EPM for short) is a rectangular matrix in which each entry is an indetermin...
AbstractA formula is given for the rank in characteristic p (p = 0 or p is a prime) of the incidence...
Let S be an Sλ(t, t+1, v) with v>t+ 1 and let Rkp(S) be the rank over GF(p) of an incidence matrix o...
AbstractWe survey recent results on difference sets, p-ranks and Smith normal forms of certain set-i...
A set system is L-intersecting if any pairwise intersection size lies in L, where L is some set of s...
Abstract. Let r ≥ s ≥ 0 be integers and G be an r-graph. The higher inclusion matrix Mrs (G) is a {0...
Let S be an Sλ(t, t+1, v) with v>t+ 1 and let Rkp(S) be the rank over GF(p) of an incidence matrix o...
Rank bounds for design matrices with block entries and geometric applications, Discrete Analysis 201...
AbstractGiven integers t, k, and v such that 0⩽t⩽k⩽v, let Wtk(v) be the inclusion matrix of t-subset...
We describe a lower bound for the rank of any real matrix in which all diagonal entries are signific...
AbstractA partial matrix over a field F is a matrix whose entries are either elements of F or indepe...
DOI
Add to ORKG