An Algorithm for Finding the Blocks of a Permutation Group
From MaRDI portal
Publication:4068903
DOI10.2307/2005304zbMath0311.20004OpenAlexW4244409160MaRDI QIDQ4068903
No author found.
Publication date: 1975
Full work available at URL: https://doi.org/10.2307/2005304
Software, source code, etc. for problems pertaining to group theory (20-04) Permutation groups (20B99)
Related Items
Parallel algorithms for solvable permutation groups, On the existence of branched coverings between surfaces with prescribed branch data. I, Efficient algorithmic learning of the structure of permutation groups by examples, Isomorphism of graphs of bounded valence can be tested in polynomial time, Ground resolution with group computations on semantic symmetries, Interpreting inequality measures in a Harsanyi framwork, Computing the composition factors of a permutation group in polynomial time, Computing with groups and their character tables, Algorithms for matrix groups and the Tits alternative, Extremal and game-theoretic characterizations of the probabilistic approach to income redistribution, Graph isomorphism problem, Effective computation with group homomorphisms, Solvability by radicals is in polynomial time