Abstract
We investigate the three-strand positive braid monoid. We propose a syntactical linear time algorithm for the word problem, a nearly canonical rewriting system and the computation of the growth function.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
