arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.07085math.GRcs.CCcs.FL
收藏

自由群有限扩张的同构问题是在PSPACE中

The isomorphism problem for finite extensions of free groups is in PSPACE

Géraud Sénizergues, Armin Weiß

摘要:

本文给出了一个算法:给定一个关于虚自由群$G$的字问题的上下文无关文法,计算一个由有限顶点群和基本群$G$组成的群$\mathcal{G}$的有限图.我们的算法是非确定性的,运行在双指数时间。由此可知,上下文自由群的同构问题可以在双指数空间中得到解决。此外,如果输入不是文法,而是自由群的有限扩张,则群的图的构造是NP中的,因此同构问题是PSPACE中的。

英文摘要:

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our algorithm is non-deterministic and runs in doubly exponential time. It follows that the isomorphism problem of context-free groups can be solved in doubly exponential space. Moreover, if, instead of a grammar, a finite extension of a free group is given as input, the construction of the graph of groups is in NP and, consequently, the isomorphism problem in PSPACE.

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

↑