TITLE: Embedding of finite groups in small $\operatorname{GL}(n,F)$
QUESTION [5 upvotes]: How does we obtain a small (not necessarily smallest) value of $n$ such that a $p$-group of order $p^m$ can be embedded in $\operatorname{GL}(n,\mathbb{F}_p)$?
[For embedding of a finite group $G$ in $S_n$, we can compute a small value of $n$ by looking at the minimum index of a subgroup $H$ containing no proper normal subgroup of $G$. Here, this value of $n$ need be necessarily smallest.]

REPLY [5 votes]: An easy to embed $p$-group is the Sylow $p$-subgroup of $\operatorname{GL}(n,p)$. It has $m = n(n−1)/2$, the largest possible $m$.  A hard to embed $p$-group is the cyclic group of order $p^m$.  It embeds in $\operatorname{GL}(n,p)$ only if $n ≥ p^{m−1}+1$.
Easy groups have minimal $n = Θ(\sqrt{m})$ and hard groups have minimal $n = Θ(p^m)$, so there is a very wide range of bounds based on the structure of the group.
In my experience, the single worst feature of a $p$-group for a small embedding is its exponent.  Cyclic groups are nearly regular anyways, so there is very little room to be "worse" asymptotically.
The proof of the exponential embedding lower bound is just a calculation with Jordan canonical forms, and applies to all fields of characteristic $p$.