[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: RelativeField .. repeat
RelativeField(F, L) : FldAlg, FldAlg -> FldAlg
RelativePrecision(s) : FldPrElt -> RngIntElt
Precision(s) : FldPrElt -> RngIntElt
RelativePrecision(x) : RngPadElt -> RngIntElt
RelativePrecision(f) : RngSerElt -> RngIntElt
AddRelator(~P, w) : GrpFPCosetEnumProc, GrpFPElt ->
Magma Updates (OVERVIEW)
Calculating the Relevant Primes (FINITELY PRESENTED GROUPS: ADVANCED)
Relevant Primes (FINITELY PRESENTED GROUPS: ADVANCED)
Calculating the Relevant Primes (FINITELY PRESENTED GROUPS: ADVANCED)
Relevant Primes (FINITELY PRESENTED GROUPS: ADVANCED)
ChineseRemainderTheorem(I1, L1, e1, L2) : RngOrdIdl, [RngIntElt], RngOrdElt, [RngIntElt] -> RngOrdElt
ClassRepresentative(I) : RngOrdFracIdl -> RngOrdFracIdl
CRT(I1, L1, e1, L2) : RngOrdIdl, [RngIntElt], RngOrdElt, [RngIntElt] -> RngOrdElt
ChineseRemainderTheorem(I, J, a, b) : RngInt, RngInt, RngIntElt, RngIntElt -> RngIntElt
ChineseRemainderTheorem(I1, I2, e1, e2) : RngOrdIdl, RngOrdIdl, RngOrdElt, RngOrdElt -> RngOrdElt
ChineseRemainderTheorem(X, N) : [RngIntElt], [RngIntElt] -> RngIntElt
PseudoRemainder(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt
Rings, Fields, and Algebras (OVERVIEW)
TransversalProcessRemaining(P) : GrpPermTransProc -> RngIntElt
RemoveEdge(~G, e) : Grph, GrphEdge ->
RemoveEdges(~G, S) : Grph, { GrphEdge } ->
G -:= e : Grph, GrphEdge ->
N -:= e : GrphNet, GrphEdge ->
G -:= v : Grph, GrphVert ->
N -:= v : GrphNet, GrphVert ->
AddWeight(X,w) : VSrfK3,RngIntElt -> VSrfK3
Remove(~S, i) : SeqEnum, RngIntElt ->
RemoveColumn(A, j) : Mtrx, RngIntElt -> Mtrx
RemoveConstraint(L, n) : LP, RngIntElt ->
RemoveFiles(P) : NFSProc -> .
RemoveIrreducibles(I, C) : [ AlgChtrElt ], [ AlgChtrElt ] -> [ AlgChtrElt ], [ AlgChtrElt ]
RemoveRow(A, i) : Mtrx, RngIntElt -> Mtrx
RemoveRowColumn(A, i, j) : Mtrx, RngIntElt -> Mtrx
Scheme_remove (Example H87E5)
RemoveColumn(A, j) : Mtrx, RngIntElt -> Mtrx
RemoveConstraint(L, n) : LP, RngIntElt ->
RemoveEdge(~G, e) : Grph, GrphEdge ->
RemoveEdges(~G, S) : Grph, { GrphEdge } ->
G -:= e : Grph, GrphEdge ->
N -:= e : GrphNet, GrphEdge ->
RemoveEdge(~G, e) : Grph, GrphEdge ->
RemoveEdges(~G, S) : Grph, { GrphEdge } ->
G -:= e : Grph, GrphEdge ->
N -:= e : GrphNet, GrphEdge ->
RemoveFiles(P) : NFSProc -> .
RemoveIrreducibles(I, C) : [ AlgChtrElt ], [ AlgChtrElt ] -> [ AlgChtrElt ], [ AlgChtrElt ]
RemoveRow(A, i) : Mtrx, RngIntElt -> Mtrx
RemoveRowColumn(A, i, j) : Mtrx, RngIntElt -> Mtrx
RemoveVertex(~G, v) : Grph, GrphVert ->
RemoveVertices(~G, U) : Grph, { GrphVert } ->
G -:= v : Grph, GrphVert ->
N -:= v : GrphNet, GrphVert ->
RemoveVertex(~G, v) : Grph, GrphVert ->
RemoveVertices(~G, U) : Grph, { GrphVert } ->
G -:= v : Grph, GrphVert ->
N -:= v : GrphNet, GrphVert ->
RemoveWeight(X,w) : VSrfK3,RngIntElt -> VSrfK3
AddWeight(X,w) : VSrfK3,RngIntElt -> VSrfK3
ExtractRep(~R, ~r) : SetEnum, Elt ->
HasSparseRep(G) : Grph -> BoolElt
Rep(G) : GrpAb -> GrpAbElt
Rep(G) : GrpSLP -> GrpSLPElt
Rep(C) : SetCart -> Elt
Representative(G) : GrpAtc -> GrpAtcElt
Representative(B) : GrpBrd -> GrpBrdElt
Representative(P) : GrpBrdClassProc -> GrpBrdElt
Representative(G) : GrpFin -> GrpFinElt
Representative(G) : GrpGPC -> GrpGPCElt
Representative(G) : GrpPC -> GrpPCElt
Representative(G) : GrpPerm -> GrpPermElt
Representative(G) : GrpRWS -> GrpRWSElt
Representative(b) : IncBlk -> IncPt
Representative(B) : IncBlkSet -> IncBlk
Representative(P) : IncPtSet -> IncPt
Representative(M) : MonRWS -> MonRWSElt
Representative(l) : PlaneLn -> PlanePt
Representative(L) : PlaneLnSet -> PlaneLn
Representative(V) : PlanePtSet -> PlanePt
Representative(R) : Rng -> RngElt
Representative(R) : SeqEnum -> Elt
Representative(R) : SetIndx -> Elt
Writing Representations over Subfields (MATRIX GROUPS)
rep{ e(x) : x in E | P(x) }
rep{ e(x_1, ..., x_k) : x_1 in E_1, ...,x_k in E_k | P(x_1, ..., x_k) }
Indefinite Iteration (STATEMENTS AND EXPRESSIONS)
The repeat statement (OVERVIEW)
repeat statements until boolexpr : ->
State_repeat (Example H1E14)
[____] [____] [_____] [____] [__] [Index] [Root]