Graphoid Automata, Frobenius PROPs, and Semiring Evaluation

@misc{kalampakas2026graphoid,
  title = {{Graphoid Automata, Frobenius PROPs, and Semiring Evaluation}},
  author = {Antonios Kalampakas},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03897},
  eprint = {2610.03897},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03897},
}

TY  - UNPB
TI  - Graphoid Automata, Frobenius PROPs, and Semiring Evaluation
AU  - Antonios Kalampakas
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03897
UR  - https://arxiv.org/abs/2610.03897
AB  - Graphoid automata evaluate graphs by composing relations between words of states. We examine the equations that make this evaluation independent of the chosen graph expression, and what changes when relations are replaced by matrices over a commutative semiring. We prove that the classical graphoid equations are equivalent to the special commutative Frobenius equations together with the required symmetry laws. The known cospan and hypergraph presentations then describe equality of structural and labelled expressions, with the bone law deleting precisely the isolated internal vertices. We use established partition representations to compare this equality with equality of evaluated matrices. For any nonempty finite state set Q and commutative semiring K, we give a uniform criterion for two structural expressions to have the same matrix. The criterion determines which isolated-vertex counts are distinguished and when a vanishing scalar makes matrices from different boundary partitions equal. For the canonical structure, the bone law holds precisely when |Q|·1_K=1_K. Preserving all relational compositions is a separate requirement, equivalent to additive idempotency for |Q|≥2. We then examine the characteristic matrices of the known relational structures on Q given by disjoint unions of Abelian groups. Their Frobenius equations hold over every commutative semiring, whereas specialness depends on the order of each group and the bone law depends on the number of groups. These conditions specify which equations remain valid when weights are assigned to a graphoid automaton.
ER  -