The use of permutation representations in structural computations in large finite matrix groups

DOI10.1016/J.JSC.2018.09.001MaRDI QIDQ2000260zbMATHOpenAlexFDO

Authors John J. Cannon, W. R. Unger, Derek F. Holt

Publication date 28 June 2019

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/108208/13/WRAP-use-permutation-representations-structural-computations-matrix-Holt-2018.pdf

zbMATH Keywords

permutation representationfinite matrix groupstructural computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Other matrix groups over finite fields (20H30) Representation theory of groups (20C99) Computational methods for problems pertaining to group theory (20-08)

Recommendations

• Constructing permutation representations for matrix groups
• Efficient representation of perm groups
• scientific article; zbMATH DE number 96388
• scientific article; zbMATH DE number 1254259
• A unified approach to computations with permutation and matrix groups.

Cites work

• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• scientific article; zbMATH DE number 1099519 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 1431691 (Why is no real title available?)
• scientific article; zbMATH DE number 1431695 (Why is no real title available?)
• scientific article; zbMATH DE number 3341276 (Why is no real title available?)
• scientific article; zbMATH DE number 3392741 (Why is no real title available?)
• A data structure for a uniform approach to computations with finite groups
• A practical model for computation with matrix groups.
• Computing conjugacy classes of elements in matrix groups.
• Computing maximal subgroups of finite groups.
• Computing subgroups of bounded index in a finite group.
• Computing the character table of a finite group.
• Computing the subgroups of a permutation group
• Minimal degree for a permutation representation of a classical group
• Minimal permutation representations of finite simple classical groups. Special linear, symplectic, and unitary groups
• Minimal permutation representations of finite simple orthogonal groups
• On minimal faithful permutation representations of finite groups
• On the Overgroups of Irreducible Subgroups of the Finite Classical Groups
• On the maximum orders of elements of finite almost simple groups and primitive permutation groups.
• Polynomial-time theory of matrix groups
• Recognizing finite matrix groups over infinite fields.
• Reliability and reproducibility of Atlas information
• Selecting base points for the Schreier-Sims algorithm for matrix groups
• The Magma algebra system. I: The user language

Cited in

(8)

• scientific article; zbMATH DE number 1254259 (Why is no real title available?)
• SUBGROUPS WITH NO ABELIAN COMPOSITION FACTORS ARE NOT DISTINGUISHED
• A unified approach to computations with permutation and matrix groups.
• A data structure for a uniform approach to computations with finite groups
• Efficient representation of perm groups
• A method for building permutation representations of finitely presented groups
• Constructing permutation representations for matrix groups
• scientific article; zbMATH DE number 96388 (Why is no real title available?)

Describes a project that uses

Uses Software

• GAP
• Magma
• matrixss
• recog
• ATLAS Group Representations

This page was built for publication: The use of permutation representations in structural computations in large finite matrix groups

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