On complexity of the word problem in braid groups and mapping class groups

DOI10.1016/S0166-8641(99)00063-2zbMath0967.20019arXivmath/9809154MaRDI QIDQ1578891

Hessam Hamidi-Tehrani

Publication date: 16 July 2001

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9809154

zbMATH Keywords

braid groups; mapping class groups; word problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

20F36: Braid groups; Artin groups

57M05: Fundamental group, presentations, free differential calculus

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

Two-generator subgroups of the pure braid group., Simple realizability of complete abstract topological graphs in P, A new algorithm for solving the word problem in braid groups, Testing graph isotopy on surfaces