%% if you are submitting an initial manuscript then you should have submission as an option here
%% if you are submitting a revised manuscript then you should have revision as an option here
%% otherwise options taken by the article class will be accepted
\documentclass[finalversion]{FPSAC2018}
\articlenumber{24}
%% but DO NOT pass any options (or change anything else anywhere) which alters page size / layout / font size etc

%% note that the class file already loads {amsmath, amsthm, amssymb}

\usepackage{amsfonts,amsmath,amssymb,tikz}

\usetikzlibrary[positioning,patterns]

\tikzstyle{bsq}=[rectangle, draw, thick, minimum width=.75cm, minimum height=.75cm]

\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{proposition}[theorem]{Proposition}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\numberwithin{equation}{section}

\newcommand{\CC}{\mathbb{C}}
\newcommand{\FF}{\mathbb{F}}
\newcommand{\KK}{\mathbb{K}}
\newcommand{\QQ}{\mathbb{Q}}
\newcommand{\ZZ}{\mathbb{Z}}

\newcommand{\cA}{\mathcal{A}}
\newcommand{\cB}{\mathcal{B}}
\newcommand{\cC}{\mathcal{C}}
\newcommand{\cD}{\mathcal{D}}
\newcommand{\cE}{\mathcal{E}}
\newcommand{\cF}{\mathcal{F}}
\newcommand{\cG}{\mathcal{G}}
\newcommand{\cH}{\mathcal{H}}
\newcommand{\cI}{\mathcal{I}}
\newcommand{\cJ}{\mathcal{J}}
\newcommand{\cK}{\mathcal{K}}
\newcommand{\cL}{\mathcal{L}}
\newcommand{\cM}{\mathcal{M}}
\newcommand{\cN}{\mathcal{N}}
\newcommand{\cO}{\mathcal{O}}
\newcommand{\cP}{\mathcal{P}}
\newcommand{\cQ}{\mathcal{Q}}
\newcommand{\cR}{\mathcal{R}}
\newcommand{\cS}{\mathcal{S}}
\newcommand{\cT}{\mathcal{T}}
\newcommand{\cU}{\mathcal{U}}
\newcommand{\cV}{\mathcal{V}}
\newcommand{\cW}{\mathcal{W}}
\newcommand{\cX}{\mathcal{X}}
\newcommand{\cY}{\mathcal{Y}}
\newcommand{\cZ}{\mathcal{Z}}

%Math Roman

\newcommand{\ad}{\mathrm{ad}}
\newcommand{\tr}{\mathrm{tr}}
\newcommand{\Hom}{\mathrm{Hom}}
\newcommand{\End}{\mathrm{End}}
\newcommand{\Aut}{\mathrm{Aut}}
\newcommand{\Ind}{\mathrm{Ind}}
\newcommand{\GL}{\mathrm{GL}}
\newcommand{\ind}{\mathrm{ind}}
\newcommand{\Res}{\mathrm{Res}}
\newcommand{\Inf}{\mathrm{Inf}}
\newcommand{\ch}{\mathrm{ch}}
\newcommand{\Irr}{\mathrm{Irr}}
\newcommand{\Resf}{\mathrm{Resf}}
\newcommand{\wt}{\mathrm{wt}}
\newcommand{\Indf}{\mathrm{Indf}}
\newcommand{\sh}{\mathrm{sh}}
\newcommand{\hgt}{\mathrm{ht}}
\newcommand{\diag}{\mathrm{diag}}
\newcommand{\Card}{\mathrm{Card}}
\newcommand{\Tr}{\mathrm{Tr}}
\newcommand{\btr}{\mathrm{btr}}
\newcommand{\Id}{\mathrm{Id}}
\newcommand{\im}{\mathrm{im}}
\newcommand{\LL}{\mathrm{LL}}
\newcommand{\RL}{\mathrm{RL}}
\newcommand{\UT}{\mathrm{UT}}
\newcommand{\SInd}{\mathrm{SInd}}
\newcommand{\Def}{\mathrm{Def}}
\newcommand{\pack}{\mathrm{pack}}
\newcommand{\Sym}{\mathrm{Sym}}
\newcommand{\mt}{\mathrm{mt}}
\newcommand{\rst}{\mathrm{rst}}
\newcommand{\io}{\mathrm{io}}
\newcommand{\character}{\mathrm{char}}
\newcommand{\st}{\mathrm{st}}
\newcommand{\supp}{\mathrm{supp}}
\newcommand{\Coeff}{\mathrm{Coeff}}
\newcommand{\nst}{\mathrm{nst}}
\newcommand{\cl}{\mathrm{cf}}
\newcommand{\scl}{\mathrm{scf}}
\newcommand{\scf}{\mathrm{scf}}
\newcommand{\Stab}{\mathrm{Stab}}

