Published May 10, 2017 | Version v1
Publication

A faithful functor among algebras and graphs

Description

The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/59586
URN
urn:oai:idus.us.es:11441/59586