Conjugacy problem for braid groups and Garside groups
几何拓扑
2007-05-23 v2 代数拓扑
群论
摘要
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
引用
@article{arxiv.math/0112310,
title = {Conjugacy problem for braid groups and Garside groups},
author = {Nuno Franco and Juan Gonzalez-Meneses},
journal= {arXiv preprint arXiv:math/0112310},
year = {2007}
}
备注
New version, with substantial modifications. 21 pages, 2 figures