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

拟等距 Higman 嵌入与 Dehn 函数

Quasi-isometric Higman embeddings and the Dehn function

Francis Wagner

AI总结:

本文证明满足特定计算枚举条件的有限生成群可拟等距嵌入到 Dehn 函数受计算复杂度控制的有限呈现群中,推广了自由 Burnside 群嵌入结果,并改进了字问题 NP 性与多项式 Dehn 函数嵌入的经典刻画。

摘要:

本文是系列论文的第一篇,致力于研究有限生成递归呈现群 $G$ 的字问题复杂度与 $G$ 所嵌入的有限呈现群的等周函数之间的联系。我们在此证明:若一个有限生成群具有一个呈现 $\mathcal{P}$,其关系元可由满足特定技术要求的计算模型枚举,则该群拟等距嵌入到一个有限呈现群中,该群的 Dehn 函数上界由该模型的计算复杂度与 $\mathcal{P}$ 的 Dehn 函数所构成的某个函数给出。这一结果推广了作者先前关于自由 Burnside 群嵌入的工作,并为建立具有期望几何性质的群的此类 Higman 嵌入提供了方法。作为该嵌入方案应用的一个例子,我们对 Birget、Ol'shanskii、Rips 和 Sapir 的开创性结果作出了实质性改进,该结果表明:一个有限生成群的字问题属于 NP 类当且仅当该群嵌入到一个具有多项式 Dehn 函数的有限呈现群中。

英文摘要:

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in which $G$ embeds. We prove here that if a finitely generated group has a presentation $\mathcal{P}$ whose relators can be enumerated by a computational model satisfying certain technical requirements, then the group embeds quasi-isometrically into a finitely presented group whose Dehn function is bounded above by a function of the model's computational complexity and the Dehn function of $\mathcal{P}$. This generalizes a previous result of the author pertaining to the embeddings of free Burnside groups and gives a recipe for establishing such Higman embeddings into groups with desired geometric properties. As an example of the use of this embedding scheme, we find a substantial improvement to the seminal result of Birget, Ol'shanskii, Rips, and Sapir showing that the Word Problem of a finitely generated group is in class NP if and only if the group embeds into a finitely presented group with polynomial Dehn function.

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

↑