R. Gray
Research Subjects
R. Gray has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- James D. Mitchell
School of Mathematics and Statistics, University of St Andrews
1 shared publication N. Ruškuc
Mathematical Institute , University of St. Andrews, North Haugh , St. Andrews, Fife, UK
1 shared publication
Latest Publications
- 3 October 2007
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (20) , 4801-4810
Largest subsemigroups of the full transformation monoid
- 3 October 2007
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (20) , 4801-4810
Largest subsemigroups of the full transformation monoid
- 1 November 2005
- Published by Taylor & Francis in Communications in Algebra
- Vol. 33 (12) , 4657-4678
Generating Sets of Completely 0-Simple Semigroups
A formula for the rank of an arbitrary finite completely 0-simple semigroup, represented as a Rees matrix semigroup ℳ0[G; I, Λ; P], is given. The result generalizes that of Ruškuc concerning the rank of connected finite completely 0-simple semigroups. The rank is expressed in terms of |I|, |Λ|, the number of connected components k of P, and a number r min, which we define. We go on to show that the number r min is expressible in terms of a family of subgroups of G, the members of which are in one-to-one correspondence with, and determined by the nonzero entries of, the components of P. A number of applications are given, including a generalization of a result of Gomes and Howie concerning the rank of an arbitrary Brandt semigroup B(G,{1,…,n}).
- 1 November 2005
- Published by Taylor & Francis in Communications in Algebra
- Vol. 33 (12) , 4657-4678
Generating Sets of Completely 0-Simple Semigroups
A formula for the rank of an arbitrary finite completely 0-simple semigroup, represented as a Rees matrix semigroup ℳ0[G; I, Λ; P], is given. The result generalizes that of Ruškuc concerning the rank of connected finite completely 0-simple semigroups. The rank is expressed in terms of |I|, |Λ|, the number of connected components k of P, and a number r min, which we define. We go on to show that the number r min is expressible in terms of a family of subgroups of G, the members of which are in one-to-one correspondence with, and determined by the nonzero entries of, the components of P. A number of applications are given, including a generalization of a result of Gomes and Howie concerning the rank of an arbitrary Brandt semigroup B(G,{1,…,n}).