Add to ORKGWe describe a new technique for finding efficient presentations for finite groups. We use it to answer three previously unresolved questions about the efficiency of group and semigroup presentations.
Two questions are discussed. Firstly, what is the connection between the group and the semigroup def...
TEZ6067Tez (Yüksek Lisans) -- Çukurova Üniversitesi, Adana, 2006.Kaynakça (s.57) var.iv, 58 s. ; 29 ...
Two questions are discussed. Firstly, what is the connection between the group and the semigroup def...
We describe a new technique for finding efficient presentations for finite groups. We use it to answ...
We describe a new technique for finding efficient presentations for finite groups. We use it to answ...
A finite semigroup S is said to be efficient if it can be defined by a presentation [A \ R] with \R\...
The purpose of this paper is twofold. First we determine some forms of the relations in a finite sem...
In this thesis we consider in detail the following two problems for semigroups: (i) When are semigr...
Abstract. There is much interest in finding short presentations for the finite simple groups. Indeed...
Let G be a finite imperfect group. It is shown that, to prove that G(n) is efficient for all integer...
There is much interest in finding short presentations for the finite simple groups. In a previous pa...
If a finite group G has a presentation with d generators and r relations, it is well-known that r ? ...
There is much interest in finding short presentations for the finite simple groups. In a previous pa...
In Chapter 2 of this thesis we look at methods for finding efficient presentations of the transitive...
In this paper we give efficient presentations for $A4\times D_n$, where n is odd number, or n is eve...
Two questions are discussed. Firstly, what is the connection between the group and the semigroup def...
TEZ6067Tez (Yüksek Lisans) -- Çukurova Üniversitesi, Adana, 2006.Kaynakça (s.57) var.iv, 58 s. ; 29 ...
Two questions are discussed. Firstly, what is the connection between the group and the semigroup def...
We describe a new technique for finding efficient presentations for finite groups. We use it to answ...
We describe a new technique for finding efficient presentations for finite groups. We use it to answ...
A finite semigroup S is said to be efficient if it can be defined by a presentation [A \ R] with \R\...
The purpose of this paper is twofold. First we determine some forms of the relations in a finite sem...
In this thesis we consider in detail the following two problems for semigroups: (i) When are semigr...
Abstract. There is much interest in finding short presentations for the finite simple groups. Indeed...
Let G be a finite imperfect group. It is shown that, to prove that G(n) is efficient for all integer...
There is much interest in finding short presentations for the finite simple groups. In a previous pa...
If a finite group G has a presentation with d generators and r relations, it is well-known that r ? ...
There is much interest in finding short presentations for the finite simple groups. In a previous pa...
In Chapter 2 of this thesis we look at methods for finding efficient presentations of the transitive...
In this paper we give efficient presentations for $A4\times D_n$, where n is odd number, or n is eve...
Two questions are discussed. Firstly, what is the connection between the group and the semigroup def...
TEZ6067Tez (Yüksek Lisans) -- Çukurova Üniversitesi, Adana, 2006.Kaynakça (s.57) var.iv, 58 s. ; 29 ...
Two questions are discussed. Firstly, what is the connection between the group and the semigroup def...