General cycling operations in Garside groups
From MaRDI portal
Publication:6477282
arXivmath/0605741MaRDI QIDQ6477282FDOQ6477282
Authors: Hao Zheng 
Publication date: 30 May 2006
Abstract: In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts provides a context in which various definitions and arguments concerning Garside groups are unified and simplified as well as improved. Practically, it yields a new algorithm which has a considerably improved performance on solving the conjugacy problem of reducible braids.
Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
This page was built for publication: General cycling operations in Garside groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477282)
