A practical method for enumerating cosets of a finite abstract group
From MaRDI portal
Cited in
(53)- Symmetric representation of the elements of the Conway group \(.0\).
- A catalogue of complete group presentations
- On doing Todd-Coxeter coset enumeration in parallel
- Constructing matrix representations of finitely presented groups
- The Knuth-Bendix procedure for strings as a substitute for coset enumeration
- On a class of semigroups with symmetric presentations
- Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen
- Syntactic and Rees indices of subsemigroups
- The finiteness of finitely presented monoids
- Computing left Kan extensions.
- A conjectural extension of Hecke's converse theorem
- Virtual links with finite medial bikei
- Donald in wonderland: the many-faceted life of H. S. M. Coxeter
- Reidemeister-Schreier type rewriting for semigroups
- Matrix semigroups -- generators and relations
- Degröbnerization: a political manifesto
- Proper locally spherical hypertopes of hyperbolic type
- Automatic semigroups and categories.
- Eine Kennzeichnung der symphatischen und orthogonalen Gruppen über \(GF(4)\)
- Eine Kennzeichnung der symplektischen und orthogonalen Gruppen über GF(4). (A characterization of the symplectic and orthogonal groups over GF(4))
- \(N\)-quandles of links
- Polynomial time multiplication and normal forms in free bands
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
- Coset enumeration for certain infinitely presented groups.
- Combinatorial method in the coset enumeration of symmetrically generated groups
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Algorithms for finitely L-presented groups and their applications to some self-similar groups.
- Alternating subgroups of Coxeter groups and their spinor extensions.
- Implementation and Analysis of the Todd-Coxeter Algorithm
- An algorithm for determining defining relations of a subgroup
- Generators and relations of direct products of semigroups
- Proving a group trivial made easy: A case study in coset enumeration
- An enumeration process for racks
- Induced representations and traces for chains of affine and cyclotomic Hecke algebras.
- Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach
- Certain one-relator products of semigroups
- Commutator subgroups of singular braid groups
- A method for building permutation representations of finitely presented groups
- Search problems in groups and branching processes.
- THE MANIFESTATION OF GROUP ENDS IN THE TODD–COXETER COSET ENUMERATION PROCEDURE
- On \(n\)-Engel pair satisfying certain conditions.
- Finite n-quandles of torus and two-bridge links
- An explicit algorithm for normal forms in small overlap monoids
- The Todd-Coxeter algorithm for semigroups and monoids
- \(N\)-quandles of spatial graphs
- Computing classical modular forms for arbitrary congruence subgroups
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- Heights of one- and two-sided congruence lattices of semigroups
- Scalable parallel coset enumeration: bulk definition and the memory wall
- Computational group theory: bedrock and new frontiers
- The collineation groups of the finite affine and projective planes with four lines through each point
- The origins of combinatorics on words
- An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
This page was built for publication: A practical method for enumerating cosets of a finite abstract group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5763841)