REVIEW 2 cited by
Finite matrices are complete for (dagger-)hypergraph categories
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Hypergraph categories are symmetric monoidal categories where each object is equipped with a special commutative Frobenius algebra (SCFA). Dagger-hypergraph categories are the same, but with dagger-symmetric monoidal categories and dagger-SCFAs. In this paper, we show that finite matrices over a field K of characteristic 0 are complete for hypergraph categories, and that finite matrices where K has a non-trivial involution are complete for dagger-hypergraph categories.
Forward citations
Cited by 2 Pith papers
-
Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics
A sound and complete denotational, operational, and algebraic semantics for synchronous sequential circuits with arbitrary feedback, plus a hypergraph rewriting framework for digital circuits.
-
Double Categories of Open Systems: the Cospan Approach
Structured and decorated cospan double categories for open systems have an exoskeleton/outer shell structure, and every object in them is a special symmetric Frobenius pseudomonoid.
Discussion (0). Continue with ORCID to comment.