Publication:4285784

zbMath0828.20001MaRDI QIDQ4285784

Charles C. Sims

Publication date: 20 March 1994

zbMATH Keywords

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

68Q45: Formal languages and automata

20F16: Solvable groups, supersolvable groups

20F05: Generators, relations, and presentations of groups

20F19: Generalizations of solvable and nilpotent groups

20F18: Nilpotent groups

68Q42: Grammars and rewriting systems

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

20D15: Finite nilpotent groups, (p)-groups

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

20-02: Research exposition (monographs, survey articles) pertaining to group theory

Related Items

Proving a group trivial made easy: A case study in coset enumeration, Measuring the tameness of almost convex groups, CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS, On the orbit-stabilizer problem for integral matrix actions of polycyclic groups, Computing the multiplicative group of residue class rings, Computing in groups of Lie type, Applications and adaptations of the low index subgroups procedure, Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach, The Solvable Primitive Permutation Groups of Degree at Most 6560, Computing 2-cocyeles for central extensions and relative difference sets, Invariant tensors for the spin representation of (7), Cocyclic orthogonal designs and the asymptotic existence of cocyclic Hadamard matrices and maximal size relative difference sets with forbidden subgroup of size 2, Computing with quantized enveloping algebras: PBW-type bases, highest-weight modules and \(R\)-matrices, Quantum property testing of group solvability, Finite covers of random 3-manifolds, The origins of combinatorics on words, Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm, The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups, Computing the Schur multiplicator and the nonabelian tensor square of a polycyclic group., Schur multiplicators of infinite pro-\(p\)-groups with finite coclass., Direct construction of code loops., Malcev presentations for subsemigroups of direct products of coherent groups., Syntactic and Rees indices of subsemigroups, Algebraic criteria to decide if a finite group acts effectively on a model aspherical manifold, Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings, The finiteness of finitely presented monoids, Algorithms for matrix groups and the Tits alternative, Computational group theory in St. Petersburg, Recognizing badly presented \(Z\)-modules, Engel elements in groups, Slightly commutative Kleene semigroups, Sliding piece puzzles with oriented tiles, Embedding theorems for non-positively curved polygons of finite groups, Computing left Kan extensions., The virtual Haken conjecture: Experiments and examples, \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata, Constructing a short defining set of relations for a finite group, Stallings foldings and subgroups of free groups, Constructing faithful representations of finitely-generated torsion-free nilpotent groups, Computing subgroups by exhibition in finite solvable groups, DFT-based word normalization in finite supersolvable groups., Recognising tensor-induced matrix groups., Orbit-stabilizer problems and computing normalizers for polycyclic groups., Groups and nilpotent Lie rings whose order is the sixth power of a prime., Reidemeister-Schreier type rewriting for semigroups, Finite index and finite codimension, An algorithmic approach to fundamental groups and covers of combinatorial cell complexes, Practical algorithms for polycyclic matrix groups, A practical algorithm for finding matrix representations for polycyclic groups, Kleinian groups and the rank problem., Computing polycyclic presentations for polycyclic rational matrix groups., String rewriting for double coset systems., Using the Mal'cev correspondence for collection in polycyclic groups., Confluence theory for graphs, Algorithms for computing with nilpotent matrix groups over infinite domains., Reduction of Smith normal form transformation matrices, Computing subgroup presentations, using the coherence arguments of McCammond and Wise., A computer-assisted analysis of some matrix groups., Computing relative Abelian kernels of finite monoids., Integral representations of \(\mathbb{Z}_p\) and fixed point sets of \(p\)-group actions on tori., The Fibonacci length of certain centro-polyhedral groups., The groups with order \(p^7\) for odd prime \(p\)., Computing residue class rings and Picard groups of orders, Symmetric cubic graphs of small girth, Remarks concerning finitely generated semigroups having regular sets of unique normal forms, Representing Subgroups of Finitely Presented Groups by Quotient Subgroups, Commutative images of rational languages and the Abelian kernel of a monoid, Not every 𝑝-group can be generated by elements of the same order, Computing in Nilpotent Matrix Groups, A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model, A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups, Generators and relations of direct products of semigroups, Symbolic Collection using Deep Thought