arXiv · math/9809154
On Complexity of the Word Problem in Braid Groups and Mapping Class Groups
Abstract
We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w|^2 g^2). We also carry out the same methods for the braid groups, and show that this gives a bound which improves the best known bound in this case; namely, the complexity of the word problem in the n-braid group is O(|w|^2 n), for |w| > log n. We state a similar result for mapping class groups of surfaces with several punctures.
Explore related subjects
Keep this discovery
Hessam Hamidi-Tehrani. 1998-09-28. On Complexity of the Word Problem in Braid Groups and Mapping Class Groups. https://arxiv.org/abs/math/9809154
Cite the original work for its findings. Save a collection to share your selection of sources.