On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations

DOI10.2307/2006206zbMath0444.20001OpenAlexW3216859064MaRDI QIDQ3887632

Jeffrey S. Leon

Publication date: 1980

Full work available at URL: https://doi.org/10.2307/2006206

zbMATH Keywords

presentationscoset representativesstrong generating setorbits of a permutation groupordered baseSchreier-Todd-Coxeter-Sims method

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) General theory for infinite permutation groups (20B07) Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05)

Related Items

A general backtrack algorithm for the isomorphism problem of combinatorial objects, Discrete logarithms for finite groups, Computing in permutation and matrix groups. III: Sylow subgroups, Computing the order of a solvable permutation group, Self-dual codes over GF(5), A proof of Holt's algorithm, An algorithm for finding minimal generating sets of finite groups, Fast recognition of doubly transitive groups, A strong generating test and short presentations for permutation groups, Computing with group homomorphisms, Permutation group algorithms based on partitions. I: Theory and algorithms, Symmetric ILP: Coloring and small integers, An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, Finite groups, Processor interconnection networks from Cayley graphs, Some results on quotients of triangle groups, The Canon package: a fast kernel for tensor manipulators, A computer-assisted analysis of some matrix groups., Use of computers in solving well-known algebra problems, Computing with groups and their character tables, Unnamed Item, A computer program for the calculation of a covering group of a finite group, Effective computation with group homomorphisms, The mechanical computation of first and second cohomology groups

Cites Work

• The multipliers of the simple groups of order 604,800 and 50, 232,960
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Defining relations for the Held-Higman-Thompson simple group
• ABSTRACT DEFINITIONS FOR THE MATHIEU GROUPS
• A practical method for enumerating cosets of a finite abstract group
• Unnamed Item
• Unnamed Item