Mathematically, a hypergraph map is a map between vertices and a compatible (functorial) map between edges that respects symmetry type and order.
We should encode hypergraph maps in some efficient way given our current encoding of hypergraphs in WL with lists and symmetry types. The obvious choice is a pair of WL Associations, one for vertices and the other for edges, somehow keeping track of the symmetry types and order.
These maps in WL should be composable so we have an explicit WL instance of hypergraph map composition and we can use it for some symbolic categorical computations down the line.
Mathematically, a hypergraph map is a map between vertices and a compatible (functorial) map between edges that respects symmetry type and order.
We should encode hypergraph maps in some efficient way given our current encoding of hypergraphs in WL with lists and symmetry types. The obvious choice is a pair of WL Associations, one for vertices and the other for edges, somehow keeping track of the symmetry types and order.
These maps in WL should be composable so we have an explicit WL instance of hypergraph map composition and we can use it for some symbolic categorical computations down the line.