Incidence Matrices of Subsets—A Rank Formula

DOI10.1137/0602037zbMath0499.05017MaRDI QIDQ3964584

Nathan Linial, Bruce L. Rothschild

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602037

zbMATH Keywords

extremal set theory; (0,1)-matrices

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

05A05: Permutations, words, matrices

15B33: Matrices over special rings (quaternions, finite fields, etc.)

05B35: Combinatorial aspects of matroids and geometric lattices

94B25: Combinatorial codes

Related Items

Holographic algorithms: from art to science, Signature theory in holographic algorithms, Intersection patterns of convex sets, Rank of inclusion matrices and modular representation theory, The \(k\)-orbit reconstruction and the orbit algebra, Kernels of modular inclusion maps, Moore-Penrose inverse of set inclusion matrices, Some properties of a higher-order coboundary operator, Intersection theorems and mod \(p\) rank of inclusion matrices, A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets, On the rank of higher inclusion matrices, Cohomological Aspects of Hypergraphs

Cites Work

• On theory and applications of BIB designs with repeated blocks
• On the Structure oft-Designs