Tangled Circuits
R. Rosebrugh, N. Sabadini, R.F.C. Walters
TL;DR
This paper explores the application of commutative Frobenius algebras within braided monoidal categories to model and analyze tangled circuit systems in computer science, highlighting both algebraic and geometric perspectives.
Contribution
It introduces a novel algebraic framework for tangled circuits using commutative Frobenius algebras in braided categories, connecting algebraic structures with geometric insights.
Findings
A new algebraic approach to tangled circuits
Potential geometric interpretations of Frobenius algebras
Framework applicable to various systems in computer science
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Homotopy and Cohomology in Algebraic Topology