The complexity of the Lie module
Abstract
We show that the complexity of the Lie module 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 (pi) for 1 ≤ i ≤ m.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.