Applications of computational tools for finitely presented groups
George Havas, Edmund F. Robertson
Abstract
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general computational approach for investigating finitely presented groups by way of quotients and subgroups is described and examples are presented. The techniques can provide detailed information about group structure. Under suitable circumstances a finitely presented group can be shown to be soluble and its complete derived series can be determined, using what is in effect a soluble quotient algorithm.
Create a lesson
Related papers
Invariant random subgroups of the finitary special linear group over a finite field
Noam Atar, Arie Levit
Vanishing-set inclusion and character degrees in finite p-groups
Zhi-Lin Zhang
Singular Loci of SL2(C)-Representation Varieties of Non-Hopfian Baumslag--Solitar Groups
S. Liriano
Finite groups with all involutions fused
Zheng Guo, Yan Zhou Zhu
A complete description of the algebraic structure of pseudocompact abelian groups
Dikran Dikranjan, Alejandro Dorantes-Aldama, Dmitri Shakhmatov
Constructing free subgroups of matrix groups
Emmanuel Breuillard, Bettina Eick, Tommy Hofmann et al.