Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach
From MaRDI portal
monoid ringsfinitely presented groupsTodd-Coxeter coset enumerationstring rewriting systemsGröbner bases computationsKnuth-Bendix rewriting procedures
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Semigroup rings, multiplicative semigroups of rings (20M25) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)
Recommendations
Cites work
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- A practical method for enumerating cosets of a finite abstract group
- Constructing matrix representations of finitely presented groups
- Implementation and Analysis of the Todd-Coxeter Algorithm
- MRC -- data structures and procedures for computing in monoid and group rings
- On a Class of Finitely Presented Groups
- The Abstract Groups G m,n,p
- The Knuth-Bendix procedure for strings as a substitute for coset enumeration
- The Magma algebra system. I: The user language
Cited in
(3)
This page was built for publication: Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4827588)