Malcev algebras and combinatorial structures
In this work, we design an algorithmic method to associate combinatorial structures with finite-dimensional Malcev algebras. In addition to its theoretical study, we have performed the implementation of procedures to construct the digraph associated with a given Malcev algebra (if its associated com...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Recursos: | Universidad Loyola Andalucía |
| Repositorio: | Brújula |
| OAI Identifier: | oai:repositorio.uloyola.es:20.500.12412/1307 |
| Acesso em linha: | http://hdl.handle.net/20.500.12412/1307 |
| Access Level: | acceso abierto |
| Palavra-chave: | Digraph Combinatorial structure Malcev algebra Combinatorial operations Algorithm |
| Resumo: | In this work, we design an algorithmic method to associate combinatorial structures with finite-dimensional Malcev algebras. In addition to its theoretical study, we have performed the implementation of procedures to construct the digraph associated with a given Malcev algebra (if its associated combinatorial structure is a digraph) and, conversely, a second procedure to test if a given digraph is associated with some Malcev algebra. |
|---|