Effective black-box constructive recognition of classical groups

Heiko Dietrich; Charles R Leedham-Green; Eamonn A O'Brien

doi:10.1016/j.jalgebra.2014.08.039

Effective black-box constructive recognition of classical groups

Heiko Dietrich, Charles R Leedham-Green, Eamonn A O'Brien

School of Mathematics

Research output: Contribution to journal › Article › Research › peer-review

7 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	460 - 492
Number of pages	33
Journal	Journal of Algebra
Volume	421
DOIs	https://doi.org/10.1016/j.jalgebra.2014.08.039
Publication status	Published - 2015

Access to Document

10.1016/j.jalgebra.2014.08.039Licence: Unspecified

3488808-oaAccepted author manuscript, 368 KB

Cite this

@article{1714e152d21543e0beb77df506013f35,

title = "Effective black-box constructive recognition of classical groups",

abstract = "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.",

author = "Heiko Dietrich and Leedham-Green, {Charles R} and O'Brien, {Eamonn A}",

year = "2015",

doi = "10.1016/j.jalgebra.2014.08.039",

language = "English",

volume = "421",

pages = "460 -- 492",

journal = "Journal of Algebra",

issn = "0021-8693",

publisher = "Elsevier",

}

TY - JOUR

T1 - Effective black-box constructive recognition of classical groups

AU - Dietrich, Heiko

AU - Leedham-Green, Charles R

AU - O'Brien, Eamonn A

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.sciencedirect.com/science/article/pii/S0021869314004852/pdfft?md5=b3b23ae62ffb7f597e16f746c3aadea3&pid=1-s2.0-S0021869314004852-main.pdf

U2 - 10.1016/j.jalgebra.2014.08.039

DO - 10.1016/j.jalgebra.2014.08.039

M3 - Article

VL - 421

SP - 460

EP - 492

JO - Journal of Algebra

JF - Journal of Algebra

SN - 0021-8693

ER -

Effective black-box constructive recognition of classical groups

Abstract

Access to Document

Other files and links

Computing with matrix groups and Lie algebras: new concepts and applications

Cite this

Effective black-box constructive recognition of classical groups

Abstract

Access to Document

Other files and links

Projects

Computing with matrix groups and Lie algebras: new concepts and applications

Cite this