A unified approach to computations with permutation and matrix groups.

zbMATH Open1117.20001MaRDI QIDQ5489375FDOQ5489375

Authors: Ákos Seress 

Publication date: 26 September 2006

Recommendations

• scientific article; zbMATH DE number 96388
• scientific article; zbMATH DE number 77937
• A data structure for a uniform approach to computations with finite groups
• scientific article; zbMATH DE number 4057754
• The use of permutation representations in structural computations in large finite matrix groups

zbMATH Keywords

computationstraight line programspermutation groupsmatrix groupscomputational group theorypermutation group algorithmsmatrix group algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04)

Cited In (11)

• An Improvement of a Function Computing Normalizers for Permutation Groups
• A data structure for a uniform approach to computations with finite groups
• Large element orders and the characteristic of Lie-type simple groups.
• A practical model for computation with matrix groups.
• Title not available (Why is that?)
• Black box exceptional groups of Lie type. II.
• Title not available (Why is that?)
• Normalizers of \(p\)-subgroups in finite groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The use of permutation representations in structural computations in large finite matrix groups

This page was built for publication: A unified approach to computations with permutation and matrix groups.

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