A compact representation for permutation groups

DOI10.1016/0196-6774(86)90038-6MaRDI QIDQ3731029zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mark Jerrum

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90038-6

zbMATH Keywords

data structureefficient algorithm for generating systems of cosetefficient algorithm for generating systems of coset representativesfast membership testingisomorph rejectionrepresentatives

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient representation of perm groups
• Fast Management of Permutation Groups I
• scientific article; zbMATH DE number 1004935
• Permutation group algorithms based on partitions. I: Theory and algorithms
• scientific article; zbMATH DE number 123361

Cited in

(31)

• Efficient representation of perm groups
• Fast recognition of doubly transitive groups
• A strong generating test and short presentations for permutation groups
• Permutation group algorithms based on partitions. I: Theory and algorithms
• New methods for using Cayley graphs in interconnection networks
• Graph isomorphism is low for PP
• Constructing permutation representations for matrix groups
• Minimal and canonical images
• Partitions and permutations
• Chains of subsemigroups
• Faster tensor canonicalization
• Space efficient representations of finite groups
• Compact data structures for Dedekind groups and finite rings
• Succinct representations of finite groups
• On the membership problem for finite automata over symmetric groups
• Symmetry robust memory management of multidimensional arrays
• Effective Invariant Theory of Permutation Groups Using Representation Theory
• A data structure for a uniform approach to computations with finite groups
• Generating Permutation Groups
• Expanding Generating Sets for Solvable Permutation Groups
• Generation of Colourings and Distinguishing Colourings of Graphs
• On the length of subgroup chains in the symmetric group
• scientific article; zbMATH DE number 475372 (Why is no real title available?)
• scientific article; zbMATH DE number 2038722 (Why is no real title available?)
• Finding the smallest image of a set
• scientific article; zbMATH DE number 2151183 (Why is no real title available?)
• A method for building permutation representations of finitely presented groups
• Generation modulo the action of a permutation group
• Computational complexity of computing symmetries in finite-domain planning
• Discrete groups of slow subgroup growth
• Computing the order of a solvable permutation group

This page was built for publication: A compact representation for permutation groups

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