2000 character limit reached
Supernilpotent groups and $3$-supernilpotent loops
Published 16 Sep 2022 in math.GR | (2209.08128v2)
Abstract: We find a short equational basis for the variety of $3$-supernilpotent loops. We also present a conceptually simple proof that $k$-nilpotence and $k$-supernilpotence are equivalent for groups. Connections between $3$-supernilpotent loops, Moufang loops, code loops, automorphic loops and AIM loops are explored.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.