Automorphism group computation and isomorphism testing in finite groups
From MaRDI portal
Publication:1401150
DOI10.1016/S0747-7171(02)00133-5zbMath1032.20016MaRDI QIDQ1401150
Publication date: 17 August 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Automorphisms of abstract finite groups (20D45) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Algorithms for Group Isomorphism via Group Extensions and Cohomology, On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness, The automorphism group of a finitely generated virtually abelian group., Computing automorphisms of semigroups., CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS, Computing maximal subgroups of finite groups., Constructing Groups of ‘Small’ Order: Recent Results and Open Problems, Efficient characteristic refinements for finite groups, Symmetries of knowledge bases, Filters compatible with isomorphism testing, Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting), Another Existence and Uniqueness Proof of the Tits Group, Computing conjugacy classes of elements in matrix groups., Unnamed Item, Quadratic points on modular curves, Isotypeness of models and knowledge bases equivalence, Computing Hall subgroups of finite groups, Thompson's sporadic group uniquely determined by the centralizer of a 2-central involution., Computing conjugacy class representatives in permutation groups., Computing the soluble radical of a permutation group., A New Property of Hamming Graphs and Mesh of d-ary Trees, Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field, Unnamed Item, The perfect groups of order up to two million
Uses Software
Cites Work
- Computing with endomorphism rings of modular representations
- On normal subgroups which are direct products
- Fundamental algorithms for permutation groups
- The Magma algebra system. I: The user language
- Computing chief series, composition series and socles in large permutation groups
- Standard generators for sporadic simple groups
- Über ein Programm zu Berechnung der Automorphismengruppe einer endlichen Gruppe
- On minimal faithful permutation representations of finite groups
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Computing the subgroups of a permutation group
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item