Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach

DOI10.1112/S1461157000000826zbMath1053.20032MaRDI QIDQ4827588

Birgit Reinert, Dirk Zeckzer

Publication date: 18 November 2004

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.lms.ac.uk/jcm/4/lms2000-010/

zbMATH Keywords

finitely presented groups; monoid rings; Todd-Coxeter coset enumeration; string rewriting systems; Gröbner bases computations; Knuth-Bendix rewriting procedures

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20F05: Generators, relations, and presentations of groups

20M05: Free semigroups, generators and relations, word problems

20-04: Software, source code, etc. for problems pertaining to group theory

20M25: Semigroup rings, multiplicative semigroups of rings

Cites Work

• Unnamed Item
• Constructing matrix representations of finitely presented groups
• The Knuth-Bendix procedure for strings as a substitute for coset enumeration
• MRC -- data structures and procedures for computing in monoid and group rings
• The Magma algebra system. I: The user language
• On a Class of Finitely Presented Groups
• Implementation and Analysis of the Todd-Coxeter Algorithm
• A practical method for enumerating cosets of a finite abstract group
• The Abstract Groups G m,n,p