A method for building permutation representations of finitely presented groups

DOI10.1090/conm/694/13957zbMath1448.20030arXiv1605.00797OpenAlexW2963309284MaRDI QIDQ5138285

No author found.

Publication date: 3 December 2020

Published in: Finite Simple Groups: Thirty Years of the Atlas and Beyond (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Permutation groups (20B99) Computational methods for problems pertaining to group theory (20-08)

Uses Software

• Magma

Cites Work

• An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
• An \(L_2\)-quotient algorithm for finitely presented groups.
• Towards a soluble quotient algorithm
• Subgroups of the (2,3,7) triangle group
• The Magma algebra system. I: The user language
• Alternating quotients of Fuchsian groups
• SUBGROUPS OF FINITE INDEX IN (2, 3, n)-TRIANGLE GROUPS
• Determining Subgroups of a Given Finite Index in a Finitely Presented Group
• Generators for Alternating and Symmetric Groups
• MORE ON GENERATORS FOR ALTERNATING AND SYMMETRIC GROUPS
• A Cohomological Criterion for a Finitely Presented Group to be Infinite
• Alternating quotients of the (3._q.r) triangle groups
• Permutation Representations of the Symmetry Groups of Regular Hyperbolic Tessellations
• Subgroups of Fuchsian Groups and Finite Permutation Groups
• A practical method for enumerating cosets of a finite abstract group
• Unnamed Item
• Unnamed Item
• Unnamed Item