A unified approach to computations with permutation and matrix groups.

MaRDI QIDQ5489375zbMATH OpenFDO

Authors Ákos Seress

Publication date 26 September 2006

zbMATH Keywords

computationcomputational group theorymatrix group algorithmsmatrix groupspermutation group algorithmspermutation groupsstraight line programs

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Normalizers of \(p\)-subgroups in finite groups.
• The use of permutation representations in structural computations in large finite matrix groups
• A data structure for a uniform approach to computations with finite groups
• scientific article; zbMATH DE number 3884358 (Why is no real title available?)
• scientific article; zbMATH DE number 4057754 (Why is no real title available?)
• scientific article; zbMATH DE number 1254259 (Why is no real title available?)
• Black box exceptional groups of Lie type. II.
• A practical model for computation with matrix groups.
• scientific article; zbMATH DE number 784873 (Why is no real title available?)
• An Improvement of a Function Computing Normalizers for Permutation Groups
• Large element orders and the characteristic of Lie-type simple 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)