AbstractIn 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
AbstractWe develop a general formula for the order of the group of automorphisms Aut(G) of a monolit...
117 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This dissertation is a study ...
117 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This dissertation is a study ...
In this paper an algorithm is presented that can be used to calculate the automorphism group of a fi...
We introduce the notion of a strong representation of a semigroup in the monoid of endomorphisms of ...
A new method for computing the automorphism group Aut(G) of a reasonably small finite group G will b...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
Abstract. We describe general methods for enumerating subsemigroups of finite semigroups and techniq...
The classification of finite semigroups is difficult even for small orders because of their large nu...
In this paper we propose a general recipe for calculating the automorphism groups of semigroups cons...
In this paper we propose a general recipe for calculating the automorphism groups of semigroups cons...
We characterize automorphisms for semigroups of nonnegative matrices including dou-bly stochastic ma...
The book describes developments on some well-known problems regarding the relationship between order...
AbstractWe develop a general formula for the order of the group of automorphisms Aut(G) of a monolit...
117 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This dissertation is a study ...
117 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This dissertation is a study ...
In this paper an algorithm is presented that can be used to calculate the automorphism group of a fi...
We introduce the notion of a strong representation of a semigroup in the monoid of endomorphisms of ...
A new method for computing the automorphism group Aut(G) of a reasonably small finite group G will b...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
Abstract. We describe general methods for enumerating subsemigroups of finite semigroups and techniq...
The classification of finite semigroups is difficult even for small orders because of their large nu...
In this paper we propose a general recipe for calculating the automorphism groups of semigroups cons...
In this paper we propose a general recipe for calculating the automorphism groups of semigroups cons...
We characterize automorphisms for semigroups of nonnegative matrices including dou-bly stochastic ma...
The book describes developments on some well-known problems regarding the relationship between order...
AbstractWe develop a general formula for the order of the group of automorphisms Aut(G) of a monolit...
117 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This dissertation is a study ...
117 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This dissertation is a study ...