The complexity of the Lie module.

From MaRDI portal



Abstract: We show that the complexity of the Lie module mathrmLie(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 1leqileqm.











This page was built for publication: The complexity of the Lie module.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419407)