Fundamental algorithms for permutation groups

DOI10.1007/3-540-54955-2zbMath0785.20001OpenAlexW1566679152WikidataQ56092199 ScholiaQ56092199MaRDI QIDQ1202170

Gregory Butler

Publication date: 23 January 1993

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54955-2

zbMATH Keywords

finite soluble groupspolycyclic presentationsrepresentation theoryfinitely presented groupsbacktrack searchbase change\(p\)-groupscomposition seriesprimitivitycomputational group theorydouble coset enumerationalgorithms for permutation groupsgroup theoretical algorithmsregularity tests

Mathematics Subject Classification ID

Related Items (36)

Algorithmic Recognition of Group Actions on Orbitals ⋮ On the orbit-stabilizer problem for integral matrix actions of polycyclic groups ⋮ Graph products of groups and group spaces ⋮ A use of ideal decomposition in the computer algebra of tensor expressions ⋮ CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS ⋮ Computing in groups of Lie type ⋮ The Steiner triple systems of order 19 ⋮ A modular method for computing the Galois groups of polynomials ⋮ Computing maximal subgroups of finite groups. ⋮ Permutative rewriting and unification ⋮ A database of groups of prime‐power order ⋮ Nonsingular cubic surfaces over F2k ⋮ Automorphism group computation and isomorphism testing in finite groups ⋮ Canonical representation of polynomial expressions with indices ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Towards a universal set of topologically protected gates for quantum computation with Pfaffian qubits ⋮ Symmetric ILP: Coloring and small integers ⋮ Ground resolution with group computations on semantic symmetries ⋮ On leaf permutative theories and occurrence permutation groups ⋮ Computing the subgroups of a permutation group ⋮ A new existence proof for \(Ly\), the sporadic simple group of R. Lyons ⋮ Computation of the decomposition group of a triangular ideal ⋮ Extending Symmetry Reduction Techniques to a Realistic Model of Computation ⋮ On the complexity of deduction modulo leaf permutative equations ⋮ On the constructive orbit problem ⋮ The Canon package: a fast kernel for tensor manipulators ⋮ xPerm: fast index canonicalization for tensor computer algebra ⋮ Computing projectors, injectors, residuals and radicals of finite soluble groups ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Minimizing representations over number fields. II: Computations in the Brauer group. ⋮ Algorithms for Function Fields ⋮ NATURAL EXISTENCE PROOF FOR LYONS SIMPLE GROUP ⋮ Algorithms for matrix groups and the Tits alternative ⋮ Error-correcting codes from permutation groups ⋮ On the construction of the finite simple groups with a given centralizer of a 2-central involution ⋮ Faster tensor canonicalization

This page was built for publication: Fundamental algorithms for permutation groups