A note on the ranks of set-inclusion matrices
The electronic journal of combinatorics, Tome 8 (2001) no. 1
A recurrence relation is derived for the rank (over most fields) of the set-inclusion matrices on a finite ground set.
DOI :
10.37236/1590
Classification :
15A03, 15B33
Mots-clés : recurrence relation, rank, set-inclusion matrices, finite ground set
Mots-clés : recurrence relation, rank, set-inclusion matrices, finite ground set
@article{10_37236_1590,
author = {D. de Caen},
title = {A note on the ranks of set-inclusion matrices},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {1},
doi = {10.37236/1590},
zbl = {0976.15003},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1590/}
}
D. de Caen. A note on the ranks of set-inclusion matrices. The electronic journal of combinatorics, Tome 8 (2001) no. 1. doi: 10.37236/1590
Cité par Sources :