加载中…
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix (defined by inclusion of pairs in edges) for one natural class of hypergraphs: the triple systems with index three. Such systems with nonsingular (over the rationals) appear to be quite rare, yet they can be constructed with PBD closure. In fact, a range of ranks near is obtained for large orders .

生成讲解博客的中文版本

生成AI智能校验的中文版本