1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Algorithms for the Tits alternative and related problems
A. S. Detinko, D. L. Flannery, E. A. O'Brien
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alterna…
Recognizing finite matrix groups over infinite fields
A. S. Detinko, D. L. Flannery, E. A. O'Brien
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finite…
Algorithms for linear groups of finite rank
A. S. Detinko, D. L. Flannery, E. A. O'Brien
Let be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of and a bound on the Prüfer rank of . This yields…
Code loops in dimension at most 8
E. A. O'Brien, Petr Vojtěchovský
Code loops are certain Moufang -loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More preci…
Surjective word maps and Burnsides theorem
Robert Guralnick, Martin Liebeck, Eamon O'Brien +2
We prove surjectivity of certain word maps on finite non-abelian simple groups. More precisely, we prove the following: if N is a product of two prime powers, then the word map sen…