Constructing Embeddings and Isomorphisms of Finite Abstract Semigroups
From MaRDI portal
Abstract: We present a search algorithm for constructing embeddings and deciding isomorphisms of semigroups, working with their multiplication tables. The algorithm is used for enumerating diagram semigroups up to isomorphism and for finding minimal degree representations.
This page was built for publication: Constructing Embeddings and Isomorphisms of Finite Abstract Semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6271681)