Four Drafts of The Representation Theory of the Group of Infinite Matrices over Finite Fields

The present paper proves a $q$-identity, which arises from a representation $\pi_{N,\psi}$ of $\text{GL}_n(\mathbb{F}_q)$. This identity gives a significant simplification for the dimension of $\pi_{N,\psi}$, which allowed the second author to obtain a description of the representation.

In this paper we study the minimal faithful permutation representations of $SL_n(\mathbb F_q)$ and $GL_n(\mathbb F_q)$.

Picking permutations at random, the expected number of k-cycles is known to be 1/k and is, in particular, independent of the size of the permuted set. This short note gives similar size-independent statistics of finite general linear groups: ones that depend only on small minors. The proof technique uses combinatorics of categories, motivated by representation stability, and applies simultaneously to symmetric groups, finite linear groups and many other settings.

Let $\UT_n(q)$ denote the unitriangular group of unipotent $n\times n$ upper triangular matrices over a finite field with cardinality $q$ and prime characteristic $p$. It has been known for some time that when $p$ is fixed and $n$ is sufficiently large, $\UT_n(q)$ has ``exotic'' irreducible characters taking values outside the cyclotomic field $\QQ(\zeta_p)$. However, all proofs of this fact to date have been both non-constructive and computer dependent. In a preliminary work...

How to study a nice function on the real line? The physically motivated Fourier theory technique of harmonic analysis is to expand the function in the basis of exponentials and study the meaningful terms in the expansion. Now, suppose the function lives on a finite non-commutative group G, and is invariant under conjugation. There is a well-known analog of Fourier analysis, using the irreducible characters of G. This can be applied to many functions that express interesting p...

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm that, given such a finite group as input, in practice successfully constructs an isomorphic copy over a finite field, and uses this copy to investigate the group's structure. Implementations of our algorithms are available in MAGMA.

These are lecture notes that arose from a representation theory course given by the first author to the remaining six authors in March 2004 within the framework of the Clay Mathematics Institute Research Academy for high school students, and its extended version given by the first author to MIT undergraduate math students in the Fall of 2008. The notes cover a number of standard topics in representation theory of groups, Lie algebras, and quivers, and contain many problems an...

This book is an introduction to a fast developing branch of mathematics - the theory of representations of groups. It presents classical results of this theory concerning finite groups.

In this article we give the meaning of the determinant for 3D matrices with elements from a field F, and the meaning of 3D inverse matrix. Based on my previous work titled '3D Matrix Rings', we want to constructed the 'general linear group of degree $n$ for 3D matrices, which i mark with $GL(n,n,p;F)$' for 3D-matrices, analog to 'general linear group of degree $n$' known.

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.