arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.4528math.GR
收藏

相对双曲群共轭问题的时间复杂性

Time complexity of the conjugacy problem in relatively hyperbolic groups

Inna Bumagin

摘要:

如果$u$和$v$是一个双曲群的两个共轭元,那么$u$和$v$的最短共轭元素的长度可以由它们的长度之和的线性函数来界定,正如Lysenok所证明的那样。布赖森和Haefliger表明,在一个双曲群的共轭问题可以解决在多项式时间。我们将这些结果推广到相对双曲群。特别地,我们证明了共轭问题和共轭搜索问题都可以在相对双曲群中在多项式时间内解决,只要相应的问题可以在每个抛物子群中在多项式时间内解决。我们还证明了,如果$u$和$v$是一个相对双曲群的两个共轭双曲元,则$u$和$v$的最短共轭元的长度与它们的长度成线性关系.

英文摘要:

If $u$ and $v$ are two conjugate elements of a hyperbolic group then the length of a shortest conjugating element for $u$ and $v$ can be bounded by a linear function of the sum of their lengths, as was proved by Lysenok. Bridson and Haefliger showed that in a hyperbolic group the conjugacy problem can be solved in polynomial time. We extend these results to relatively hyperbolic groups. In particular, we show that both the conjugacy problem and the conjugacy search problem can be solved in polynomial time in a relatively hyperbolic group, whenever the corresponding problem can be solved in polynomial time in each parabolic subgroup. We also prove that if $u$ and $v$ are two conjugate hyperbolic elements of a relatively hyperbolic group then the length of a shortest conjugating element for $u$ and $v$ is linear in terms of their lengths.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