2000 character limit reached
The complexity of the Lie module (1108.3128v1)
Published 16 Aug 2011 in math.RT
Abstract: We show that the complexity of the Lie module $\mathrm{Lie}(n)$ in characteristic $p$ is bounded above by $m$ where $pm$ 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(pi)$ for $1 \leq i \leq m$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.