pith. sign in

arxiv: 1108.3128 · v1 · pith:YBCQJ7L6new · submitted 2011-08-16 · 🧮 math.RT

The complexity of the Lie module

classification 🧮 math.RT
keywords complexitymodulepoweraboveboundedcharacteristiccomplexitiesdividing
0
0 comments X
read the original abstract

We show that the complexity of the Lie module $\mathrm{Lie}(n)$ in characteristic $p$ is bounded above by $m$ where $p^m$ is the largest $p$-power dividing $n$ and, if $n$ is not a $p$-power, is equal to the maximum of the complexities of $\Lie(p^i)$ for $1 \leq i \leq m$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.