CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS

DOI10.1081/AGB-120003468zbMath1006.20001OpenAlexW2068948309MaRDI QIDQ4551080

Bettina Eick, E. A. O'Brien, Charles R. Leedham-Green

Publication date: 10 December 2002

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/agb-120003468

zbMATH Keywords

algorithmsautomorphism groups\(p\)-groupscomputationlower central series

Mathematics Subject Classification ID

Series and lattices of subgroups (20D30) Automorphisms of abstract finite groups (20D45) Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (27)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ The automorphism group of a finitely generated virtually abelian group. ⋮ A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS ⋮ The automorphism group of a finite \(p\)-group is almost always a \(p\)-group. ⋮ Tensor isomorphism by conjugacy of Lie algebras ⋮ Computing automorphisms of semigroups. ⋮ Constructing Groups of ‘Small’ Order: Recent Results and Open Problems ⋮ Efficient characteristic refinements for finite groups ⋮ The Solvable Primitive Permutation Groups of Degree at Most 6560 ⋮ Automorphism group computation and isomorphism testing in finite groups ⋮ ON -GROUPS WITH AUTOMORPHISM GROUPS RELATED TO THE CHEVALLEY GROUP ⋮ Filters compatible with isomorphism testing ⋮ CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS ⋮ On p-groups with automorphism groups related to the exceptional Chevalley groups ⋮ Unnamed Item ⋮ On the uniqueness of the generalized octagon of order \((2,4)\) ⋮ Computing isometry groups of Hermitian maps ⋮ Duality between p-groups with three characteristic subgroups and semisimple anti-commutative algebras ⋮ A fast isomorphism test for groups whose Lie algebra has genus 2 ⋮ Code loops in dimension at most \(8\) ⋮ Maximal linear groups induced on the Frattini quotient of a \(p\)-group ⋮ Computing automorphism groups and testing isomorphisms for modular group algebras. ⋮ Finite 3-groups of class 3 whose elements commute with their automorphic images. ⋮ Automorphism groups of 2-groups. ⋮ Computing \(p\)-groups with trivial Schur multiplicator. ⋮ Testing isomorphism of graded algebras ⋮ Decomposing \(p\)-groups via Jordan algebras.

Uses Software

• GAP
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximal subgroups of the finite classical groups
• The groups of order 256
• Computing the order of a solvable permutation group
• Fundamental algorithms for permutation groups
• Isomorphisms of modular group algebras: An algorithm and its application to groups of order \(2^ 6\)
• Isomorphism testing for \(p\)-groups
• The Magma algebra system. I: The user language
• Automorphism group computation and isomorphism testing in finite groups
• The \(p\)-group generation algorithm
• Subgroups of \(\text{GL}_n(q)\) which fix sublattices of the subspace lattice
• Über ein Programm zu Berechnung der Automorphismengruppe einer endlichen Gruppe
• THE GROUPS OF ORDER qⁿ· p
• Almost all 𝑝-groups have automorphism group a 𝑝-group
• APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
• Presentations of some 3-transposition groups
• Generating random elements of a finite group
• Endliche Gruppen I

This page was built for publication: CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS