The mod \(p\) rank of incidence matrices for connected uniform hypergraphs

DOI10.1006/eujc.1993.1021zbMath0780.05042OpenAlexW2017610263MaRDI QIDQ1260767

Johan Karlander, Anders Bjoerner

Publication date: 25 August 1993

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1993.1021

zbMATH Keywords

partitionincidence matrixuniform hypergraphmultisetpivot equivalence

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Codes from incidence matrices of graphs ⋮ On a modular domination game. ⋮ Saturated simplicial complexes ⋮ Generalized Hamming weights of projective Reed-Muller-type codes over graphs ⋮ Generalized multiplicities of edge ideals

This page was built for publication: The mod \(p\) rank of incidence matrices for connected uniform hypergraphs