2000 character limit reached
On the structures of split Leibniz triple systems
Published 25 Nov 2014 in math.RA | (1411.7026v1)
Abstract: We study the structures of arbitrary split Leibniz triple systems. By developing techniques of connections of roots for this kind of triple systems, under certain conditions, in the case of $T$ being of maximal length, the simplicity of the Leibniz triple systems is characterized.
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.