Effective black-box constructive recognition of classical groups

JOURNAL OF ALGEBRA

卷:421

Article

Dietrich, Heiko¹  Leedham-Green, C. R.²  O'Brien, E. A.³ 

[1] Monash Univ, Sch Math Sci, Melbourne, Vic 3800, Australia

[2] Univ London, Sch Math Sci, London E1 4NS, England

[3] Univ Auckland, Dept Math, Private Bag 92019, Auckland, New Zealand

关键词: Classical groups;    Constructive recognition;    Black-box algorithms;   

DOI  :  10.1016/j.jalgebra.2014.08.039

来源: Elsevier

【 摘 要 】

We describe a black-box Las Vegas algorithm to construct standard generators for classical groups defined over finite fields. We assume that the field has size at least 4 and that oracles to solve certain problems are available. Subject to these assumptions, the algorithm runs in polynomial time. A practical implementation of our algorithm is distributed with the computer algebra system MAGMA. (C) 2014 Elsevier Inc. All rights reserved.

【 授权许可】

Free