Abstract:
We consider an alternative representation of finite groupoids in the form of hypergraphs with three-vertex edges. Automorphism classes of vertices and edges of this hypergraphs are linearly ordered by a natural indexing algorithm based on a maxi-code for three-dimensional adjacency matrix of the hypergraph. With respect of this indexing is constructed a finite set description for the classes of isomorphic groupoids.
Keywords:finite groupoids, hypergraphs, automorphism classes of groupoid elements.
UDC:512.548+519.179.1
Received: 29.04.2015 Received in revised form: 11.05.2015 Accepted: 20.06.2015