General cycling operations in Garside groups

Simple item page
dc.creatorZheng, Hao
dc.date2006-05-30
dc.date2006-08-20
dc.date.accessioned2026-07-07T07:14:37Z
dc.date.available2026-07-07T07:14:37Z
dc.descriptionIn 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.
dc.description22 pages. A new section (Section 7) was appended in the second version, in which we present several applications on the summit infimum/supremum, the stable summit set and the rigid elements
dc.identifierhttps://arxiv.org/abs/math/0605741
dc.identifierhttp://arxiv.org/abs/math/0605741
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112952
dc.subjectGeometric Topology
dc.subjectGroup Theory
dc.subject20F36; 20F10
dc.titleGeneral cycling operations in Garside groups
dc.typetext

Files

Collections

arXiv