Results 1  10
of
34
A Recognition Algorithm for Classical Groups over Finite Fields
 Proc. London Math. Soc
, 1998
"... 2. Classical groups and primitive prime divisors...... 121 3. Generic and nongeneric parameters........ 123 4. Groups with two different primitive prime divisor elements... 126 ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
2. Classical groups and primitive prime divisors...... 121 3. Generic and nongeneric parameters........ 123 4. Groups with two different primitive prime divisor elements... 126
A Constructive Recognition Algorithm for the Special Linear Group
"... In the rst part of this note we present an algorithm to recognise constructively the special linear group. In the second part we give timings and examples. 1 Introduction It seems possible, using Aschbacher's celebrated analysis of subgroups of classical groups [5], to develop algorithms that will ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
In the rst part of this note we present an algorithm to recognise constructively the special linear group. In the second part we give timings and examples. 1 Introduction It seems possible, using Aschbacher's celebrated analysis of subgroups of classical groups [5], to develop algorithms that will answer basic questions about the group G generated by a subset X of GL(d; q), for modest values of d and q, as is already possible for permutation groups. The best strategy may involve trying to recognise very large subgroups of GL(d; q) by special techniques. In the case of permutation groups, special techniques are used to recognise the alternating and symmetric groups. This is done by making a random search for elements of a certain cycle type. If such elements are found in a primitive group, the group is known to contain the alternating group. If no such elements are found after a suÆciently long search, one proceeds with the expectation that one is dealing with a smaller group. For li...
Recognising Tensor Products of Matrix Groups
 Internat. J. Algebra Comput
, 1997
"... As a contribution to the project for recognising matrix groups defined over finite fields, we describe an algorithm for deciding whether or not the natural module for such a matrix group can be decomposed into a nontrivial tensor product. In the affirmative case, a tensor decomposition is return ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
As a contribution to the project for recognising matrix groups defined over finite fields, we describe an algorithm for deciding whether or not the natural module for such a matrix group can be decomposed into a nontrivial tensor product. In the affirmative case, a tensor decomposition is returned. As one component, we develop algorithms to compute plocal subgroups of a matrix group. 1991 Mathematics Subject Classification (Amer. Math. Soc.): 20C20, 20C40. 1 Introduction In LeedhamGreen & O'Brien (1996), we give an internal description of tensor decompositions of finitedimensional vector spaces. We do this by constructing a family of projective geometries whose flats are certain subspaces of a vector space V , and showing that there is a onetoone correspondence between this family of projective geometries and the set of equivalence classes of tensor decompositions of V . The object of this paper is to exploit the geometrical approach presented there, together with some o...
Algorithms for Matrix Groups and the Tits Alternative
 Proc. 36th IEEE FOCS
, 1999
"... l over the generators grows as c l for some constant c>1 depending on G. For groups with abelian subgroups of finite index, we obtain a Las Vegas algorithm for several basic computational tasks, including membership testing and computing a presentation. This generalizes recent work of Beals an ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
l over the generators grows as c l for some constant c>1 depending on G. For groups with abelian subgroups of finite index, we obtain a Las Vegas algorithm for several basic computational tasks, including membership testing and computing a presentation. This generalizes recent work of Beals and Babai, who give a Las Vegas algorithm for the case of finite groups, as well as recent work of Babai, Beals, Cai, Ivanyos, and Luks, who give a deterministic algorithm for the case of abelian groups. # 1999 Academic Press Article ID jcss.1998.1614, available online at http:##www.idealibrary.com on 260 00220000#99 #30.00 Copyright # 1999 by Academic Press All rights of reproduction in any form reserved. * Research conducted while visiting IAS and DIMACS and supported in part by an NSF Mathematical Sciences
Prime power graphs for groups of Lie type
 JOURNAL OF ALGEBRA
, 2002
"... We associate a weighted graph (G) to each nite simple group G of Lie type. We show that, with an explicit list of exceptions, (G) determines G up to isomorphism, and for these exceptions, (G) nevertheless determines the characteristic of G. This result was motivated by algorithmic considerations. ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We associate a weighted graph (G) to each nite simple group G of Lie type. We show that, with an explicit list of exceptions, (G) determines G up to isomorphism, and for these exceptions, (G) nevertheless determines the characteristic of G. This result was motivated by algorithmic considerations. We prove that for any nite simple group G of Lie type, input as a black box group with an oracle to compute the orders of group elements, (G) and the characteristic of G can be computed by a Monte Carlo algorithm in time polynomial in the input length. The characteristic is needed as part of the input in a previous constructive recognition algorithm for G.
Polynomial Time Algorithms for Modules Over Finite Dimensional Algebras
, 1997
"... We present polynomial time algorithms for some fundamental tasks from representation theory of finite dimensional algebras. These involve testing (and constructing) isomorphisms of modules as well as expressing of modules as direct sums of indecomposable modules. Over number fields the latter task s ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We present polynomial time algorithms for some fundamental tasks from representation theory of finite dimensional algebras. These involve testing (and constructing) isomorphisms of modules as well as expressing of modules as direct sums of indecomposable modules. Over number fields the latter task seems to be difficult, therefore we restrict our attention to decomposition over finite fields and over the algebraic or real closure of number fields. The module isomorphism problem can be reformulated as follows. Let A 1 ; : : : ; Am and A 0 1 ; : : : ; A 0 m be two families of n\Thetanmatrices with entries from the field K. The task is to find a nonsingular n\Thetanmatrix X with entries from K such that XA i X \Gamma1 = A 0 i for all 1 i m (if such a matrix exists). In the case when K is the field of the real algebraic numbers, we propose a method for the variant where the matrix X is required to be orthogonal. St. Petersburg Institute for Informatics and Automation of th...
Constructive recognition of PSL(2, q)
 Trans. Amer. Math. Soc
"... Existing black box and other algorithms for explicitly recognising groups of Lie type over GF(q) have asymptotic running times which are polynomial in q, whereas the input size involves only log q. This has represented a serious obstruction to ecient recognition of such groups. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Existing black box and other algorithms for explicitly recognising groups of Lie type over GF(q) have asymptotic running times which are polynomial in q, whereas the input size involves only log q. This has represented a serious obstruction to ecient recognition of such groups.
Efficient Decomposition of Associative Algebras over Finite Fields
 J. Symb. Comp
, 1999
"... We present new, efficient algorithms for some fundamental computations with finite dimensional (but not necessarily commutative) associative algebras over finite fields. For a semisimple algebra A we showhow to compute a complete Wedderburn decomposition of A as a direct sum of simple algebras, an i ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We present new, efficient algorithms for some fundamental computations with finite dimensional (but not necessarily commutative) associative algebras over finite fields. For a semisimple algebra A we showhow to compute a complete Wedderburn decomposition of A as a direct sum of simple algebras, an isomorphism between each simple component and a full matrix algebra, and a basis for the centre of A. If A is given by a generating set of matrices in F m#m then our algorithm requires about O(m³) operations in F, in addition to the cost of factoring a polynomial in F(x) of degree O(m), and the cost of generating a small number of random elements from A. We also show how to compute a complete set of orthogonal primitive idempotents in any associative algebra over a finite field in this same time.