Tangled circuits

MaRDI QIDQ2847342zbMATHFDO

Authors Robert Rosebrugh, N. Sabadini, R. F. C. Walters

Publication date 4 September 2013

Published in Theory and Applications of Categories (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.0715

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Frobenius algebrasbraided monoidal categoryknot groupscircuit diagramknot colourings

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Abstract: The theme of the paper is the use of commutative Frobenius algebras in braided strict monoidal categories in the study of varieties of circuits and communicating systems which occur in Computer Science, including circuits in which the wires are tangled. We indicate also some possible novel geometric interest in such algebras.

Recommendations

• Coherence theorems via knot theory
• Computing with colored tangles
• Category theoretic representations of knotted graphs in \(S^ 3\)
• Circuit algebras are wheeled props
• Braided compact closed categories with applications to low dimensional topology

Cited in

(8)

• Circuit algebras are wheeled props
• Computing with colored tangles
• Blocked-braid groups
• scientific article; zbMATH DE number 6140066 (Why is no real title available?)
• On the geometry and algebra of networks with state
• Clutters and circuits
• Clutters and circuits. III
• Simple circuits are not that simple

This page was built for publication: Tangled circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847342)