We prove that if $\mathfrak{s}$ is a solvable Lie algebra of matrices over a field of characteristic 0 and $A\in \mathfrak{s}$, then the semisimple and nilpotent summands of the Jordan–Chevalley decomposition of $A$ belong to $\mathfrak{s}$ if and only if there exist $S,N\in \mathfrak{s}$, $S$ is semisimple, $N$ is nilpotent (not necessarily $[S,N]=0$) such that $A=S+N$.

We present a computer algebra package based on Magma for performing computations in rational Cherednik algebras with arbitrary parameters and in Verma modules for restricted rational Cherednik algebras. Part of this package is a new general Las Vegas algorithm for computing the head and the constituents of a module with simple head in characteristic zero, which we develop here theoretically. This algorithm is very successful when applied to Verma modules for restricted rational Cherednik algebras and it allows us to answer several questions posed by Gordon in some specific cases. We can determine the decomposition matrices of the Verma modules, the graded $G$-module structure of the simple modules, and the Calogero–Moser families of the generic restricted rational Cherednik algebra for around half of the exceptional complex reflection groups. In this way we can also confirm Martino’s conjecture for several exceptional complex reflection groups.

Supplementary materials are available with this article.

We describe a method for constructing the character table of a group of type M.G.A from the character tables of the subgroup M.G and the factor group G.A, provided that A acts suitably on M.G. This simplifies and generalizes a recently published method.

We use the technique of Fischer matrices to write a program to produce the character table of a group of shape (2×2.G):2 from the character tables of G, G:2, 2.G and 2.G:2.

Let G be isomorphic to a group H satisfying SL(d,q)≤H≤GL(d,q) and let W be an irreducible FqG-module of dimension at most d2. We present a Las Vegas polynomial-time algorithm which takes as input W and constructs a d-dimensional projective representation of G.

Let $G$ be a finite group and $\chi $ be an irreducible character of $G$. An efficient and simple method to construct representations of finite groups is applicable whenever $G$ has a subgroup $H$ such that $\chi H$ has a linear constituent with multiplicity 1. In this paper we show (with a few exceptions) that if $G$ is a simple group or a covering group of a simple group and $\chi $ is an irreducible character of $G$ of degree less than 32, then there exists a subgroup $H$ (often a Sylow subgroup) of $G$ such that $\chi H$ has a linear constituent with multiplicity 1.

A construction of the Monster simple group is described implicitly as $196882\,{\times}\,196882$ matrices over the field of 3 elements.

A practical method is described for deciding whether or not a finite-dimensional module for a group over a finite field is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalistaion of the Parker-Norton ‘Meataxe’ algorithm, but it does not depend for its efficiency on the field being small. The principal tools involved are the calculation of the nullspace and the characteristic polynomial of a matrix over a finite field, and the factorisation of the latter. Related algorithms to determine absolute irreducibility and module isomorphism for irreducibles are also described. Details of an implementation in the GAP system, together with some performance analyses are included.