A Category of Surface-Embedded Graphs

DOI10.4204/EPTCS.380.3MaRDI QIDQ6150141zbMATH OpenFDO

Authors Ross Duncan

Publication date 5 March 2024

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer science (68-XX)

Abstract: We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a new formulation of double pushout rewriting on graphs which explicitly records the boundary of the rewrite. Using this boundary structure we can augment these graphs with a rotation system, allowing the surface topology to be incorporated.

Recommendations

• Pattern graph rewrite systems
• scientific article; zbMATH DE number 517053
• Rewriting for monoidal closed categories
• Rewriting with Frobenius
• Open-graphs and monoidal theories

Cites work

• scientific article; zbMATH DE number 7559366 (Why is no real title available?)
• A survey of graphical languages for monoidal categories
• Adhesive and quasiadhesive categories
• Coherence for compact closed categories
• Confluence of graph rewriting with interfaces
• Equational reasoning with context-free families of string diagrams
• Fundamentals of algebraic graph transformation
• Graphical reasoning in compact closed categories for quantum computation
• Open graphs and computational reasoning
• Open-graphs and monoidal theories
• Rewriting modulo symmetric monoidal structure
• The geometry of tensor calculus. I
• Topological graph theory.

This page was built for publication: A Category of Surface-Embedded Graphs

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