A polynomial-time reduction algorithm for groups of semilinear or subfield class

Jon Carlson, Max Neunhoeffer, Colva Mary Roney-Dougal

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

In this paper we present an O(d4 log(log d) log q + d3m) Las Vegas algorithm for find- ing a nontrivial reduction of groups that are irreducible with m generators and either lie in the subfield class of matrix or projective groups or are semilinear or have non-absolutely irreducible derived group. We also characterise the absolutely irreducible groups G over arbitrary fields whose derived group consists only of scalars, and prove probabilistic gener- ation results about matrix groups.
Original languageEnglish
Pages (from-to)613-637
JournalJournal of Algebra
Volume322
Issue number3
DOIs
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'A polynomial-time reduction algorithm for groups of semilinear or subfield class'. Together they form a unique fingerprint.

Cite this