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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call