A Category of Surface-Embedded Graphs

DOI10.4204/EPTCS.380.3arXiv2210.08914MaRDI QIDQ6150141FDOQ6150141

Author name not available (Why is that?), Ross Duncan

Publication date: 5 March 2024

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

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.

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

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The geometry of tensor calculus. I
• A Survey of Graphical Languages for Monoidal Categories
• Topological graph theory.
• Coherence for compact closed categories
• Rewriting modulo symmetric monoidal structure
• Graphical reasoning in compact closed categories for quantum computation
• Fundamentals of algebraic graph transformation
• Adhesive and quasiadhesive categories
• Open-graphs and monoidal theories
• Confluence of Graph Rewriting with Interfaces
• Equational Reasoning with Context-Free Families of String Diagrams

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)