Algorithmic method to obtain combinatorial structures associated with Leibniz algebras

DOI10.1016/j.matcom.2014.11.001OpenAlexW2005563839WikidataQ123333831 ScholiaQ123333831MaRDI QIDQ2228805

Juan Núñez Valdés, Angel Francisco Tenorio Villalón, Manuel Ceballos

Publication date: 19 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2014.11.001

zbMATH Keywords

algorithmcombinatorial structurestructure theoryLeibniz algebrapseudodigraph

Mathematics Subject Classification ID

Computer science (68-XX) Quantum theory (81-XX)

Related Items (1)

Computation of isotopisms of algebras over finite fields by means of graph invariants

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Some remarks on semisimple Leibniz algebras
• An algorithm for the classification of 3-dimensional complex Leibniz algebras
• Study of Lie algebras by using combinatorial structures
• A noncommutative version of Lie algebras: Leibniz algebras
• Combinatorial structures associated with Lie algebras of finite dimension
• Complete triangular structures and Lie algebras
• ON LEVI’S THEOREM FOR LEIBNIZ ALGEBRAS
• Algèbres de Leibnitz : définitions, propriétés
• Combinatorial structures of three vertices and Lie algebras

This page was built for publication: Algorithmic method to obtain combinatorial structures associated with Leibniz algebras