Incidence Matrices of Subsets—A Rank Formula

DOI10.1137/0602037MaRDI QIDQ3964584zbMATH OpenOpenAlexFDO

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

(0,1)-matricesextremal set theory

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(16)

• 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
• Resilience of ranks of higher 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 fast algebraic immunity of threshold functions
• On the rank of higher inclusion matrices
• Cohomological Aspects of Hypergraphs
• Holographic algorithms: from art to science
• Signature theory in holographic algorithms
• A short proof of the rank formula for inclusion matrices
• A representation-theoretic computation of the rank of 1-intersection incidence matrices: 2-subsets vs. n -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)