Fast algorithms for identification and comparison of braids.

DOI10.1023/B:JOTH.0000008747.72654.14zbMath1070.20044OpenAlexW1970197649MaRDI QIDQ1781292

Niranjan Chakravarthy

Publication date: 23 June 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joth.0000008747.72654.14

zbMATH Keywords

fast algorithmsnormal formsmapping class groupsfinite orderscomparison algorithmsDehornoy orders on braid groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Braid groups; Artin groups (20F36) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Comparison of PL-structures: classification, Hauptvermutung (57Q25)

Related Items (3)

Dehornoy’s ordering on the braid group and braid moves ⋮ The braided Ptolemy-Thompson group is finitely presented. ⋮ Twist number of (closed) braids

This page was built for publication: Fast algorithms for identification and comparison of braids.