Documentation

NGPUs
- GetNGPUs() : -> RngIntElt
- SetNGPUs(n) : RngIntElt ->
NGrad
- NGrad(X) : Sch -> RngIntElt
- NumberOfGradings(X) : Sch -> RngIntElt
Nice
- CompositionTreeNiceGroup(G) : Grp -> GrpMat[FldFin]
- CompositionTreeNiceToUser(G) : Grp -> Map, []
- NiceUnitSquareClassRepresentative(u, p) : RngElt, RngOrdIdl -> RngElt
NiceUnitSquareClassRepresentative
- NiceUnitSquareClassRepresentative(u, p) : RngElt, RngOrdIdl -> RngElt
NilpOrbGenuine
- AlgLie_NilpOrbGenuine (Example H107E59)
Nilpotency
- NilpotencyClass(G) : GrpFin -> RngIntElt
- NilpotencyClass(G) : GrpGPC -> RngIntElt
- NilpotencyClass(G) : GrpMat -> RngIntElt
- NilpotencyClass(G) : GrpPC -> RngIntElt
- NilpotencyClass(G) : GrpPerm -> RngIntElt
NilpotencyClass
- NilpotencyClass(G) : GrpFin -> RngIntElt
- NilpotencyClass(G) : GrpGPC -> RngIntElt
- NilpotencyClass(G) : GrpMat -> RngIntElt
- NilpotencyClass(G) : GrpPC -> RngIntElt
- NilpotencyClass(G) : GrpPerm -> RngIntElt
Nilpotent
- CyclicSubgroups(G) : GrpPC -> SeqEnum
- ElementaryAbelianSubgroups(G) : GrpPC -> SeqEnum
- NilpotentSubgroups(G) : GrpPC -> SeqEnum
- AbelianSubgroups(G) : GrpPC -> SeqEnum
- AllNilpotentLieAlgebras(F, d) : Fld, RngIntElt -> SeqEnum
- FreeNilpotentGroup(r, e) : RngIntElt, RngIntElt -> GrpGPC
- IsIrreducibleFiniteNilpotent(G : parameters): GrpMat -> BoolElt, Any
- IsNilpotent(f) : AlgFPElt -> BoolElt, RngIntElt
- IsNilpotent(a) : AlgGenElt -> BoolElt, RngIntElt
- IsNilpotent(L) : AlgLie -> BoolElt
- IsNilpotent(a) : AlgMatElt -> BoolElt, RngIntElt
- IsNilpotent(G) : GrpFin -> BoolElt
- IsNilpotent(G) : GrpGPC -> BoolElt
- IsNilpotent(G) : GrpMat -> BoolElt
- IsNilpotent(G) : GrpMat -> BoolElt
- IsNilpotent(G) : GrpPC -> BoolElt
- IsNilpotent(G) : GrpPerm -> BoolElt
- IsNilpotent(x) : RngElt -> BoolElt
- IsNilpotent(f) : RngMPolResElt -> BoolElt, RngIntElt
- IsNilpotentByFinite(G : parameters) : GrpMat -> BoolElt
- IsPrimitiveFiniteNilpotent(G : parameters): GrpMat -> BoolElt, Any
- LMGIsNilpotent(G) : GrpMat -> BoolElt
- NilpotentBoundary(G,i) : GrpPC, RngIntElt -> RngIntElt
- NilpotentLength(G) : GrpPC -> RngIntElt
- NilpotentLieAlgebra( F, r, k : parameters) : Fld, RngIntElt, RngIntElt -> AlgLie
- NilpotentOrbit( L, e ) : AlgLie, AlgLieElt -> NilpOrbAlgLie
- NilpotentOrbit( L, wd ) : AlgLie, SeqEnum -> NilpOrbAlgLie
- NilpotentOrbits( L ) : AlgLie -> SeqEnum
- NilpotentPresentation(G) : GrpGPC -> GrpGPC, Map
- NilpotentQuotient(G, c) : GrpMat, RngIntElt -> GrpGPC, Map
- NilpotentQuotient(G, c) : GrpPerm, RngIntElt -> GrpGPC, Map
- NilpotentQuotient(G, c: parameters) : GrpFP, RngIntElt -> GrpGPC, Map
- NilpotentQuotient(R, d) : [ AlgFPLieElt ], RngIntElt -> AlgLie, SeqEnum, SeqEnum, UserProgram
- NilpotentSubgroups(G: parameters) : GrpFin -> [ rec< Grp, RngIntElt, RngIntElt, GrpFP> ]
- NilpotentSubgroups(G: parameters) : GrpPerm -> [ rec< GrpPerm, RngIntElt, RngIntElt, GrpFP> ]
- NonNilpotentElement(L) : AlgLie -> AlgLieElt
nilpotent
- Nilpotent Orbits in Simple Lie Algebras (LIE ALGEBRAS)
- Nilpotent Quotient (FINITELY PRESENTED GROUPS)
- Nilpotent Quotient (INTRODUCTION TO FP-GROUPS [FINITELY-PRESENTED GROUPS])
- Properties of Subgroups Requiring a Nil-po-tent Covering Group (POLYCYCLIC GROUPS)
- Solvable and Nilpotent Lie Algebras Classification (LIE ALGEBRAS)
- Subgroup Constructions Requiring a Nil-po-tent Covering Group (POLYCYCLIC GROUPS)
nilpotent-orbits
- Nilpotent Orbits in Simple Lie Algebras (LIE ALGEBRAS)
nilpotent-quotient
- Nilpotent Quotient (FINITELY PRESENTED GROUPS)
- Nilpotent Quotient (INTRODUCTION TO FP-GROUPS [FINITELY-PRESENTED GROUPS])
nilpotent_groups
- Other Functions for Nilpotent Matrix Groups (MATRIX GROUPS OVER INFINITE FIELDS)
NilpotentBoundary
- NilpotentBoundary(G,i) : GrpPC, RngIntElt -> RngIntElt
NilpotentLength
- NilpotentLength(G) : GrpPC -> RngIntElt
NilpotentLieAlgebra
- NilpotentLieAlgebra( F, r, k : parameters) : Fld, RngIntElt, RngIntElt -> AlgLie
NilpotentOrbit
- NilpotentOrbit( L, e ) : AlgLie, AlgLieElt -> NilpOrbAlgLie
- NilpotentOrbit( L, wd ) : AlgLie, SeqEnum -> NilpOrbAlgLie
NilpotentOrbits
- NilpotentOrbits( L ) : AlgLie -> SeqEnum
NilpotentPresentation
- NilpotentPresentation(G) : GrpGPC -> GrpGPC, Map
NilpotentQuotient
- NilpotentQuotient(G, c) : GrpMat, RngIntElt -> GrpGPC, Map
- NilpotentQuotient(G, c) : GrpPerm, RngIntElt -> GrpGPC, Map
- NilpotentQuotient(G, c: parameters) : GrpFP, RngIntElt -> GrpGPC, Map
- NilpotentQuotient(R, d) : [ AlgFPLieElt ], RngIntElt -> AlgLie, SeqEnum, SeqEnum, UserProgram
- AlgLie_NilpotentQuotient (Example H107E9)
NilpotentQuotient0
- GrpFPInt_NilpotentQuotient0 (Example H77E33)
- GrpFP_NilpotentQuotient0 (Example H78E69)

V2.28, 13 July 2023

Magma is maintained and distributed by the Computational Algebra Group, School of Mathematics and Statistics, University of Sydney.