Finite Representation of Classes of Isomorphic Groupoids

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 hyp...

Full description

Saved in:
Bibliographic Details
Published inJournal of Siberian Federal University. Mathematics & Physics Vol. 8; no. 3; pp. 312 - 319
Main Author Nazarov, Maxim N.
Format Journal Article
LanguageEnglish
Published Krasnoyarsk Siberian Federal University 01.08.2015
Subjects
Algorithms
Automorphisms
Construction
Graph theory
Indexing
Mathematical analysis
Representations
Three dimensional
Online AccessGet full text
ISSN1997-1397
2313-6022
DOI10.17516/1997-1397-2015-8-3-312-319

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1997-1397
2313-6022
DOI:10.17516/1997-1397-2015-8-3-312-319