scientific article; zbMATH DE number 3871623

zbMATH Open0547.20012MaRDI QIDQ3338422FDOQ3338422

Authors: Reinhard Laue, Joachim Neubüser, Ulrich Schoenwaelder 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• Intersecting subgroups of finite soluble groups
• Computing intersections and normalizers in soluble groups
• Some remarks on the computation of complements and normalizers in soluble groups
• Algorithms for finite soluble groups and applications
• Some remarks on the computation of conjugacy classes of soluble groups

zbMATH Keywords

algorithmscentralizersnormalizersSylow subgroupsconjugacy classessoluble groupscomposition seriesmaximal abelian subgroupsintersections of subgroupsSOGOS

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Finite nilpotent groups, (p)-groups (20D15) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)

Cited In (43)

• Computing conjugacy classes of elements in matrix groups.
• Algorithms to solve absolute orientation problem for GL(3), O(3), and SO(3) groups
• Special polycyclic generating sequences for finite soluble groups.
• Computing subgroups by exhibition in finite solvable groups
• The modular group algebra of a central-elementary-by-abelian p-group
• The groups of order 128
• Some remarks on the computation of complements and normalizers in soluble groups
• An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
• Parallel complexity for nilpotent groups
• Computing double cosets in soluble groups
• Non-commutative lattice problems
• The primitive soluble permutation groups of degree less than 256
• Title not available (Why is that?)
• Computing in permutation and matrix groups. III: Sylow subgroups
• Calculating subgroups with GAP
• Computing projectors, injectors, residuals and radicals of finite soluble groups
• Computational approaches to the theory of finite soluble groups
• Algorithms for finite soluble groups and applications
• On Galois groups and their maximal 2-subgroups
• Obituary: Joachim Neubüser (1932--2021)
• On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
• An algorithm for solving the factorization problem in permutation groups
• Construction of discrete structures, especially isomers
• Towards a soluble quotient algorithm
• Integrality and arithmeticity of solvable linear groups.
• Title not available (Why is that?)
• Normalizers of \(p\)-subgroups in finite groups.
• Short presentations for three-dimensional unitary groups.
• Mod \(2\) group algebras with metabelian unit groups
• Collection from the left and other strategies
• A proof of Holt's algorithm
• Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
• Double coset enumeration
• Computing with group homomorphisms
• Title not available (Why is that?)
• The \(p\)-group generation algorithm
• Units in the modular group algebra of a finite Abelian p-group
• Algorithms for polycyclic-by-finite groups
• Computing modular and projective character degrees of soluble groups
• Some remarks on the computation of conjugacy classes of soluble groups
• Constructing normalisers in finite soluble groups
• Intersecting subgroups of finite soluble groups
• Computing intersections and normalizers in soluble groups

This page was built for publication:

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