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

DOI10.1016/S0166-8641(99)00063-2zbMath0967.20019arXivmath/9809154OpenAlexW2000638036MaRDI 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 groupsmapping class groupsword problems

Mathematics Subject Classification ID

Related Items (4)

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

This page was built for publication: On complexity of the word problem in braid groups and mapping class groups