2000 character limit reached
Leibniz superalgebras with a set grading
Published 27 Mar 2020 in math.RA | (2003.12607v1)
Abstract: Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case of ${\mathfrak L}$ being of maximal length, the simplicity of ${\mathfrak L}$ is also characterized in terms of connections.
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.