User Tools

Site Tools


Lucas Rusnak (Binghamton)

Multi-Directed Hypergraph Representations of {0,+1,−1}-Matrices

Abstract for the Combinatorics Seminar 2009 January 30

A multi-directed hypergraph is a combinatorial representation of {0,+1,−1}-matrices that extends the concepts of signed graphs to hypergraphic analogs. The column dependencies of a {0,+1,−1}-matrix can be classified using multi-directed hypergraphs. The classification of column dependencies of matrices corresponding to multi-directed hypergraphs whose edge size is two or less is already known. I will discuss the basic structure of multi-directed hypergraphs and the classification of the column dependencies of any {0,+1,−1}-matrix.

seminars/comb/abstract.200901rus.txt · Last modified: 2020/01/29 14:03 (external edit)