Add to ORKGIn Chapter 2 of this thesis we look at methods for finding efficient presentations of the transitive permutation groups of degree ≤ 12. Chapter 3 gives efficient presentations for certain direct products of groups including PSL(2, P)2 SL(2, p) X SL(2, 8), PSL(2, p) x C2, for prime p ≥ 5 and PSL(2, 25)3. Chapter 4 introduces a new class of inefficient groups and Chapter 5 gives a brief survey of some of the open problems relating to the efficiency of finite groups
WOS: 000071722500003We give deficiency -4 presentations of the groups PSL(2, Z(n)) x PSL(2, Z(m)), n...
The aim of this thesis is to generate original symmetric presentations for finite non-abelian simple...
One of the main algorithms of computational group theory is the Todd-Coxeter coset enumeration algor...
For the non-abelian simple groups G of order up to 10⁶ , excluding the groups PSL(2,q), q > 9, the p...
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...
We describe a new technique for finding efficient presentations for finite groups. We use it to answ...
summary:$G(3,m,n)$ is the group presented by $\langle a,b\mid a^5=(ab)^2=b^{m+3}a^{-n}b^ma^{-n}=1\ra...
This thesis discusses upper bounds on the minimal number of elements d(G) required to generate a fin...
summary:$G(3,m,n)$ is the group presented by $\langle a,b\mid a^5=(ab)^2=b^{m+3}a^{-n}b^ma^{-n}=1\ra...
The main goal of this work is to examine classes of finite groups in which normality, permutability ...
The main goal of this work is to examine classes of finite groups in which normality, permutability ...
We give deficiency -4 presentations of the groups PSL(2, Zn) × PSL(2, Zm), n, m odd numbers and [(n ...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
WOS: 000071722500003We give deficiency -4 presentations of the groups PSL(2, Z(n)) x PSL(2, Z(m)), n...
The aim of this thesis is to generate original symmetric presentations for finite non-abelian simple...
One of the main algorithms of computational group theory is the Todd-Coxeter coset enumeration algor...
For the non-abelian simple groups G of order up to 10⁶ , excluding the groups PSL(2,q), q > 9, the p...
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...
We describe a new technique for finding efficient presentations for finite groups. We use it to answ...
summary:$G(3,m,n)$ is the group presented by $\langle a,b\mid a^5=(ab)^2=b^{m+3}a^{-n}b^ma^{-n}=1\ra...
This thesis discusses upper bounds on the minimal number of elements d(G) required to generate a fin...
summary:$G(3,m,n)$ is the group presented by $\langle a,b\mid a^5=(ab)^2=b^{m+3}a^{-n}b^ma^{-n}=1\ra...
The main goal of this work is to examine classes of finite groups in which normality, permutability ...
The main goal of this work is to examine classes of finite groups in which normality, permutability ...
We give deficiency -4 presentations of the groups PSL(2, Zn) × PSL(2, Zm), n, m odd numbers and [(n ...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
WOS: 000071722500003We give deficiency -4 presentations of the groups PSL(2, Z(n)) x PSL(2, Z(m)), n...
The aim of this thesis is to generate original symmetric presentations for finite non-abelian simple...
One of the main algorithms of computational group theory is the Todd-Coxeter coset enumeration algor...