scientific article; zbMATH DE number 682071
From MaRDI portal
Publication:4312071
zbMath0833.20021MaRDI QIDQ4312071
Publication date: 12 March 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reducibilityfinite groupsrepresentationscomputer algebra systemsirreducibility criterionMeataxe algorithm
Modular representations and characters (20C20) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Minimal discriminants for fields with small Frobenius groups as Galois groups. ⋮ Tensor isomorphism by conjugacy of Lie algebras ⋮ Prime power graphs for groups of Lie type ⋮ Semisymmetric elementary Abelian covers of the Möbius-Kantor graph ⋮ Minimizing representations over number fields. ⋮ Constructing homomorphism spaces and endomorphism rings. ⋮ Identification of matrix generators of a Chevalley group. ⋮ Random multiplication approaches uniform measure in finite groups ⋮ Groups acting on tensor products. ⋮ The strong approximation theorem and computing with linear groups ⋮ Recognising the small Ree groups in their natural representations. ⋮ Constructing composition factors for a linear group in polynomial time ⋮ Automorphism group computation and isomorphism testing in finite groups ⋮ Proportion of cyclic matrices in maximal reducible matrix algebras ⋮ Constructive recognition of classical groups in even characteristic. ⋮ A counterexample to a conjugacy conjecture of Steinberg ⋮ Constructive recognition of classical groups in their natural representation. ⋮ The module isomorphism problem reconsidered. ⋮ Efficient decomposition of separable algebras. ⋮ Computing isometry groups of Hermitian maps ⋮ An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators. ⋮ A practical model for computation with matrix groups. ⋮ An algorithm for constructing representations of finite groups. ⋮ Computing subgroups of bounded index in a finite group. ⋮ Efficient decomposition of associative algebras over finite fields ⋮ Constructive Sylow theorems for the classical groups. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Writing representations over proper division subrings. ⋮ Computing automorphism groups and testing isomorphisms for modular group algebras. ⋮ Testing isomorphism of modules. ⋮ Determination of socle series using the condensation method ⋮ Elementary abelian covers of graphs ⋮ Invariant subspaces, duality, and covers of the Petersen graph ⋮ The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices ⋮ Recognising the Suzuki groups in their natural representations. ⋮ Computing projectors, injectors, residuals and radicals of finite soluble groups ⋮ Primary cyclic matrices in irreducible matrix subalgebras ⋮ Construction of the irreducible modular representations of a finite group ⋮ The Restricted Ermolaev Algebra and F4 ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Towards an efficient meat-axe algorithm using \(f\)-cyclic matrices: The density of uncyclic matrices in M\((n,q)\) ⋮ Decomposing homogeneous modules of finite groups in characteristic zero. ⋮ Testing modules of groups of even order for simplicity ⋮ Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules. ⋮ Algorithms for matrix groups and the Tits alternative ⋮ Generalized persistence algorithm for decomposing multiparameter persistence modules ⋮ Finding the radical of matrix algebras using Fitting decompositions ⋮ Writing projective representations over subfields.
