Zero forcing and maximum nullity for hypergraphs (Q2185737)

The concept of zero forcing and of (maximum) nullity is well-known in the context of graphs. It is defined using the adjacency matrix of a graph, a very natural and well-known construction. The author generalizes these notions to (uniform) hypergraphs and uses hypercubical hypermatrices for this purpose -- a construction that generalizes adjacency matrices. After introducing zero forcing and maximum nullity for uniform hypergraphs, the author shows that the former is an upper bound for the latter. Further results compare these new concepts to the infection number of a hypergraph and the iteration process in hypergraph dominations.