A data structure for a uniform approach to computations with finite groups

DOI10.1145/1145768.1145811zbMath1356.68291OpenAlexW2020801138MaRDI QIDQ2958996

Max Neunhöffer, Seress, Ákos

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1145768.1145811

zbMATH Keywords

GAPcomputational group theoryconstructive membershipblack-box grouplarge-base groupmatrix group algorithmpermutation group algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract finite groups (20D99) Data structures (68P05)

Related Items

Fast recognition of alternating groups of unknown degree. ⋮ Minimal and random generation of permutation and matrix groups. ⋮ Computing conjugacy classes of elements in matrix groups. ⋮ Algorithms for arithmetic groups with the congruence subgroup property. ⋮ A practical model for computation with matrix groups. ⋮ A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup ⋮ The use of permutation representations in structural computations in large finite matrix groups ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Large element orders and the characteristic of Lie-type simple groups. ⋮ Linear groups and computation

Uses Software

• GAP
• Magma