Constructing composition factors for a linear group in polynomial time

被引:1
作者
Holt, Derek [1 ]
Leedham-Green, C. R. [2 ]
O'Brien, E. A. [3 ]
机构
[1] Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
[2] Queen Mary Univ London, Sch Math Sci, London E1 4NS, England
[3] Univ Auckland, Dept Math, Auckland, New Zealand
关键词
Finite linear groups; Composition factors; Algorithm; Polynomial-time; PROJECTIVE-REPRESENTATIONS; LIE TYPE; RECOGNITION; ELEMENTS;
D O I
10.1016/j.jalgebra.2020.02.018
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We present a Las Vegas polynomial-time algorithm that takes as input a subgroup of GL(d, F-q) and, subject to the existence of certain oracles, determines its composition factors, provided that none of those factors is isomorphic to one of B-2(2)(2(2k+1)), F-2(4) (2(2k+1)), D-3(4)(2(k)), or (2)G(2)(3(2k+1)), for any k. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:215 / 236
页数:22
相关论文
共 48 条
  • [1] [Anonymous], 1991, 23 ANN ACM S THEORY
  • [2] [Anonymous], 1999, MATH ITS APPL
  • [3] ON THE MAXIMAL-SUBGROUPS OF THE FINITE CLASSICAL-GROUPS
    ASCHBACHER, M
    [J]. INVENTIONES MATHEMATICAE, 1984, 76 (03) : 469 - 514
  • [4] Baarnhielm Henrik, 2007, THESIS
  • [5] Babai L., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P229, DOI 10.1109/SFCS.1984.715919
  • [6] Black-box recognition of finite simple groups of Lie type by statistics of element orders
    Babai, L
    Kantor, WM
    Pálfy, PP
    Seress, A
    [J]. JOURNAL OF GROUP THEORY, 2002, 5 (04) : 383 - 401
  • [7] Fast management of permutation groups .1.
    Babai, L
    Luks, EM
    Seress, A
    [J]. SIAM JOURNAL ON COMPUTING, 1997, 26 (05) : 1310 - 1342
  • [8] Babai L., 1999, London Mathematical Society Lecture Note Series, P30
  • [9] Babai L., 2000, GROUPS COMPUTATION, P39
  • [10] ON THE NUMBER OF p-REGULAR ELEMENTS IN FINITE SIMPLE GROUPS
    Babai, Laszlo
    Palfy, Peter P.
    Saxl, Jan
    [J]. LMS JOURNAL OF COMPUTATION AND MATHEMATICS, 2009, 12 : 82 - 119