Fast Management of Permutation Groups I

DOI10.1137/S0097539794229417MaRDI QIDQ4376174zbMATH OpenOpenAlexFDO

Authors László Babai, Ákos Seress, Eugene M. Luks

Publication date 10 February 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794229417

zbMATH Keywords

permutation group algorithmstrong generating set

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• A strong generating test and short presentations for permutation groups
• scientific article; zbMATH DE number 3989617
• scientific article; zbMATH DE number 475368
• Fast Monte Carlo algorithms for permutation groups
• Permutation group algorithms based on partitions. I: Theory and algorithms

Cited in

(39)

• Linear optimization over permutation 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
• An algorithm for solving the factorization problem in permutation groups
• How fast can we compute orbits of groups?
• Minimal and canonical images
• On the degree of transitivity of permutation groups: A short proof
• Fast Monte Carlo algorithms for permutation groups
• Efficient algorithmic learning of the structure of permutation groups by examples
• On short expressions for cosets of permutation subgroups
• Permutation group algorithms based on directed graphs
• Constructing composition factors for a linear group in polynomial time
• Fast recognition of alternating groups of unknown degree.
• A data structure for a uniform approach to computations with finite groups
• A Reduction Algorithm for Large-Base Primitive Permutation Groups
• The complexity of intersecting finite automata having few final states
• A compact representation for permutation groups
• scientific article; zbMATH DE number 3989617 (Why is no real title available?)
• scientific article; zbMATH DE number 4057754 (Why is no real title available?)
• scientific article; zbMATH DE number 4108985 (Why is no real title available?)
• scientific article; zbMATH DE number 1254260 (Why is no real title available?)
• scientific article; zbMATH DE number 475356 (Why is no real title available?)
• scientific article; zbMATH DE number 475368 (Why is no real title available?)
• scientific article; zbMATH DE number 475372 (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?)
• On the automorphism groups of strongly regular graphs. II.
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• Overcoming the memory wall in symbolic algebra
• scientific article; zbMATH DE number 1416476 (Why is no real title available?)
• The simultaneous conjugacy problem in the symmetric group
• scientific article; zbMATH DE number 3373679 (Why is no real title available?)
• Certifying solutions to permutation group problems.
• Experimenting with Symplectic Hypergeometric Monodromy Groups
• Fast computation of the centralizer of a permutation group in the symmetric group
• Polynomial-time algorithms for black-box distributive expanded groups
• Computing the order of a solvable permutation group

This page was built for publication: Fast Management of Permutation Groups I

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