[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: restore .. RHS
Saving and restoring Magma states (OVERVIEW)
restore "filename";
RestrictField(G, S) : GrpMat, FldFin -> GrpMat, Map
RestrictField(V, L) : ModTupFld, Fld -> ModTupFld, MapHom
SubfieldSubcode(C, S) : Code, FldFin -> Code, Map
IsRestrictedLieAlgebra(L) : AlgLie -> BoolElt
RestrictedPartitions(n, k, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, k, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, Q) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, k, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, k, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, Q) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
Tableau_RestrictedPartitions (Example H101E2)
RestrictField(G, S) : GrpMat, FldFin -> GrpMat, Map
RestrictField(V, L) : ModTupFld, Fld -> ModTupFld, MapHom
SubfieldSubcode(C, S) : Code, FldFin -> Code, Map
Restriction(x, H) : AlgChtrElt, Grp -> AlgChtrElt
Restriction(f, X, Y) : FldFunGElt, Sch, Sch -> FldFunGElt
Restriction(D, S) : IncNsp, { Incpt } -> IncNsp
Restriction(f,X,Y) : MapSch,Sch,Sch -> MapSch
Restriction(M, H) : ModGrp, Grp -> ModGrp
RestrictionToPatch(f,j) : MapSch,RngIntElt -> MapSch
RestrictionToPatch(f,i,j) : MapSch,RngIntElt,RngIntElt -> MapSch
WeilRestriction(E, n) : FldFun, RngIntElt -> FldFun, UserProgram
Compatibility (SEQUENCES)
Compatibility (SETS)
Induction and Restriction (K[G]-MODULES AND GROUP REPRESENTATIONS)
Induction, Restriction, Extension (CHARACTERS OF FINITE GROUPS)
Introduction to Matrix Groups (MATRIX GROUPS)
Restrictions on Sets and Sequences (INTRODUCTION TO AGGREGATES [SETS, SEQUENCES, AND MAPPINGS])
Explicit Restrictions (SCHEMES)
Geometrical Restrictions (SCHEMES)
RestrictionToPatch(f,j) : MapSch,RngIntElt -> MapSch
RestrictionToPatch(f,i,j) : MapSch,RngIntElt,RngIntElt -> MapSch
Resultant(f, g, i) : RngMPolElt, RngMPolElt, RngIntElt -> RngMPolElt
Resultant(f, g) : RngUPolElt, RngUPolElt -> RngElt
Resultant and Discriminant (UNIVARIATE POLYNOMIAL RINGS)
Resultants and Discriminants (MULTIVARIATE POLYNOMIAL RINGS)
Resultant and Discriminant (UNIVARIATE POLYNOMIAL RINGS)
Resultants and Discriminants (MULTIVARIATE POLYNOMIAL RINGS)
ResumeEnumeration(~P: parameters) : GrpFPCosetEnumProc ->
ResumeEnumeration(~P: parameters) : GrpFPCosetEnumProc ->
Retrieve(x) : CopElt -> Elt
Retrieve (COPRODUCTS)
Return (OVERVIEW)
<Return>
IsReverseLatticeWord(w) : MonOrdElt -> BoolElt
Reverse(~S) : SeqEnum ->
Reversion(f) : RngSerElt -> RngSerElt
Reverse(f) : RngSerElt -> RngSerElt
Reversion(f) : RngSerElt -> RngSerElt
Composition and Reversion (POWER, LAURENT AND PUISEUX SERIES)
RevertClass(~P) : Process(pQuot) ->
RevertClass(~P) : Process(pQuot) ->
Rewind(F) : File ->
Rewrite(G, H : parameters) : GrpFP, GrpFP -> GrpFP, Map
GrpFP_1_Rewrite (Example H26E38)
GROUPS DEFINED BY REWRITE SYSTEMS
MONOIDS GIVEN BY REWRITE SYSTEMS
Rewrite Group Predicates (GROUPS DEFINED BY REWRITE SYSTEMS)
Rewrite Monoid Predicates (MONOIDS GIVEN BY REWRITE SYSTEMS)
Rewrite Group Predicates (GROUPS DEFINED BY REWRITE SYSTEMS)
Rewrite Monoid Predicates (MONOIDS GIVEN BY REWRITE SYSTEMS)
GROUPS DEFINED BY REWRITE SYSTEMS
MONOIDS GIVEN BY REWRITE SYSTEMS
Rewriting (FINITELY PRESENTED GROUPS)
ReynoldsOperator(f, G) : RngMPolElt, GrpMat -> RngMPolElt
ReynoldsOperator(f, G) : RngMPolElt, GrpMat -> RngMPolElt
DickmanRho(u) : FldPrElt -> FldReElt;
PollardRho(n) : RngIntElt -> RngIntEltFact, [ RngIntElt ]
RHS(r) : Rel -> AlgFPElt
RHS(r) : Rel -> SgpFPElt
r[2] : GrpAbRel, RngIntElt -> GrpAbElt
r[2] : GrpFPRel, RngIntElt -> GrpFPElt
[____] [____] [_____] [____] [__] [Index] [Root]