Effective black-box constructive recognition of classical groups

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

Research output: Contribution to journalArticleResearchpeer-review

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 languageEnglish
Pages (from-to)460 - 492
Number of pages33
JournalJournal of Algebra
Volume421
DOIs
Publication statusPublished - 2015

Cite this

Dietrich, Heiko ; Leedham-Green, Charles R ; O'Brien, Eamonn A. / Effective black-box constructive recognition of classical groups. In: Journal of Algebra. 2015 ; Vol. 421. pp. 460 - 492.
@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",

}

Effective black-box constructive recognition of classical groups. / Dietrich, Heiko; Leedham-Green, Charles R; O'Brien, Eamonn A.

In: Journal of Algebra, Vol. 421, 2015, p. 460 - 492.

Research output: Contribution to journalArticleResearchpeer-review

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 -