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

代数有限群

Algorithmically finite groups

A. Myasnikov, D. Osin

摘要:

我们称一个群为$G$ { \it算法有限},如果没有算法可以产生$G$的两两不同元素的无限集。我们构造了递归表示的无穷算法有限群的例子,并研究了它们的性质。例如,我们证明了等式问题在我们的组中仅在强(指数)可忽略的输入集上是可判定的。

英文摘要:

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially) negligible sets of inputs.

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

↑