PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Computing automorphisms of semigroups
J Araujo, Paul Buenau, J Mitchell and M Neunhoeffer
Computing automorphisms of semigroups Volume 45, Number 3, pp. 373-392, 2010.

Abstract

In this paper an algorithm is presented that can be used to calculate the automorphism group of a finite transformation semigroup. The general algorithm employs a special method to compute the automorphism group of a finite simple semigroup. As applications of the algorithm all the automorphism groups of semigroups of order at most 7 and of the multiplicative semigroups of some group rings are found. We also consider which groups occur as the automorphism groups of semigroups of several distinguished types.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:9458
Deposited By:Paul Buenau
Deposited On:16 March 2012