Linear dimension of group actions
Alice Devillers, Michael Giudici, Daniel R. Hawtin, Lukas Klawuhn, Luke Morgan
TL;DR
This paper develops a unified algebraic framework for the linear dimension of group actions, conceptualizing minimal-dimensional representations that intertwine with a permutation action as quotients of permutation modules. By leveraging permutation-module theory, it provides precise LinDim values for broad families, including primitive and imprimitive actions, wreath products, and almost simple 2-transitive groups, with sharp results and constructive witnesses. The work both consolidates known results (e.g., on $S_n$ and $A_n$ actions) and advances new classifications via module-theoretic tools (such as the fully deleted permutation module and Brauer-tree analysis), offering cryptographic implications and a spectrum of natural open problems. Overall, it illuminates how the internal module structure of permutation representations governs the feasibility of compact linear actions in diverse group-action settings.
Abstract
Two fundamental ways to represent a group are as permutations and as matrices. In this paper, we study linear representations of groups that intertwine with a permutation representation. Recently, D'Alconzo and Di Scala investigated how small the matrices in such a linear representation can be. The minimal dimension of such a representation is the \emph{linear dimension of the group action} and this has applications in cryptography and cryptosystems. We develop the idea of linear dimension from an algebraic point of view by using the theory of permutation modules. We give structural results about representations of minimal dimension and investigate the implications of faithfulness, transitivity and primitivity on the linear dimension. Furthermore, we compute the linear dimension of several classes of finite primitive permutation groups. We also study wreath products, allowing us to determine the linear dimension of imprimitive group actions. Finally, we give the linear dimension of almost simple finite $2$-transitive groups, some of which may be used for further applications in cryptography. Our results also open up many new questions about linear representations of group actions.
