Timeline for What is the proper name for this "tersest path" problem in Infinite Craft?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6 at 8:56 | comment | added | statusfailed | Ah, I'm assuming strictness which is required for the correspondence to the kind of hypergraphs I described. But I guess you also want commutativity of objects, so that $\mathsf{Earth} \otimes \mathsf{Water} \cong \mathsf{Water} \otimes \mathsf{Earth}$. I'm pretty sure this is still just a special case of strict SMCs though. | |
| Mar 5 at 20:57 | comment | added | Steven Stadnicki | Unless I'm missing something (likely!), I feel like symmetric monoidal categories don't really apply here because there's no guarantee of associativity, so it seems like $\mathsf{Earth}\otimes\mathsf{Wind}\otimes\mathsf{Water}$, for instance, isn't well-defined because you have no guarantee that there's an isomorphism between $(\mathsf{Earth}\otimes\mathsf{Wind})\otimes\mathsf{Water}$ and $\mathsf{Earth}\otimes(\mathsf{Wind}\otimes\mathsf{Water})$. | |
| Mar 5 at 12:04 | history | answered | statusfailed | CC BY-SA 4.0 |