Papers
Topics
Authors
Recent
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$.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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