  In this paper we consider aspects of geometric observability for hypergraphs,
extending our earlier work from the uniform to the nonuniform case.
Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple
nodes and unambiguously represent multi-way relationships which are ubiquitous
in many real-world networks including those that arise in biology. We consider
polynomial dynamical systems with linear outputs defined according to
hypergraph structure, and we propose methods to evaluate local, weak
observability.
