Menu

Talk: The Art of Braiding Algorithms

This talk was given at the Relatorium online seminar on July 10th 2026. Many thanks to our host, Irfan Alam for inviting us. It was a rehearsal for our upcoming presentation upcoming presentation at Bridges.

The slides are available here: relatorium-slides.pdf.

During the question period, I made reference to a paper by Joan Birman. Birman and Menasco’s Theorem 1 addresses, at the highest level of generality possible, the question: “What moves do you need to generate all possible string figures?”

Joan S. Birman and William W. Menasco (1992) Studying links via closed braids. V. The unlink Trans. Amer. Math. Soc. 329 (1992), 585-606 DOI: https://doi.org/10.1090/S0002-9947-1992-1030509-1


Published: Jul 10, 2026 @ 14:47.
Last Modified: Jul 10, 2026 @ 15:52.

Tags

#talk #braids #loop braids #string figures

Backlinks

Navigation Menu

Home / Now / Archive / Office Camera / Bookmarks / Tags / Feeds / Top of Page

Thanks for reading! If you have any comments or questions about the content, please let me know. Anyone can contact me by email.