Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 59 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 430 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

On the simplicity of Nekrashevych algebras of contracting self-similar groups (2008.04220v3)

Published 10 Aug 2020 in math.RA, math.GR, and math.OA

Abstract: 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, \v{S}uni\'{c} groups associated to polynomials (this latter family includes the Grigorchuk group, Grigorchuk-Erschler group and Fabrykowski-Gupta group) and self-replicating spinal automaton groups.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube