Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V, we develop a computer program on Mathematica which checks if the bilinear map satisfies the Leibniz identity, that is, if the multiplication table endows V with a Leibniz algebra structure. In case of a positive answer, the program informs whether the structure corresponds to a Lie algebra or not, that is, if the bilinear map is skew-symmetric or not. The algorithm is based on the computation of a Gröbner basis of an ideal, which is employed in the construction of the universal enveloping algebra of a Leibniz algebra. Finally, we describe a program in the NCAlgebra package which permits the construction of Gröbner bases in non commutative algebras. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Casas, J. M., Insua, M. A., Ladra, M., & Ladra, S. (2009). Algorithm for testing the Leibniz algebra structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5717 LNCS, pp. 177–186). https://doi.org/10.1007/978-3-642-04772-5_24
Mendeley helps you to discover research relevant for your work.