Fundamental algorithms for permutation groups
DOI10.1007/3-540-54955-2zbMATH Open0785.20001OpenAlexW1566679152WikidataQ56092199 ScholiaQ56092199MaRDI QIDQ1202170FDOQ1202170
Authors: 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
Recommendations
finite soluble groupsrepresentation theoryprimitivitycomposition series\(p\)-groupsbase changefinitely presented groupscomputational group theorypolycyclic presentationsbacktrack searchdouble coset enumerationalgorithms for permutation groupsgroup theoretical algorithmsregularity tests
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to group theory (20-01)
Cited In (46)
- Computation of the decomposition group of a triangular ideal
- On leaf permutative theories and occurrence permutation groups
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Towards a universal set of topologically protected gates for quantum computation with Pfaffian qubits
- An improvement to the centralizer algorithm for permutation groups
- Extending symmetry reduction techniques to a realistic model of computation
- A modular method for computing the Galois groups of polynomials
- Algorithms for permutability in finite groups.
- Title not available (Why is that?)
- Algorithms for Function Fields
- On the complexity of deduction modulo leaf permutative equations
- Non-singular cubic surfaces over \(\mathbb{F}_{2^k}\)
- The Steiner triple systems of order 19
- NATURAL EXISTENCE PROOF FOR LYONS SIMPLE GROUP
- A use of ideal decomposition in the computer algebra of tensor expressions
- A New Base Change Algorithm for Permutation Groups
- Computing projectors, injectors, residuals and radicals of finite soluble groups
- A new existence proof for \(Ly\), the sporadic simple group of R. Lyons
- Ground resolution with group computations on semantic symmetries
- Minimizing representations over number fields. II: Computations in the Brauer group.
- Permutative rewriting and unification
- A database of groups of prime‐power order
- Automorphism group computation and isomorphism testing in finite groups
- Canonical representation of polynomial expressions with indices
- On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
- Computing in groups of Lie type
- GTT—a group theory trainer
- Title not available (Why is that?)
- On the constructive orbit problem
- Faster tensor canonicalization
- Title not available (Why is that?)
- Symmetric ILP: Coloring and small integers
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Finding \(k\) shortest paths in Cayley graphs of finite groups
- The Canon package: a fast kernel for tensor manipulators
- xPerm: fast index canonicalization for tensor computer algebra
- A random base change algorithm for permutation groups
- An adaptive prefix-assignment technique for symmetry reduction
- Algorithms for matrix groups and the Tits alternative
- Introduction to: Computational group theory II
- Computing maximal subgroups of finite groups.
- Algorithmic Recognition of Group Actions on Orbitals
- Graph products of groups and group spaces
- Error-correcting codes from permutation groups
- On the construction of the finite simple groups with a given centralizer of a 2-central involution
- Computing the subgroups of a permutation group
This page was built for publication: Fundamental algorithms for permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1202170)
