当前位置:
X-MOL 学术
›
Int. J. Algebra Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Linear time algorithm for the conjugacy problem in the first Grigorchuk group
International Journal of Algebra and Computation ( IF 0.5 ) Pub Date : 2021-06-09 , DOI: 10.1142/s0218196721500363 Mitra Modi 1 , Mathew Seedhom 1 , Alexander Ushakov 1
International Journal of Algebra and Computation ( IF 0.5 ) Pub Date : 2021-06-09 , DOI: 10.1142/s0218196721500363 Mitra Modi 1 , Mathew Seedhom 1 , Alexander Ushakov 1
Affiliation
We prove that the conjugacy problem in the first Grigorchuk group Γ can be solved in linear time. Furthermore, the problem to decide if a list of elements w 1 , … , w k ∈ Γ contains a pair of conjugate elements can be solved in linear time. We also show that a conjugator for a pair of conjugate element u , v ∈ Γ can be found in polynomial time.
中文翻译:
第一Grigorchuk群共轭问题的线性时间算法
我们证明了第一个 Grigorchuk 群的共轭问题Γ 可以在线性时间内求解。此外,确定元素列表是否存在的问题w 1 , … , w ķ ∈ Γ 包含一对共轭元素可以在线性时间内求解。我们还展示了一对共轭元素的共轭器你 , v ∈ Γ 可以在多项式时间内找到。
更新日期:2021-06-09
中文翻译:
第一Grigorchuk群共轭问题的线性时间算法
我们证明了第一个 Grigorchuk 群的共轭问题