Writing representations over minimal fields

DOI10.1080/00927879708825947MaRDI QIDQ4344674zbMATH OpenOpenAlexFDO

Authors R. B. Howlett, S. P. Glasby

Publication date 7 June 1998

Published in Communications in Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.7236

zbMATH Keywords

absolutely irreducible representationsfinite groupsmatrix representationsmatrix version of Hilbert's Theorem 90probabilistic algorithms

Mathematics Subject Classification ID

Abstract: The chief aim of this paper is to describe a procedure which, given a $d$-dimensional absolutely irreducible matrix representation of a finite group over a finite field $mathbbE$, produces an equivalent representation such that all matrix entries lie in a subfield $mathbbF$ of $mathbbE$ which is as small as possible. The algorithm relies on a matrix version of Hilbert's Theorem 90, and is probabilistic with expected running time $mO(|mathbbE:mathbbF|d^3)$ when $|mathbbF|$ is bounded. Using similar methods we then describe an algorithm which takes as input a prime number and a power-conjugate presentation for a finite soluble group, and as output produces a full set of absolutely irreducible representations of the group over fields whose characteristic is the specified prime, each representation being written over its minimal field.

Recommendations

• Writing projective representations over subfields.
• Writing representations over proper division subrings.
• Computing Irreducible Representations of Finite Groups
• Minimizing representations over number fields.

Cited in

(20)

• Writing representations over proper division subrings.
• Writing projective representations over subfields.
• Minimizing representations over number fields.
• Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
• Revisiting the complex multiplication method for the construction of elliptic curves
• Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields
• \(p\)-groups with a unique proper non-trivial characteristic subgroup.
• Conjugacy of Subgroups of the General Linear Group
• Splitting fields of real irreducible representations of finite groups
• Determining Aschbacher classes using characters.
• LINEAR GROUPS OF SMALL DEGREE OVER FINITE FIELDS
• Constructing class invariants
• IRREDUCIBLE MONOMIAL LINEAR GROUPS OF DEGREE FOUR OVER FINITE FIELDS
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Irreducibility testing of finite nilpotent linear groups.
• Matrices for finite group representations that respect Galois automorphisms
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.
• An algorithm for Lang's theorem.
• Minimizing representations over number fields. II: Computations in the Brauer group.
• Decomposing homogeneous modules of finite groups in characteristic zero.

This page was built for publication: Writing representations over minimal fields

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