[FRIAM] Morphogenisis

[uǝlƃ ↙↙↙]

I'm also wondering if there's a similar result for hypergraphs to the "parallelism theorem", which might state that any hypergraph can be perfectly "simulated" by an ordinary graph.

On 5/19/21 11:28 AM, uǝlƃ ↙↙↙ wrote:
> I can't help but wonder if the hypergraph is something like a *modal* graph, or perhaps a *slice* through a graph. EricS' suggestion of concurrency raises POSET flow. But if the edges and nodes are of different types, then a query like "select a graph with {edges of type E1}" project the thing (whatever it is) onto a (perhaps still hyper-)graph. A query like "select a graph with {nodes of type N1}" produces a similar projection. But a combined query like "select a graph with {e ∈ Ei} & {n ∈ Nj}" produces a graph.
> 
> On 5/9/21 12:58 PM, jon zingale wrote:
>> [1] And yes, I have many other questions there not applicable to this
>> thread as of yet. For instance, how is a hypergraph different than a
>> topology? Are hypergraphs also generalizations of topologies?
> 
> 

-- 
↙↙↙ uǝlƃ