Incidence Matrices of Subsets—A Rank Formula

DOI10.1137/0602037MaRDI QIDQ3964584zbMATHOpenAlexFDO

Authors Nathan Linial, Bruce 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

Permutations, words, matrices (05A05) Combinatorial aspects of block designs (05B05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial codes (94B25)

Cites work

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

Cited in

(15)

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

This page was built for publication: Incidence Matrices of Subsets—A Rank Formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964584)