Automorphism group computation and isomorphism testing in finite groups

DOI10.1016/S0747-7171(02)00133-5zbMATH Open1032.20016MaRDI QIDQ1401150FDOQ1401150

John J. Cannon, Derek F. Holt

Publication date: 17 August 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmsautomorphism groupspermutation groupsisomorphism testing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Automorphisms of abstract finite groups (20D45) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Magma algebra system. I: The user language
• CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
• On minimal faithful permutation representations of finite groups
• Standard generators for sporadic simple groups
• Fundamental algorithms for permutation groups
• Computing with endomorphism rings of modular representations
• Über ein Programm zu Berechnung der Automorphismengruppe einer endlichen Gruppe
• On normal subgroups which are direct products
• Computing chief series, composition series and socles in large permutation groups
• Computing the subgroups of a permutation group

Cited In (29)

• Computing conjugacy classes of elements in matrix groups.
• CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
• Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field
• The automorphism group of a finitely generated virtually abelian group.
• Title not available (Why is that?)
• Calculating subgroups with GAP
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• Filters compatible with isomorphism testing
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• Another Existence and Uniqueness Proof of the Tits Group
• Quadratic points on modular curves
• Algorithms for Group Isomorphism via Group Extensions and Cohomology
• Computing automorphisms of semigroups.
• Symmetries of knowledge bases
• Computing the soluble radical of a permutation group.
• Thompson's sporadic group uniquely determined by the centralizer of a 2-central involution.
• The perfect groups of order up to two million
• Efficient characteristic refinements for finite groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Isotypeness of models and knowledge bases equivalence
• Computing maximal subgroups of finite groups.
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• Constructing Groups of ‘Small’ Order: Recent Results and Open Problems
• Computing Hall subgroups of finite groups
• Computing conjugacy class representatives in permutation groups.
• Count-free Weisfeiler-Leman and group isomorphism
• Isomorphism testing for \(p\)-groups

Uses Software

• GAP
• Magma
• Cayley

This page was built for publication: Automorphism group computation and isomorphism testing in finite groups

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