Braids in trivial braid diagrams
classification
🧮 math.GT
keywords
braidbraidseverytrivialalgebraicargumentartin--titscayley
read the original abstract
We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin--Tits group of dihedral type, but it fails to extend to braids with 4 strands and more. The proof uses a partition of the Cayley graph and a continuity argument.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.