Abstract
ABSTRACT V. B. Styshnev showed in [9] that the existence of n -th roots for a braid is decidable. Garside groups have been introduced in [2] and [3] as a natural proper generalization of Artin groups of finite type. We have to construct a new proof to extend Styshnev's decidability result to Garside groups, as several specific properties of braids used in [9] fail in our case. We show that, under the assumption of a finiteness property of conjugacy, the problem is decidable.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
