Constructing matrix representations of finitely presented groups

DOI10.1016/S0747-7171(08)80095-8zbMath0789.20002MaRDI QIDQ1192225

S. Singh

Publication date: 27 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmfinitenessefficiencycomputational methodsmatrix representationfinitely presented groupsimplementationpermutation representationcomputational group theoryfinite set of generatorsfactor groupsenumeration of cosetssoluble quotient algorithmTodd-Coxeter method

Mathematics Subject Classification ID

Related Items (5)

A note on applications of the `Vector Enumerator' algorithm. ⋮ Termination for a class of algorithms for constructing algebras given by generators and relations ⋮ Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach ⋮ Constructing irreducible representations of finitely presented algebras ⋮ On vector enumeration

Uses Software

• GAP

Cites Work

• Double coset enumeration
• Implementation and Analysis of the Todd-Coxeter Algorithm
• A practical method for enumerating cosets of a finite abstract group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing matrix representations of finitely presented groups