Brújula Home

Institutional repository of the Universidad Loyola

View Item 
  •   Brújula Home
  • PRODUCCIÓN CIENTÍFICA Y TRANSFERENCIA
  • Departamento Ingeniería
  • Comunicaciones en Congresos
  • View Item
  •   Brújula Home
  • PRODUCCIÓN CIENTÍFICA Y TRANSFERENCIA
  • Departamento Ingeniería
  • Comunicaciones en Congresos
  • View Item
    • español
    • English
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of BrújulaCommunities and CollectionsAuthorsTitlesKeywordsAuthor profilesThis CollectionAuthorsTitlesKeywords

My Account

Login

Statistics

View Usage Statistics

Añadido Recientemente

Novedades
Repository
How to publish
Visibility
FAQs

Graph theory and finite-dimensional flexible algebras

Author:
Ceballos González, ManuelUniversidad Loyola Authority
URI:
https://hdl.handle.net/20.500.12412/6958
Date:
2022
Keyword(s):

Digraph

Pseudodigraph

Combinatorial structure

Flexible algebra

Abstract:

In this paper, the link between graph theory and flexible algebras is studied, determining which configurations are associated with those algebras. We also deal with the properties of flexible algebras that can be read from their associated graph. Moreover, the isomorphism classes of each $2$-dimensional configuration associated with these algebras is analyzed, providing a new method to classify them. In order to complement the theoretical study, two algorithmic methods are implemented: the first one constructs and draws the (pseudo)digraph associated with a given flexible algebra and the second one tests if a given combinatorial structure is associated with some flexible algebra.

In this paper, the link between graph theory and flexible algebras is studied, determining which configurations are associated with those algebras. We also deal with the properties of flexible algebras that can be read from their associated graph. Moreover, the isomorphism classes of each $2$-dimensional configuration associated with these algebras is analyzed, providing a new method to classify them. In order to complement the theoretical study, two algorithmic methods are implemented: the first one constructs and draws the (pseudo)digraph associated with a given flexible algebra and the second one tests if a given combinatorial structure is associated with some flexible algebra.

Show full item record
Collections
  • Comunicaciones en Congresos
Files in this item
Thumbnail
C_flexible_abstract_1pag.pdf (49.20Kb)
Share
Export to Mendeley
Statistics
Usage statistics
Metrics and citations
Go to Brújula home

Universidad Loyola

Library

Contact

Facebook Loyola BibliotecaTwitter Loyola Biblioteca

The content of the Repository is protected with a Creative Commons license:

Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Creative Commons Image