- add
- AddAttribute
- AddColumn
- AddColumn(~a, u, i, j) : AlgMatElt, RngElt, RngIntElt, RngIntElt ->
- AddColumn(A, c, i, j) : Mtrx, RngElt, RngIntElt, RngIntElt -> Mtrx
- AddColumn(A, c, i, j) : MtrxSprs, RngElt, RngIntElt, RngIntElt -> MtrxSprs
- AddConstraints
- AddCubics
- AddEdge
- AddEdge(~G, u, v) : Grph, GrphVert, GrphVert ->
- AddEdge(G, u, v) : Grph, GrphVert, GrphVert -> Grph, GrphEdge
- AddEdge(G, u, v, l) : Grph, GrphVert, GrphVert, . -> Grph, GrphEdge
- AddEdge(~G, u, v) : GrphMult, GrphVert, GrphVert ->
- AddEdge(G, u, v) : GrphMult, GrphVert, GrphVert -> GrphMult, GrphEdge
- AddEdge(G, u, v, l) : GrphMultUnd, GrphVert, GrphVert, . -> GrphMult, GrphEdge
- AddEdge(~N, u, v, c) : GrphNet, GrphVert, GrphVert, RngIntElt ->
- AddEdge(N, u, v, c) : GrphNet, GrphVert, GrphVert, RngIntElt -> GrphNet, GrphEdge
- AddEdge(G, u, v, c, l) : GrphNet, GrphVert, GrphVert, RngIntElt, . -> GrphNet, GrphEdge
- AddEdge(G, u, v, c) : GrphNet, GrphVert, RngIntElt, . -> GrphNet, GrphEdge
- AddEdge(N, u, v, c, l) : GrphNet,GrphVert, GrphVert, RngIntElt, . -> GrphNet, GrphEdge
- AddEdges
- AddEdges(~N, S) : GrphNet, { < [ GrphVert, GrphVert ], RngIntElt > } ->
- AddEdge(~N, u, v, c) : GrphNet, GrphVert, GrphVert, RngIntElt ->
- AddEdges(G, S, L) : Grph, SeqEnum, SeqEnum -> Grph
- AddEdges(G, S, L) : GrphMult, SeqEnum, SeqEnum -> GrphMult
- AddEdges(~G, S) : GrphMultUnd, { { GrphVert, GrphVert } } ->
- AddEdges(G, S) : GrphMultUnd, { { GrphVert, GrphVert } } -> GrphMultUnd
- AddEdges(N, S) : GrphNet, { < [ GrphVert, GrphVert ], RngIntElt > } -> GrphNet
- AddEdges(~G, S) : GrphUnd, { { GrphVert, GrphVert } } ->
- AddEdges(G, S) : GrphUnd, { { GrphVert, GrphVert } } -> GrphUnd
- AddGenerator
- AddGroupRelations
- Addition
- additional2
- additional20
- additional3
- additional4
- additional5
- additional6
- additional8
- Additive
- AdditiveCode(K, C) : FldFin, Code -> CodeAdd
- AdditiveCode<F, K, n | L> : FldFin, RngIntElt, List -> Code
- AdditiveCode(G) : ModMatRngElt -> CodeAdd
- AdditiveCyclicCode(v) : ModTupFldElt -> CodeAdd
- AdditiveCyclicCode(v4, v2) : ModTupFldElt, ModTupFldElt -> CodeAdd
- AdditiveCyclicCode(n, f) : RngIntElt, RngUPolElt -> CodeAdd
- AdditiveCyclicCode(n, f4, f2) : RngIntElt, RngUPolElt, RngUPolElt -> CodeAdd
- AdditiveGroup(F) : FldFin -> GrpAb, Map
- AdditiveGroup(Z) : RngInt -> GrpAb, Map
- AdditiveGroup(R) : RngIntRes -> GrpAb, Map
- AdditiveGroup(R) : RngPadRes -> GrpAb, Map
- AdditiveHilbert90(a, q) : FldFinElt, RngIntElt -> FldFinElt
- AdditiveOrder(G) : GrpLie -> SeqEnum
- AdditiveOrder(W) : GrpPermCox -> SeqEnum
- AdditiveOrder(R) : RootStr -> SeqEnum
- AdditiveOrder(R) : RootSys -> SeqEnum
- AdditivePolynomialFromRoots(x, P) : RngElt, PlcFunElt -> RngUPolTwstElt
- AdditiveQuasiCyclicCode(n, Q) : RngIntElt, SeqEnum[RngUPolElt] -> CodeAdd
- AdditiveQuasiCyclicCode(n, Q, h) : RngIntElt, SeqEnum[RngUPolElt], RngIntElt -> CodeAdd
- AdditiveQuasiCyclicCode(Q) : SeqEnum[ModTupFldElt] -> CodeAdd
- AdditiveQuasiCyclicCode(Q, h) : SeqEnum[ModTupFldElt], RngIntElt -> CodeAdd
- AdditiveRepetitionCode(F, K, n) : FldFin, FldFin, RngIntElt -> Code
- AdditiveUniverseCode(F, K, n) : FldFin,FldFin, RngIntElt -> Code
- AdditiveZeroCode(F, K, n) : FldFin, FldFin, RngIntElt -> CodeAdd
- AdditiveZeroSumCode(F, K, n) : FldFin, FldFin, RngIntElt -> Code
- IsAdditiveOrder(R, Q) : RootStr, [RngIntElt] -> BoolElt
- IsAdditiveOrder(R, Q) : RootSys, [RngIntElt] -> BoolElt
- IsAdditiveProjective(C) : CodeAdd -> BoolElt
- RandomAdditiveCode(F, K, n, k) : FldFin,FldFin, RngIntElt, RngIntElt -> Code
- additive
V2.28, 13 July 2023