
Nominal String Diagrams
We introduce nominal string diagrams as, string diagrams internal in the...
read it

Drawing Graphs with Circular Arcs and RightAngle Crossings
In a RAC drawing of a graph, vertices are represented by points in the p...
read it

Completeness of Nominal PROPs
We introduce nominal string diagrams as string diagrams internal in the ...
read it

On the Lambek Calculus with an Exchange Modality
In this paper we introduce Commutative/NonCommutative Logic (CNC logic)...
read it

ConvexityIncreasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given an...
read it

Computing Chebyshev knot diagrams
A Chebyshev curve C(a,b,c,ϕ) has a parametrization of the form x(t)=T_a(...
read it

Right and left, partisanship predicts vulnerability to misinformation
We analyze the relationship between partisanship, echo chambers, and vul...
read it
Normal forms for planar connected string diagrams
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 righthanded 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
Comments
There are no comments yet.