A method for building permutation representations of finitely presented groups
From MaRDI portal
Abstract: We design an algorithm to find certain partial permutation representations of a finitely presented group (the bricks) that may be combined to a transitive permutation representation of (the mosaic) on the disjoint union.
Recommendations
Cites work
- A Cohomological Criterion for a Finitely Presented Group to be Infinite
- A practical method for enumerating cosets of a finite abstract group
- Alternating quotients of Fuchsian groups
- Alternating quotients of the (3.q.r) triangle groups
- An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
- An L₂-quotient algorithm for finitely presented groups.
- Determining Subgroups of a Given Finite Index in a Finitely Presented Group
- Generators for Alternating and Symmetric Groups
- scientific article; zbMATH DE number 3435779 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- MORE ON GENERATORS FOR ALTERNATING AND SYMMETRIC GROUPS
- Permutation Representations of the Symmetry Groups of Regular Hyperbolic Tessellations
- Subgroups of finite index in (2,3,n)-triangle groups.
- Subgroups of Fuchsian Groups and Finite Permutation Groups
- Subgroups of the (2,3,7) triangle group
- The Magma algebra system. I: The user language
- Towards a soluble quotient algorithm
Cited in
(5)
This page was built for publication: A method for building permutation representations of finitely presented groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138285)