Arithmetic in group extensions
Computational methods for problems pertaining to group theory (20-08) Ordinary representations and characters (20C15) Simple groups: sporadic groups (20D08) Extensions, wreath products, and other compositions of groups (20E22) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Finite groups with a non-trivial solvable radical are represented as hybrid groups. More precisely, a group \(G\) with a polycyclic normal subgroup \(B\) and finite quotient \(A=G/B\) is described by a polycyclic presentation for \(B\), a faithful permutation representation and a confluent rewriting system for \(A\), the conjugation action of quotient generators on \(B\) and correction terms encoding the extension. These data yield a confluent rewriting system for \(G\) and normal forms of the shape \(w(\mathcal X)b\). The paper develops algorithms for arithmetic, element orders and membership testing, together with constructions for subgroups, transversals, factor groups and homomorphisms. The implementation in GAP permits the use of existing algorithms based on the solvable-radical paradigm.\N\NThe method is tested on several large extensions and then applied to the maximal subgroup \(2^{10+16}{.}\mathrm{O}_{10}^{+}(2)\) of the Monster. The second cohomology group associated with the relevant \(10\)-dimensional module has dimension \(2\), yielding four candidate extensions. Conjugacy-class and centralizer computations exclude two candidates. Character tables for the remaining two are obtained using inflation, induction from large subgroups, tensor products and LLL reduction. Possible class fusions into the character table of the Monster eliminate one further candidate and identify the required table, which has been added to the GAP Character Table Library.
- A fast implementation of the Monster group. The Monster has been tamed
- A finite soluble quotient algorithm
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Algorithms for polycyclic-by-finite groups
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- Automorphism group computation and isomorphism testing in finite groups
- Collection from the left and other strategies
- Computing conjugacy classes of elements in matrix groups.
- Computing Hall subgroups of finite groups.
- Computing intersections and normalizers in soluble groups
- Computing maximal subgroups of finite groups.
- Computing the character table of a finite group.
- Computing the maximal subgroups of a permutation group. I
- Computing the subgroups of a permutation group
- Dixon's character table algorithm revisited
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- scientific article; zbMATH DE number 5778575 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 1254012 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 194815 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- On complexity of multiplication in finite soluble groups.
- Some remarks on the computation of complements and normalizers in soluble groups
- Some remarks on the computation of conjugacy classes of soluble groups
- Symbolic Collection using Deep Thought
- The algorithmic theory of polycyclic-by-finite groups
- The maximal subgroups of the monster
- The perfect groups of order up to two million
- Towards a soluble quotient algorithm
- Universal covers of finite groups
This page was built for publication: Arithmetic in group extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294311)
