Given a finite-dimensional Leibniz algebra with certain basis, we show how to associate such algebra with a combinatorial structure of dimension 2. In some particular cases, this structure can be reduced to a digraph or a pseudodigraph. In this paper, we study some theoretical properties about this association and we determine the type of Leibniz algebra associated to each of them.
In this paper, we focus on the link between evolution algebras and (pseudo)digraphs. We study some theoretical properties about this association and determine the properties of the (pseudo)digraphs associated with each type of evolution algebras. We also analyze the isomorphism classes for each configuration associated with these algebras providing a new method to classify them, and we compare our results with the current classifications of two-and three-dimensional evolution algebras. In order to complement the theoretical study, we have designed and performed the implementation of an algorithm, which constructs and draws the (pseudo)digraph associated with a given evolution algebra and another procedure to study the solvability of a given evolution algebra.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.