论文标题
关于合同自相似群体的Nekrashevych代数的简单性
On the simplicity of Nekrashevych algebras of contracting self-similar groups
论文作者
论文摘要
自相似群体行为的Nekrashevych代数是经典Leavitt代数的自然概括。它们是相应的nekrashevych $ c^\ ast $ algebras的离散类似物。特别是,Nekrashevych,Clark,Exel,Pardo,Sims和Starling研究了Nekrashevych代数的简单性问题,部分原因是复杂代数的不舒张性暗示了$ C^\ AST $ -Algebra的$ C^\ AST $ -Algebra。 在本文中,我们为合同组的Nekrashevych代数提供了必要和充分的条件。有限地提出了承包人组的Nekrashevych代数。我们给出了一种算法,该算法在输入合同组的核心上输出了所有特征的田地特征,相应的Nekrashevych代数很简单。 Using our methods, we determine the fields over which the Nekrashevych algebras of a number of well-known contracting groups are simple including the Basilica group, Gupta-Sidki groups, GGS-groups, multi-edge spinal groups, Šunić groups associated to polynomials (this latter family includes the Grigorchuk group, Grigorchuk-Erschler group and Fabrykowski-Gupta group) and自我复制脊柱自动机组。
Nekrashevych algebras of self-similar group actions are natural generalizations of the classical Leavitt algebras. They are discrete analogues of the corresponding Nekrashevych $C^\ast$-algebras. In particular, Nekrashevych, Clark, Exel, Pardo, Sims and Starling have studied the question of simplicity of Nekrashevych algebras, in part, because non-simplicity of the complex algebra implies non-simplicity of the $C^\ast$-algebra. In this paper we give necessary and sufficient conditions for the Nekrashevych algebra of a contracting group to be simple. Nekrashevych algebras of contracting groups are finitely presented. We give an algorithm which on input the nucleus of the contracting group, outputs all characteristics of fields over which the corresponding Nekrashevych algebra is simple. Using our methods, we determine the fields over which the Nekrashevych algebras of a number of well-known contracting groups are simple including the Basilica group, Gupta-Sidki groups, GGS-groups, multi-edge spinal groups, Šunić groups associated to polynomials (this latter family includes the Grigorchuk group, Grigorchuk-Erschler group and Fabrykowski-Gupta group) and self-replicating spinal automaton groups.