Algorithms determining finite simple images of finitely presented groups

DOI10.1007/S00222-019-00892-3zbMATH Open1446.20051arXiv1710.07183OpenAlexW2963134988WikidataQ105335391 ScholiaQ105335391MaRDI QIDQ2326469FDOQ2326469

Authors: Martin R. Bridson, David M. Evans, Martin W. Liebeck, Dan Segal 

Publication date: 7 October 2019

Published in: Inventiones Mathematicae (Search for Journal in Brave)

Abstract: We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative results. For a collection of finite simple groups that contains infinitely many alternating groups, or contains classical groups of unbounded dimensions, we prove that there is no such algorithm. On the other hand, for families of simple groups of Lie type of bounded rank, we obtain positive results. For example, given any fixed untwisted Lie type $X$ there is an algorithm that determines whether or not an arbitrary finitely presented group has infinitely many simple images isomorphic to $X(q)$ for some $q$, and if there are finitely many, the algorithm determines them.

Full work available at URL: https://arxiv.org/abs/1710.07183

Recommendations

• Simple groups in computational group theory
• Algorithms for the Tits alternative and related problems.
• On the finite simple images of free products of finite groups
• Algorithmically finite groups.
• Towards a soluble quotient algorithm

zbMATH Keywords

decision problemsfinite simple groupalgorithms in group theoryfinite quotients of finitely generated groups

Mathematics Subject Classification ID

Simple groups: alternating groups and groups of Lie type (20D06) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• The maximal subgroups of the low-dimensional finite classical groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The elementary theory of finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• An \(L_2\)-quotient algorithm for finitely presented groups.
• Strong approximation for Zariski dense subgroups over arbitrary global fields
• Title not available (Why is that?)
• On the subgroup structure of exceptional groups of Lie type
• Solving diophantine problems over all residue class fields of a number field and all finite fields
• Normal Subgroup Growth of Linear Groups: the (G2; F4;E8)-Theorem
• On the subgroup structure of classical groups
• Subgroups generated by root elements in groups of Lie type
• An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
• The triviality problem for profinite completions
• Primitive permutation groups of bounded orbital diameter.
• Subgroups of exceptional algebraic groups which are irreducible on an adjoint or minimal module
• On the congruence-subgroup problem for some anisotropic algebraic groups over number fields.
• Effective counting of the points of definable sets over finite fields
• Direct twisted Galois stratification
• A residual property of certain free products
• ACFA and measurability
• Residual properties of the modular group and other free products.
• Title not available (Why is that?)

Cited In (6)

• Universal covers of finite groups
• An algorithm for determining the simplicity of a modular group representation
• Title not available (Why is that?)
• Computing stable epimorphisms onto finite groups
• Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients
• An \(L_2\)-quotient algorithm for finitely presented groups.

This page was built for publication: Algorithms determining finite simple images of finitely presented groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326469)