In this thesis we shall consider three types of extremal problems (i.e. problems involving maxima and minima) concerning semigroups. In the first chapter we show how to construct a minimal semigroup presentation that defines a group of non-negative deficiency given a minimal group presentation for that group. This demonstrates that the semigroup deficiency of a group of non-negative deficiency is equal to the group deficiency of that group. Given a finite monoid we find a necessary and sufficient condition for the monoid deficiency to equal the semigroup deficiency. We give a class of infinite monoids for which this equality also holds. The second type of problem we consider concerns infinite semigroups of relations and transformations. We ...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
The classification of finite semigroups is difficult even for small orders because of their large nu...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
In this thesis we study two different topics, both in the context of semigroup constructions. The fi...
Computational semigroup theory involves the study and implementation of algorithms to compute with s...
In this thesis some topics in the field of Infinite Transformation Semigroups are investigated. ...
The classification of finite semigroups is difficult even for small orders because of their large n...
J. D. Mitchell, M. Morayne, Y. Peresse, and M. Quick, 'Generating transformation semigroups using en...
Let $X$ be an infinite linearly ordered set and let $Y$ be a nonempty subset of $X$. We calculate th...
Semigroup Forum, nº76 (2008), pg.579-583In this paper we describe the least non-negative integer n s...
Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups ...
ABSTRACT. Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subs...
AbstractLet ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsem...
The semigroup theories of fundamental importance were discovered in 1928 with the publication of a p...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
The classification of finite semigroups is difficult even for small orders because of their large nu...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
In this thesis we study two different topics, both in the context of semigroup constructions. The fi...
Computational semigroup theory involves the study and implementation of algorithms to compute with s...
In this thesis some topics in the field of Infinite Transformation Semigroups are investigated. ...
The classification of finite semigroups is difficult even for small orders because of their large n...
J. D. Mitchell, M. Morayne, Y. Peresse, and M. Quick, 'Generating transformation semigroups using en...
Let $X$ be an infinite linearly ordered set and let $Y$ be a nonempty subset of $X$. We calculate th...
Semigroup Forum, nº76 (2008), pg.579-583In this paper we describe the least non-negative integer n s...
Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups ...
ABSTRACT. Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subs...
AbstractLet ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsem...
The semigroup theories of fundamental importance were discovered in 1928 with the publication of a p...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
The classification of finite semigroups is difficult even for small orders because of their large nu...