Braids via term rewriting
Theoretical Computer Science , Volume 777 p. 260- 295
We present a brief introduction to braids, in particular simple positive braids, with a double emphasis: first, we focus on term rewriting techniques, in particular, reduction diagrams and decreasing diagrams. The second focus is our employment of the colored braid notation next to the more familiar Artin notation. Whereas the latter is a relative, position dependent, notation, the former is an absolute notation that seems more suitable for term rewriting techniques such as symbol tracing. Artin's equations translate in this notation to simple word inversions. With these points of departure we treat several basic properties of positive braids, in particular related to the word problem, confluence property, projection equivalence, and the congruence property. In our introduction the beautiful diamond known as the permutohedron plays a decisive role.
|, , ,|
|Theoretical Computer Science|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Endrullis, J, & Klop, J.W. (2018). Braids via term rewriting. Theoretical Computer Science, 777, 260–295. doi:10.1016/j.tcs.2018.12.006