Normal forms for planar connected string diagrams

04/20/2018
by   Antonin Delpeuch, et al.
0

In the graphical calculus of planar string diagrams, equality is generated by the left and right exchange moves, which swaps the heights of adjacent vertices. We show that for connected diagrams the left- and right-handed exchanges each give strongly normalizing rewrite strategies. We show that these strategies terminate in O(n^3) steps where n is the number of vertices. We also give an algorithm to directly construct the normal form, and hence determine isotopy, in O(n · m) time, where m is the number of edges.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/16/2019

Nominal String Diagrams

We introduce nominal string diagrams as, string diagrams internal in the...
07/28/2021

Functorial String Diagrams for Reverse-Mode Automatic Differentiation

We enhance the calculus of string diagrams for monoidal categories with ...
02/27/2022

Enumeration of chordal planar graphs and maps

We determine the number of labelled chordal planar graphs with n vertice...
10/13/2021

Representing Matrices Using Algebraic ZX-calculus

Elementary matrices play an important role in linear algebra application...
05/19/2021

The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition

String diagrams are an increasingly popular algebraic language for the a...
04/15/2019

On the Lambek Calculus with an Exchange Modality

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic)...
02/19/2018

Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting

In implementing evaluation strategies of the lambda-calculus, both corre...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.