Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach
From MaRDI portal
finitely presented groupsGröbner bases computationsKnuth-Bendix rewriting proceduresmonoid ringsstring rewriting systemsTodd-Coxeter coset enumeration
Software, source code, etc. for problems pertaining to group theory (20-04) Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Semigroup rings, multiplicative semigroups of rings (20M25) Symbolic computation and algebraic computation (68W30)
Recommendations
Cites work
- A practical method for enumerating cosets of a finite abstract group
- Constructing matrix representations of finitely presented groups
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- 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)