Papers
Topics
Authors
Recent
Search
2000 character limit reached

The complexity of the Lie module

Published 16 Aug 2011 in math.RT | (1108.3128v1)

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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.