scientific article; zbMATH DE number 3702903

MaRDI QIDQ3895641zbMATH OpenFDO

Authors Charles C. Sims

Publication date 1971

zbMATH Keywords

Sims' algorithmsstrong generating set of a permutation group

Mathematics Subject Classification ID

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

Cited in

(34)

• On the subgroup distance problem.
• Linear optimization over permutation groups
• Effective computation with group homomorphisms
• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• Computing in permutation and matrix groups. III: Sylow subgroups
• Efficient representation of perm groups
• The computation of normalizers in permutation groups
• New methods for using Cayley graphs in interconnection networks
• Processor interconnection networks from Cayley graphs
• Algorithms for matrix groups and the Tits alternative
• On the fixing sets of dihedral groups
• On base sizes for almost simple primitive groups
• Subcomplete generalizations of graph isomorphism
• Disjoint direct product decompositions of permutation groups
• Perfect refiners for permutation group backtracking algorithms
• Construction of the irreducible modular representations of a finite group
• Simple groups, fixed point ratios and applications
• On the diameter of permutation groups.
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• Generation of Colourings and Distinguishing Colourings of Graphs
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Algorithms for polycyclic-by-finite groups
• Graph isomorphism is low for PP
• Growth in groups: ideas and perspectives
• Base sizes for sporadic simple groups.
• Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups
• Linear space data structures for finite groups with constant query-time
• Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\)
• Finding cycle types in permutation groups with few generators
• Computational group theory. Abstracts from the workshop held June 1--6, 2025
• Complexity classes of equivalence problems revisited
• Subgroup membership in GL\((2,\mathbb{Z})\)
• Computing finite index congruences of finitely presented semigroups and monoids
• Computing with groups and their character tables

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895641)