arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.01092math.GR
收藏

Low-complexity computations for nilpotent subgroup problems

Jeremy Macdonald, Alexei Miasnikov, Denis Ovchinnikov

英文摘要:

We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and rank: subgroup conjugacy, computing the normalizer and isolator of a subgroup, coset intersection, and computing the torsion subgroup. Additionally, if any input words are provided in compressed form as straight-line programs or in Mal'cev coordinates the algorithms run in quartic time.

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

↑