arXiv · math/0605741
General cycling operations in Garside groups
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hao Zheng. 2006-08-20. General cycling operations in Garside groups. https://arxiv.org/abs/math/0605741
Cite the original work for its findings. Save a collection to share your selection of sources.