Følner集的可计算性
Computability of Følner sets
摘要：
我们定义的概念的可计算性的Følner集的可计算性生成的顺从的群体。通过一个明确的描述，证明了具有不可解字问题的可表示可解群Kharlampovich群有可计算Følner集.我们还证明了Følner集的可计算性的一组，这是一个可解的字问题的问题，由一个有限生成群与可计算的Følner集与subrecursive失真函数的顺从群的扩展。此外，我们得到了一些已知的和一些新的上界的Følner函数在这些特定的扩展。
英文摘要：
We define the notion of computability of Følner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has computable Følner sets. We also prove computability of Følner sets for a group that is extension of an amenable group with solvable word problem by a finitely generated group with computable Følner sets with subrecursive distortion function. Moreover we obtain some known and some new upper bounds for the Følner function in these particular extensions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
