AbstractIn this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T⩽S where T has a given property? The semigroups S that we consider are the full transformation semigroups; all mappings from a finite set to itself under composition of mappings. The subsemigroups T that we consider are of one of the following types: left zero, right zero, completely simple, or inverse. Furthermore, we find the largest size of such subsemigroups U where the least rank of an element in U is specified. Numerous examples are given
Semigroup Forum, nº76 (2008), pg.579-583In this paper we describe the least non-negative integer n s...
AbstractThe size of the transformation semigroup of a reversible deterministic finite automaton with...
Yang (1999) classified the maximal inverse subsemigroups of all the ideals of the symmetric inverse ...
AbstractIn this paper we are concerned with the following question: for a semigroup S, what is the l...
In this paper we are concerned with the following question: for a semigroup S, what is the largest s...
Proceedings of the Edinburgh Mathematical Society, nº50 (2007), p.551-561The symmetric inverse monoi...
Abstract The symmetric inverse monoid In is the set of all partial permutations of an n-element set....
AbstractThe size of the transformation semigroup of a reversible deterministic finite automaton with...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
The symmetric inverse monoid I-n,, is the set of all partial permutations of an n-element set. The l...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
The first author gratefully acknowledges the support of the Glasgow Learning, Teaching, and Research...
AbstractWe develop a general approach to the study of maximal nilpotent subsemigroups of finite semi...
Semigroup Forum, nº76 (2008), pg.579-583In this paper we describe the least non-negative integer n s...
AbstractThe size of the transformation semigroup of a reversible deterministic finite automaton with...
Yang (1999) classified the maximal inverse subsemigroups of all the ideals of the symmetric inverse ...
AbstractIn this paper we are concerned with the following question: for a semigroup S, what is the l...
In this paper we are concerned with the following question: for a semigroup S, what is the largest s...
Proceedings of the Edinburgh Mathematical Society, nº50 (2007), p.551-561The symmetric inverse monoi...
Abstract The symmetric inverse monoid In is the set of all partial permutations of an n-element set....
AbstractThe size of the transformation semigroup of a reversible deterministic finite automaton with...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
The symmetric inverse monoid I-n,, is the set of all partial permutations of an n-element set. The l...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such...
The first author gratefully acknowledges the support of the Glasgow Learning, Teaching, and Research...
AbstractWe develop a general approach to the study of maximal nilpotent subsemigroups of finite semi...
Semigroup Forum, nº76 (2008), pg.579-583In this paper we describe the least non-negative integer n s...
AbstractThe size of the transformation semigroup of a reversible deterministic finite automaton with...
Yang (1999) classified the maximal inverse subsemigroups of all the ideals of the symmetric inverse ...