\newcommand{\bl}{\mathrm{bl}}
\newcommand{\uncr}{\mathrm{uncr}}
\newcommand{\crs}{\mathrm{crs}}
\newcommand{\Pqbin}[3]{\genfrac{[}{]}{0pt}{}{#1}{#2}_{#3}}
\newcommand{\ggamma}{\gamma\hspace{-1.1ex}\gamma}
\newcommand{\sggamma}{\gamma\hspace{-.8ex}\gamma}
\newcommand{\rte}{\overset{\curvearrowright}{\varepsilon}}
\newcommand{\lte}{\overset{\curvearrowleft}{\varepsilon}}
\newcommand{\rse}[2]{{#1}^{\curvearrowright}_{#2}}
\newcommand{\lse}[2]{{#1}^{\curvearrowleft}_{#2}}
\newcommand{\bte}{\mathrm{bte}}
\newcommand{\lcP}{\mathcal{P}_{\curvearrowleft}}
\newcommand{\rcP}{\mathcal{P}_{\curvearrowright}}
\newcommand{\lbl}{\mathrm{bl}_{\curvearrowleft}}
\newcommand{\rbl}{\mathrm{bl}_{\curvearrowright}}
\newcommand{\el}{\mathrm{ep}_{\curvearrowleft}}
\newcommand{\er}{\mathrm{ep}_{\curvearrowright}}
\newcommand{\cflt}{\mathrm{cflt}}
\newcommand{\snst}{\mathrm{snst}}
\newcommand{\sdim}{\mathrm{sdim}}
\newcommand{\semisimple}{\mathrm{ss}}
\newcommand{\unipotent}{\mathrm{un}}
\newcommand{\cf}{\mathrm{cf}}
\newcommand{\uscf}{\mathrm{uscf}}
\newcommand{\ucf}{\mathrm{ucf}}
\newcommand{\naive}{\mathrm{duh}}
\newcommand{\sign}{(\mathrm{sign})}

\newcommand{\GGG}{\mathrm{ggg}}
\newcommand{\nn}{\mathrm{nn}}
\newcommand{\des}{\mathrm{Des}}
\newcommand{\maj}{\mathrm{maj}}
\newcommand{\inv}{\mathrm{inv}}
\newcommand{\SYT}{\mathrm{SYT}}
\newcommand{\Std}{\mathrm{Std}}

\newcommand{\One}{{1\hspace{-.14cm} 1}}

%% define your title in the usual way
\title[The unipotent modules of $\GL_n(\FF_q)$ via tableaux (extended
abstract)]{The unipotent modules of $\GL_n(\FF_q)$ via tableaux\\
(extended abstract)}

%% define your authors in the usual way
%% use \addressmark{1}, \addressmark{2} etc for the institutions, and use \thanks{} for contact details
\author{Scott Andrews\thanks{\href{mailto:scottandrews@boisestate.edu}{scottandrews@boisestate.edu}}\addressmark{1}}

%% then use \addressmark to match authors to institutions here
\address{\addressmark{1}Department of Mathematics, Boise State University, Boise, ID}

%% put the date of submission here
\received{\today}

%% leave this blank until submitting a revised version
%\revised{}

%% put your English abstract here, or comment this out if you don't have one yet
%% please don't use custom commands in your abstract / resume, as these will be displayed online
%% likewise for citations -- please don't use \cite, and instead write out your citation as something like (author year)
\abstract{We construct the irreducible unipotent modules of the finite general linear groups from actions on tableaux. Our approach is analogous to that of James (1976) for the symmetric groups, answering an open question as to whether such a construction exists. We show that our modules are isomorphic to those previously constructed by James (1984), although the two presentations are quite different. Key to our construction are the generalized Gelfand--Graev representations of Kawanaka (1983).}

%% put your French abstract here, or comment this out if you don't have one
%\resume{}

%% put your keywords here, or comment this out if you don't have them yet
\keywords{finite general linear group, unipotent representation, tableaux, generalized Gelfand--Graev representation}

%% you can include your bibliography however you want, but using an external .bib file is STRONGLY RECOMMENDED and will make the editor's life much easier
%% regardless of how you do it, please use numerical citations, ie. [xx, yy] in the text

%% this sample uses biblatex, which (among other things) takes care of URLs in a more flexible way than bibtex
%% but you can use bibtex if you want
\usepackage[backend=bibtex]{biblatex}
\addbibresource{24-Andrews.bib}
%% note the \printbibliography command at the end of the file which goes with these biblatex commands

\begin{document}

\maketitle
%% note that you DO NOT have to put your abstract here -- it is generated by \maketitle and the \abstract and \resume commands above

\section{Introduction}

A standard construction of the irreducible representations of the symmetric group $S_n$, initially due to James \cite{MR0417272}, uses the action of $S_n$ on Young tableaux to define a module for each integer partition of $n$. In characteristic $0$ these modules are (up to isomorphism) all of the irreducible $S_n$-modules; in other characteristics the irreducible modules appear as quotients of these modules.

\par\par

There is a principle in representation theory that information about the finite general linear group $\GL_n(\FF_q)$ can be related to that of $S_n$ by ``setting $q=1$.'' In particular, there is a collection of irreducible representations of $\GL_n(\FF_q)$, known as ``unipotent representations,'' that one would expect to behave like the irreducible representations of $S_n$. In \cite{MR776229}, James constructs the unipotent modules of $\GL_n(\FF_q)$ over any field containing a nontrivial $p^\text{th}$ root of unity (where $p$ is the characteristic of $\FF_q$). The construction is quite different from the tableaux approach for the symmetric group, and in particular the proofs do not translate to proofs for the symmetric group. James asks in the introduction to \cite{MR776229} whether an alternative construction exists that is more along the lines of that of the symmetric group.
\par

Our approach is to label the boxes of Young diagrams with elements of $\FF_q^n$ rather than by integers. The group $\GL_n(\FF_q)$ acts on these objects; we use this action to define the irreducible unipotent modules. Our construction is a natural analogue to that of the symmetric group, providing a positive answer to James' question. A key tool in our approach is the use of the ``generalized Gelfand--Graev representations,'' initially constructed by Kawanaka \cite{MR803335} and recently studied by Thiem and the author \cite{andrewsthiem}.


\par

James shows in \cite{MR0439924} that the irreducible module of $S_n$ corresponding to the partition $\lambda$ has a basis indexed by the standard Young tableaux of shape $\lambda$. It is still an open problem to determine bases for the unipotent irreducible modules of $\GL_n(\FF_q)$ (see, for instance, \cite{MR2047443}). In providing a new construction of the irreducible unipotent modules, we hope to shed some light on this question.

\par

In Section~\ref{preliminaries}, we cover necessary background material on partitions and the finite general linear groups. We provide motivation for our construction in Section~\ref{motivation}, in particular explaining why the generalized Gelfand--Graev representations are the right tool for constructing unipotent modules. Our construction is in Section~\ref{construction}, and in Section~\ref{directions} we look at some further directions for this line of research.





\section{Preliminaries}\label{preliminaries}
\subsection{Partitions and tableaux}

Let $n$ be a positive integer; a \emph{partition} of $n$ is a sequence $\lambda = (\lambda_1,\lambda_2,\hdots,\lambda_k)$ of positive integers with $\lambda_1 \geq \lambda_2 \geq \hdots \geq \lambda_k$ and $\lambda_1+\lambda_2+\hdots +\lambda_k = n$. We write $\lambda \vdash n$ to indicate that $\lambda$ is a partition of $n$.

\par

There is a partial order on the set of partitions of $n$ with $\lambda \succeq \mu$ if and only if
\[
        \sum_{i=1}^k\lambda_i \geq \sum_{i=1}^k\mu_i
\]
for all $k$ (setting $\lambda_i=0$ if $\lambda$ has fewer than $i$ parts). This order is called the \emph{dominance order} on partitions.

\par

To each partition $\lambda$ we associate a \emph{Young diagram}, which is a left-justified array of blocks such that the number of blocks in the $i$th row is $\lambda_i$.

\begin{example} Let $\lambda = (4,3,1,1)$; then the Young diagram of shape $\lambda$ is
\[
		\begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {};
	      \node[bsq] (21) [below = of 11] {};
	      \node[bsq] (31) [below = of 21] {};
	      \node[bsq] (41) [below = of 31] {};
	      \node[bsq] (12) [right = of 11] {};
	      \node[bsq] (22) [below = of 12] {};
	      \node[bsq] (23) [right = of 22] {};
         	 \node[bsq] (13) [right = of 12] {};
          \node[bsq] (14) [right = of 13] {};
\end{tikzpicture}.
\]
\end{example}

The \emph{conjugate} of a partition $\lambda$, denoted $\lambda'$, is the partition defined by $\lambda_i' = |\{j \mid \lambda_j \geq i\}|$. Note that the Young diagram of $\lambda'$ is obtained from that of $\lambda$ by reflection about the diagonal.

\par

If $\lambda$ is a partition of $n$, a \emph{tableau} of shape $\lambda$ is a filling of the Young diagram of shape $\lambda$ by the integers from $1$ through $n$, each appearing exactly once. We say that a tableau is \emph{standard} if the entries increase along rows and columns.

\begin{example}
Let $\lambda = (4,3,1,1)$, and let 
\[
		T = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$1$};
	      \node[bsq] (21) [below = of 11] {$3$};
	      \node[bsq] (31) [below = of 21] {$7$};
	      \node[bsq] (41) [below = of 31] {$9$};
	      \node[bsq] (12) [right = of 11] {$2$};
	      \node[bsq] (22) [below = of 12] {$4$};
	      \node[bsq] (23) [right = of 22] {$6$};
         	 \node[bsq] (13) [right = of 12] {$5$};
          \node[bsq] (14) [right = of 13] {$8$};
\end{tikzpicture} \quad \text{and} \quad
T' = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$1$};
	      \node[bsq] (21) [below = of 11] {$4$};
	      \node[bsq] (31) [below = of 21] {$9$};
	      \node[bsq] (41) [below = of 31] {$6$};
	      \node[bsq] (12) [right = of 11] {$2$};
	      \node[bsq] (22) [below = of 12] {$8$};
	      \node[bsq] (23) [right = of 22] {$7$};
         	 \node[bsq] (13) [right = of 12] {$3$};
          \node[bsq] (14) [right = of 13] {$5$};
\end{tikzpicture};
\]
then $T$ and $T'$ are both tableaux of shape $\lambda$, but $T'$ is not standard as the pairs $(7,8)$ and $(6,9)$ violate the row-increasing and column-increasing conditions.
\end{example}


\subsection{The finite general linear groups}

Let $q$ be a power of a prime, and let $\FF_q$ be the finite field with $q$ elements. We are interested in $G = \GL_n(\FF_q)$, the group of invertible $n \times n$ matrices with entries in $\FF_q$.

\par

Let $\lambda$ be a partition of $n$, and let $T$ be the row-reading tableau of shape $\lambda$. We define
\begin{align*}
        P_\lambda &= \{g \in G \mid g_{ij} = 0 \text{ if } i \text{ is strictly below } j \text{ in } T\} \text{ and} \\ 
        U_\lambda & = \{g \in G \mid g_{ii} = 1 \text{ and } g_{ij} = 0 \text{ unless } i = j \text{ or }i \text{ is strictly above } j \text{ in } T\}.
\end{align*}

\begin{example} Let $\lambda = (4,3,1,1)$; then
\[
		T = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$1$};
	      \node[bsq] (21) [below = of 11] {$5$};
	      \node[bsq] (31) [below = of 21] {$8$};
	      \node[bsq] (41) [below = of 31] {$9$};
	      \node[bsq] (12) [right = of 11] {$2$};
	      \node[bsq] (22) [below = of 12] {$6$};
	      \node[bsq] (23) [right = of 22] {$7$};
         	 \node[bsq] (13) [right = of 12] {$3$};
          \node[bsq] (14) [right = of 13] {$4$};
\end{tikzpicture},
\]
and we have
\[
		P_\lambda = \left\{\left(\begin{array}{ccccccccc}
		* & * & * & * & * & * & * & * & * \\
		* & * & * & * & * & * & * & * & * \\
		* & * & * & * & * & * & * & * & * \\
		* & * & * & * & * & * & * & * & * \\
		0 & 0 & 0 & 0 & * & * & * & * & * \\
		0 & 0 & 0 & 0 & * & * & * & * & * \\
		0 & 0 & 0 & 0 & * & * & * & * & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 0 & * & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & * \end{array}\right)\in \GL_n(\FF_q)\right\}
\]
and
\[
		U_\lambda = \left\{\left(\begin{array}{ccccccccc}
		1 & 0 & 0 & 0 & * & * & * & * & * \\
		0 & 1 & 0 & 0 & * & * & * & * & * \\
		0 & 0 & 1 & 0 & * & * & * & * & * \\
		0 & 0 & 0 & 1 & * & * & * & * & * \\
		0 & 0 & 0 & 0 & 1 & 0 & 0 & * & * \\
		0 & 0 & 0 & 0 & 0 & 1 & 0 & * & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 1 & * & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{array}\right)\in \GL_n(\FF_q)\right\}.
\]
We also define
\[
        P_\lambda^- = (P_\lambda)^t \quad \text{and} \quad U_\lambda^- = (U_\lambda)^t
\]
to be the transposes of $P_\lambda$ and $U_\lambda$.
\end{example}

\begin{remark} The groups $P_\lambda$ and $P_\lambda^-$ are parabolic subgroups of $G$, with unipotent radicals $U_\lambda$ and $U_\lambda^-$. In particular, the group of upper triangular matrices in $G$ given by 
\[
       B_n(\FF_q) = P_{(1^n)}
\]
is a Borel subgroup of $G$ with unipotent radical
\[
        \UT_n(\FF_q) = U_{(1^n)}.
\]
\end{remark}

We say that an irreducible module of $G$ (over some field) is \emph{unipotent} if it is a composition factor of $\Ind_{B_n(\FF_q)}^G(\One)$.

\section{Motivation behind the construction}\label{motivation}

In this section we motivate our construction in the specific case where we are taking our representations over the field of complex numbers. None of the results of this section are necessary for the construction, however they provide insight as to why our approach makes sense. First, we recall some facts about the character theory of $S_n$ and $\GL_n(\FF_q)$ over $\CC$ and the connection to symmetric functions.

\par

The irreducible complex characters of $S_n$ are indexed by the partitions of $n$; let $\psi^\lambda$ denote the irreducible character of $S_n$ corresponding to $\lambda$, as in \cite{MR1354144}. Note that $\psi^{(n)}$ is the trivial character and $\psi^{(1^n)}$ is the sign character (denoted $\epsilon$). The following proposition follows from the Pieri rules (see \cite[I.5]{MR1354144}).

\begin{proposition}
	Let $\lambda$ be a partition of $n$, and let $W_\lambda$ be a Young subgroup of $S_n$ of shape $\lambda$. Then
	\[
	\Ind_{W_\lambda}^{S_n}(\One) = \sum_{\mu \succeq \lambda} K_{\mu\lambda}\psi^\mu \quad \text{and}\quad \Ind_{W_\lambda}^{S_n}(\epsilon) = \sum_{\mu' \succeq \lambda} K_{\mu'\lambda}\psi^\mu,
	\]
	where the $K_{\mu\lambda}$ are the Kostka numbers (see \cite[I.6.4]{MR1354144}).
\end{proposition}

The Kostka numbers $K_{\mu\lambda}$ satisfy that $K_{\lambda\lambda}=1$ and $K_{\mu\lambda}=0$ unless $\mu \succeq \lambda$. In particular, if $W_\lambda$ is a Young subgroup of shape $\lambda$ and $W_{\lambda'}$ is a Young subgroup of shape $\lambda'$, we have
\[
\langle \Ind_{W_\lambda}^{S_n}(\One), \Ind_{W_{\lambda'}}^{S_n}(\epsilon) \rangle = 1,
\]
and the common irreducible constituent is $\psi^\lambda$. James \cite{MR0417272} constructs an irreducible submodule $V^\lambda$ of $\Ind_{W_\lambda}^{S_n}(\One)$ in such a way that $V^\lambda$ contains a one-dimensional subspace on which $W_{\lambda'}$ acts as $\epsilon$. In other words,
\[
\langle \Ind_{W_\lambda}^{S_n}(\One), V^\lambda \rangle \neq 0
\]
and
\[
\langle \Ind_{W_{\lambda'}}^{S_n}(\epsilon), V^\lambda \rangle
= \langle \epsilon, \Res_{W_{\lambda'}}^{S_n}(V^\lambda) \rangle \neq 0.
\]
This forces $V^\lambda$ to be a module affording the character $\psi^\lambda$.

\par

In order to apply a similar approach to construct the irreducible unipotent modules of $\GL_n(\FF_q)$ we need to find modules that are analogous to $\Ind_{W_\lambda}^{S_n}(\One)$ and $\Ind_{W_{\lambda'}}^{S_n}(\epsilon)$. The irreducible unipotent characters of $\GL_n(\FF_q)$ are indexed by partitions of $n$; let $\chi^\lambda$ be the irreducible unipotent character corresponding to $\lambda$, as in \cite{MR0072878,MR1354144}. Note that $\chi^{(1^n)}$ is the trivial character and $\chi^{(n)}$ is the Steinberg character. As the trivial character is indexed by the transpose of $(n)$ (rather than by $(n)$ as with the symmetric group), we should expect our results to be transposed to some extent. The next proposition follows from the Pieri rules.

\begin{proposition} Let $P_\lambda$ be the parabolic subgroup of $G$ of shape $\lambda$; then we have
	\[
	\Ind_{P_\lambda}^G(\One) = \sum_{\mu' \succeq \lambda} K_{\mu'\lambda}\chi^\mu.
	\]
\end{proposition}

Both James' construction and our construction use $\Ind_{P_{\lambda'}}^G(\One)$ as the analogue of $\Ind_{W_\lambda}^{S_n}(\One)$.

\par

Let $\Psi^\lambda$ be the \emph{degenerate Gelfand--Graev character} corresponding to the partition $\lambda$, as in \cite[Section 12.1]{MR643482}. The character $\Psi^\lambda$ is obtained by inducing a linear character of $\UT_n(\FF_q)$ that is trivial on certain root subgroups determined by the partition $\lambda$.

\begin{proposition}[{\cite[Section 12.1]{MR643482}}] If $\lambda$ and $\mu$ are partitions of $n$, we have that
	\[
	\langle \Psi^\lambda, \chi^\mu \rangle = K_{\mu \lambda}. 
	\]
\end{proposition}

It follows that $\langle \Ind_{P_{\lambda'}}^G(\One),\Psi^\lambda \rangle = 1$; the construction of James \cite{MR776229} uses $\Psi^\lambda$ as the analogue of $\Ind_{W_{\lambda'}}^{S_n}(\epsilon)$.

\par

In \cite{MR803335}, Kawanaka constructs the \emph{generalized Gelfand--Graev characters} of a reductive group over a finite field, with each character associated to a nilpotent orbit of the corresponding Lie algebra. In the case of $\GL_n(\FF_q)$, the nilpotent orbits are indexed by the partitions of $n$; let $\Gamma^\lambda$ be the generalized Gelfand--Graev character indexed by the partition $\lambda$. In \cite{andrewsthiem}, Thiem and the author show that $\Gamma^\lambda$ can be obtained by inducing a linear character from $U_{\lambda'}$, and calculate the multiplicities of the unipotent characters in $\Gamma^\lambda$.

\begin{theorem}[{\cite{andrewsthiem}}]
	Let $\lambda$ and $\mu$ be partitions of $n$; then
	\[
	\langle \Gamma^\lambda, \chi^\mu \rangle = K_{\mu\lambda}(q),
	\]
	where $K_{\mu\lambda}(q)$ is the Kostka polynomial (see \cite[III.6]{MR1354144}). 
\end{theorem}

It follows that $\langle \Ind_{P_{\lambda'}}^G(\One),\Gamma^\lambda \rangle = 1$. Furthermore, note that $K_{\mu\lambda}(1) = K_{\mu\lambda}$; by setting $q=1$ we see that $\Gamma^\lambda$ is another analogue of $\Ind_{W_{\lambda'}}^{S_n}(\epsilon)$. We construct an irreducible submodule $S^\lambda$ of $\Ind_{P_{\lambda'}}^G(\One)$ that contains a one-dimensional submodule on which $U_{\lambda'}$ acts as the appropriate linear character. This forces $S^\lambda$ to be a module affording the irreducible unipotent character $\chi^\lambda$.

\section{Construction of the modules}\label{construction}

The construction in this section is motivated by the construction of the irreducible representations of the symmetric group (see \cite{MR0417272,MR0439924,MR1824028}). Many of the results are similar to those found in \cite{MR776229}, which is not surprising as our constructions produce isomorphic modules.

\par


Let $p$ be the characteristic of $\FF_q$, and let $\KK$ be a field that contains a nontrivial $p^\text{th}$ root of unity (in particular, the characteristic of $\KK$ cannot be $p$). For the remainder of the paper, fix a nontrivial homomorphism $\theta:\FF_q^+ \to \KK^\times$.

\begin{definition} Let $\lambda$ be a partition of $n$, and let $T$ be a filling of the Young diagram of shape $\lambda$ with linearly independent elements of $\mathbb{F}_q^n$. We call $T$ an $\mathbb{F}_q^n$\emph{-tableau}.
\end{definition}

Note that $G$ acts on the set of $\mathbb{F}_q^n$-tableaux by left multiplication of the entries (considered as column vectors). If $T$ is an $\mathbb{F}_q^n$-tableau of shape $\lambda$, we obtain an ordered basis $\mathcal{B}(T)$ of $\mathbb{F}_q^n$ by numbering the entries of $T$ from top to bottom, then left to right.

\begin{example} Let $\lambda = (4,2^2,1)$; then the ordered basis $\mathcal{B}(T) = \{v_1,...,v_9\}$ corresponds to the tableau
\[
		T = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$v_1$};
	      \node[bsq] (21) [below = of 11] {$v_2$};
	      \node[bsq] (31) [below = of 21] {$v_3$};
	      \node[bsq] (41) [below = of 31] {$v_4$};
	      \node[bsq] (12) [right = of 11] {$v_5$};
	      \node[bsq] (22) [below = of 12] {$v_6$};
	      \node[bsq] (32) [below = of 22] {$v_7$};
         	 \node[bsq] (13) [right = of 12] {$v_8$};
          \node[bsq] (14) [right = of 13] {$v_9$};
\end{tikzpicture} .
\]
\end{example}

To each $\FF_q^n$-tableaux $T$ we associate two subgroups of $G$, given by
\begin{align*}
		U(T) &= \{g \in G \mid g \cdot v_i -v_i \in \mathbb{F}_q\text{-span}\{v_j \mid v_j \text{ is strictly left of }v_i
		\text{ in }T\}\text{ for all }i\} \text{ and} \\
		P(T) &= \{g \in G \mid g \cdot v_i \in \mathbb{F}_q\text{-span}\{v_j \mid v_j \text{ is nonstrictly right of }v_i
		\text{ in }T\}\text{ for all }i\}.
\end{align*}

If $\mathcal{B}(T)$ is the standard ordered basis of $\mathbb{F}_q^n$, then $U(T) = U_{\lambda'}$ and $P(T)~=~P_{\lambda'}^-$.

\begin{example}\label{example1} Let $\lambda = (4,2^2,1)$, and let $\mathcal{B}(T)$ be the standard ordered basis. Then
\[
		T = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$v_1$};
	      \node[bsq] (21) [below = of 11] {$v_2$};
	      \node[bsq] (31) [below = of 21] {$v_3$};
	      \node[bsq] (41) [below = of 31] {$v_4$};
	      \node[bsq] (12) [right = of 11] {$v_5$};
	      \node[bsq] (22) [below = of 12] {$v_6$};
	      \node[bsq] (32) [below = of 22] {$v_7$};
         	 \node[bsq] (13) [right = of 12] {$v_8$};
          \node[bsq] (14) [right = of 13] {$v_9$};
\end{tikzpicture} ,
\]
and we have
\[
		U(T) = \left\{\left(\begin{array}{ccccccccc}
		1 & 0 & 0 & 0 & * & * & * & * & * \\
		0 & 1 & 0 & 0 & * & * & * & * & * \\
		0 & 0 & 1 & 0 & * & * & * & * & * \\
		0 & 0 & 0 & 1 & * & * & * & * & * \\
		0 & 0 & 0 & 0 & 1 & 0 & 0 & * & * \\
		0 & 0 & 0 & 0 & 0 & 1 & 0 & * & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 1 & * & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & * \\
		0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{array}\right)\right\}
\]
and
\[
		P(T) = \left\{\left(\begin{array}{ccccccccc}
		* & * & * & * & 0 & 0 & 0 & 0 & 0 \\
		* & * & * & * & 0 & 0 & 0 & 0 & 0 \\
		* & * & * & * & 0 & 0 & 0 & 0 & 0 \\
		* & * & * & * & 0 & 0 & 0 & 0 & 0 \\
		* & * & * & * & * & * & * & 0 & 0 \\
		* & * & * & * & * & * & * & 0 & 0 \\
		* & * & * & * & * & * & * & 0 & 0 \\
		* & * & * & * & * & * & * & * & 0 \\
		* & * & * & * & * & * & * & * & * \end{array}\right)\right\}.
\]

\end{example}

If $T$ is the $\FF_q^n$-tableau corresponding to the ordered basis $\cB(T)=\{v_1,v_2,\hdots,v_n\}$, let $X(T)$ be the set of pairs $(i,j)$ such that $v_i$ lies in the box directly to the left of $v_j$ in $T$. In Example~\ref{example1},
\[
        X(T) = \{(1,5),(2,6),(3,7),(5,8),(8,9)\}.
\] 
Define a linear character $\psi_T$ of $U(T)$ by
\[
		\psi_T(u) = \theta\left(\sum_{(i,j) \in X(T)} \text{the coefficient of } v_i \text{ in }uv_j \right),
\]
where $\theta$ is the fixed nontrivial homomorphism from $\FF_q^+$ to $\KK^\times$.

\begin{remark} The groups $P(T)$ and $U(T)$ are analogous to the row-stabilizer $R_T$ and the column-stabilizer $C_T$ of the symmetric group; the linear character $\psi_T$ is analogous to the sign character (see \cite{MR0417272,MR0439924,MR1824028}).

\end{remark}

Consider the permutation $G$-module
\[
		\KK\text{-span}\{T \mid T \text{ is an } \FF_q^n\text{-tableau of shape }\lambda\};
\]
this module is isomorphic to the left regular module of $G$. We define
\begin{align*}
		m_T &= \sum_{p \in P(T)} pT \quad \text{and} \\
		e_T &= \sum_{u \in U(T)} \psi_T(u^{-1})m_{uT}.
\end{align*}


The following proposition is easy to verify directly.

\begin{lemma}\label{properties} Let $T$ be any $\FF_q^n$-tableau.
\begin{enumerate}
\item For all $g \in G$, we have $U(gT) = gU(T)g^{-1}$ and $P(gT) = gP(T)g^{-1}$.
\item For all $g \in G$, we have $g \cdot m_T = m_{g \cdot T}$ and $g \cdot e_T = e_{gT}$.
\item For all $u \in U(T)$ and $g \in G$, we have $\psi_{gT}(gug^{-1}) = \psi_T(u)$.
\item For all $p \in P(T)$, we have $m_{pT} = m_T$.
\item For all $u \in U(T)$, we have $e_{uT} = \psi_T(u)e_T$.
\end{enumerate}
\end{lemma}

Let
\[
		M^\lambda = \KK\text{-span}\{m_T \mid T \text{ is an }\FF_q^n\text{-tableau of shape }\lambda\}
\]
and
\[
		S^\lambda = \KK\text{-span}\{e_T \mid T \text{ is an }\FF_q^n\text{-tableau of shape }\lambda\};
\]
by part (2) of Lemma~\ref{properties}, $M^\lambda$ and $S^\lambda$ are both $G$-modules.

\begin{remark}
The module $M^\lambda$ is isomorphic to the permutation representation of $G$ on the set of $\lambda$-flags. This means that our module $M^\lambda$ is isomorphic to the module $M_{\lambda'}$ of James (as in \cite[10.1]{MR776229}). Note that
\[
M^\lambda \cong \Ind_{P_{\lambda'}^-}^G(\One)
\]
and, in the case $\KK=\CC$, we have that
\[
		\Ind_{U(T)}^{\GL_n(\FF_q)}(\psi_T) = \Gamma^\lambda
\]
(this follows from the elementary construction of the generalized Gelfand--Graev representations in \cite{andrewsthiem}). In particular, when $\KK=\CC$ the module $S^\lambda$ satisfies the desired properties from Section~\ref{motivation}.
\end{remark}

\begin{lemma}\label{groupintersection} Let $T$ and $T'$ be $\FF_q^n$-tableaux of shape $\lambda$. Then $U(T) \cap P(T') = \{1\}$ if and only if there exist $u \in U(T)$ and $p \in P(T')$ with $uT = pT'$.
\end{lemma}


\begin{lemma}\label{nontrivialvalue} Suppose that $T$ and $T'$ are $\FF_q^n$-tableaux of shape $\lambda$ that satisfy $U(T) \cap P(T') \neq \{1\}$; then there exists $g \in U(T) \cap P(T')$ with $\psi_T(g) \neq 1$.
\end{lemma}

For an $\FF_q^n$-tableau $T$, define an element $k_T \in \KK G$ by
\[
		k_T = \sum_{u \in U(T)} \psi_T(u^{-1})u.
\]
The following two lemmas describe how $k_T$ acts on $m_{T'}$ for certain $\FF_q^n$-tableaux $T'$.
\begin{lemma}\label{onedimension} Let $T$ and $T'$ be $\FF_q^n$-tableaux of the same shape; then $k_Tm_{T'} \in \KK e_T$.
\end{lemma}

\begin{lemma}\label{differentshapes}
Let $\lambda$ and $\mu$ be partitions of $n$. If $T$ is an $\FF_q^n$-tableaux of shape $\lambda$ and $T'$ is an $\FF_q^n$-tableaux of shape $\mu$, then $k_Tm_{T'}=0$ unless $\mu \succeq \lambda$.
\end{lemma}

One consequence of Lemma~\ref{onedimension} is the following proposition.

\begin{proposition}\label{indecomposable}
The module $S^\lambda$ is indecomposable.
\end{proposition}


There is an immediate corollary of Proposition~\ref{indecomposable}.

\begin{corollary} If $\textup{char}(\KK)$ does not divide $|G|$, then $S^\lambda$ is irreducible.  In particular, if $\KK$ has characteristic 0, then $S^\lambda$ is irreducible.
\end{corollary}



Given an $\FF_q^n$-tableau $T$, let $\overline{T}$ be the $\FF_q^n$-tableau obtained by replacing the entry $v_i$ with $-v_i$ if $v_i$ is in an odd column of $T$ and fixing the entry $v_i$ if $v_i$ is in an even column of $T$. For example, if
\[
        T = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$v_1$};
	      \node[bsq] (21) [below = of 11] {$v_2$};
	      \node[bsq] (31) [below = of 21] {$v_3$};
	      \node[bsq] (41) [below = of 31] {$v_4$};
	      \node[bsq] (12) [right = of 11] {$v_5$};
	      \node[bsq] (22) [below = of 12] {$v_6$};
	      \node[bsq] (32) [below = of 22] {$v_7$};
         	 \node[bsq] (13) [right = of 12] {$v_8$};
          \node[bsq] (14) [right = of 13] {$v_9$};
\end{tikzpicture} , \quad \text{then} \quad
\overline{T} = \begin{tikzpicture}[node distance=0 cm,outer sep = 0pt, baseline={([yshift=-.5ex]current bounding box.center)}]
	      \node[bsq] (11) at (   0,  0) {$-v_1$};
	      \node[bsq] (21) [below = of 11] {$-v_2$};
	      \node[bsq] (31) [below = of 21] {$-v_3$};
	      \node[bsq] (41) [below = of 31] {$-v_4$};
	      \node[bsq] (12) [right = of 11] {$v_5$};
	      \node[bsq] (22) [below = of 12] {$v_6$};
	      \node[bsq] (32) [below = of 22] {$v_7$};
         	 \node[bsq] (13) [right = of 12] {$-v_8$};
          \node[bsq] (14) [right = of 13] {$v_9$};
\end{tikzpicture}.
\]

\begin{lemma}\label{tbar} For all $\FF_q^n$-tableaux $T$, we have that $U(\overline{T}) = U(T)$, $\overline{T}\in P(T)\cdot T$, and $\psi_{\overline{T}}(u) = \psi_T(u^{-1})$.
\end{lemma}

We define a $G$-invariant bilinear form on $M^\lambda$ by
\[
        [m_T,m_{T'}] = \delta_{m_T,m_{T'}},
\]
and extending by linearity. We remark that $\delta_{m_T,m_{T'}}$ is not the same as $\delta_{T,T'}$, as $m_T = m_{T'}$ exactly when $T' \in P(T) \cdot T$.

\begin{proposition}\label{submodule} Let $V$ be a submodule of $M^\lambda$; then either $S^\lambda \subseteq V$ or $V ~\subseteq ~(S^\lambda)^\perp$.
\end{proposition}

When constructing the irreducible representations of the symmetric groups, it is possible to have $S^\lambda \subseteq (S^\lambda)^\perp$; that will not be the case, however, with the finite general linear groups.

\begin{lemma}\label{basisnotperp} If $T$ is any $\FF_q^n$-tableaux, then $e_T \notin (S^\lambda)^\perp$, hence $S^\lambda \not\subseteq (S^\lambda)^\perp$.
\end{lemma}

The following corollary is an immediate consequence of Proposition~\ref{submodule}.

\begin{corollary} We have the following.
\begin{enumerate}
\item $S^\lambda \cap (S^\lambda)^\perp$ is the unique maximal submodule of $S^\lambda$.
\item The $G$-module $S^\lambda/(S^\lambda \cap (S^\lambda)^\perp)$ is irreducible.
\end{enumerate}
\end{corollary}

Define $D^\lambda = S^\lambda/(S^\lambda \cap (S^\lambda)^\perp)$.

\begin{proposition}\label{dlambdaproperties}
Let $\lambda$ and $\mu$ be partitions of $n$; then we have the following.
\begin{enumerate}
\item If $D^\lambda$ is a composition factor of $M^\mu$, then $\lambda \preceq \mu$.
\item $D^\lambda$ is a composition factor of $M^\lambda$.
\item If $D^\lambda \cong D^\mu$, then $\lambda = \mu$.
\end{enumerate}
\end{proposition}

In \cite{MR776229}, James constructs a collection of irreducible modules of $G$, one for each partition of $n$. James denotes these modules by $D_\lambda$, and shows the following.
\begin{enumerate}
\item The modules $D_\lambda$ are the unipotent modules of $G$. In other words, these modules are exactly the composition factors of $\Ind_B^G(\One)$, up to isomorphism.
\item If $D_\lambda \cong D_\mu$, then $\lambda = \mu$.
\item The module $D_\lambda$ is a composition factor of $\Ind_{P_\lambda}^G(\One)$.
\item Every composition factor of $\Ind_{P_\mu}^G(\One)$ is isomorphic to $D_\lambda$ for some $\lambda \succeq \mu$.
\end{enumerate}

Note that the modules $D_\lambda$ are uniquely characterized (up to isomorphism) by properties (2)--(4). As $M^\lambda \cong \Ind_{P_{\lambda'}^-}^G(\One)$ and $\Ind_{P_{\lambda'}^-}^G(\One) \cong \Ind_{P_{\lambda'}}^G(\One)$ (see \cite[14.7]{MR776229}), by Proposition~\ref{dlambdaproperties} we have the following.

\begin{corollary} We have that $D^\lambda \cong D_{\lambda'}$. In particular, the $D^\lambda$ are the irreducible unipotent modules of $G$.
\end{corollary}
\begin{remark}
The indexing of our modules and those of James differs by the transpose of the partition. Our indexing is chosen to match the convention of Green \cite{MR0072878} and MacDonald \cite{MR1354144}.
\end{remark}

\section{Further directions}\label{directions}

There are a number of questions raised by our construction; a few of particular interest are listed below.
\begin{itemize}
\item Even in the case that $\KK=\CC$ it is still an open problem to find bases for the irreducible unipotent modules of $\GL_n(\FF_q)$. James addresses this question in \cite{MR776229}, and a number of papers (for example \cite{MR2047443}) contribute partial results. For the symmetric group, the bases for the irreducible modules are indexed by the standard Young tableaux. The number of standard Young tableaux of shape $\lambda$ is given by the \emph{hook length formula} (see, for example, \cite[Theorem 3.10.2]{MR1824028}). The dimension of the unipotent module of $\GL_n(\FF_q)$ of shape $\lambda$ is given by a $q$-analogue of the hook length formula (see \cite[III.6 Example 2]{MR1354144}). This suggests that bases might be constructed where each standard Young tableau corresponds to a collection of basis elements, the number of which is given by a polynomial in $q$.
\item The finite orthogonal, symplectic, and unitary groups also have unipotent representations, however explicit constructions of the modules are not known. For these groups there are not enough degenerate Gelfand--Graev representations to distinguish unipotent representations, however by instead using the generalized Gelfand--Graev representations it might be possible to construct the unipotent modules.
\item Most of the irreducible representations of $\GL_n(\FF_q)$ are not
unipotent. In \cite{MR818927}, James uses the degenerate Gelfand--Graev
representations to construct all of the irreducible modules of
$\GL_n(\FF_q)$. By modifying our construction, we might be able to obtain
more elementary constructions of these modules using the generalized
Gelfand--Graev representations.
\end{itemize}


%% if you use biblatex then this generates the bibliography
%% if you use some other method then remove this and do it your own way
\printbibliography



\end{document}
