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

DOI10.1016/J.JSC.2018.09.001zbMATH Open1453.20001OpenAlexW2891478563MaRDI QIDQ2000260FDOQ2000260

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

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)

Cites Work

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

Cited In (5)

• SUBGROUPS WITH NO ABELIAN COMPOSITION FACTORS ARE NOT DISTINGUISHED
• Constructing permutation representations for matrix groups
• Efficient representation of perm groups
• Title not available (Why is that?)
• Title not available (Why is that?)

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)