Documentation

reduction-iteration
- Reduction and Iteration (SETS)
Reductionmodp
- CrvEllFldFun_Reductionmodp (Example H131E5)
ReductionOrbit
- ReductionOrbit(f) : QuadBinElt -> {@ QuadBinElt @}
Reductions
- Reductions(f, p) : ModFrmElt, RngIntElt -> List
reductions
- Reduced Permutation Actions (PERMUTATION GROUPS)
- Reductions and Embeddings (MODULAR FORMS)
reductions-embeddings
- Reductions and Embeddings (MODULAR FORMS)
ReductionsAndEmbeddings
- ModFrm_ReductionsAndEmbeddings (Example H141E17)
ReductionStep
- ReductionStep(f) : QuadBinElt -> QuadBinElt
ReductionType
- ReductionType(E, p) : CrvEll, RngIntElt -> MonStgElt
Reductive
- IsReductive(L) : AlgLie -> BoolElt
- Rank(G) : GrpLie -> RngIntElt
- ReductiveType(L) : AlgLie -> RootDtm, MonStgElt, SeqEnum, SeqEnum
reductive
- Almost Reductive Lie Algebras (LIE ALGEBRAS)
reductive-construct
- Almost Reductive Lie Algebras (LIE ALGEBRAS)
ReductiveLieAlgebra
- AlgLie_ReductiveLieAlgebra (Example H107E17)
ReductiveRank
- ReductiveRank(G) : GrpLie -> RngIntElt
- Rank(G) : GrpLie -> RngIntElt
ReductiveType
- ReductiveType(L) : AlgLie -> RootDtm, MonStgElt, SeqEnum, SeqEnum
- AlgLie_ReductiveType (Example H107E31)
Reductum
- Reductum(f) : RngMPolElt -> RngMPolElt
- Reductum(f, i) : RngMPolElt, RngIntElt -> RngMPolElt
- Reductum(f) : RngUPolElt -> RngUPolElt
Redundancy
- EliminateRedundancy(~P) : GrpPCpQuotientProc ->
Redundant
- AddRedundantGenerators(G, Q) : GrpSLP, [ GrpSLPElt ] -> GrpSLP
Ree
- IsLargeReeGroup(G) : GrpMat -> BoolElt, RngIntElt
- IsReeGroup(G) : GrpMat -> BoolElt, RngIntElt
- LargeReeElementToWord(G, g) : GrpMat, GrpMatElt -> BoolElt, GrpSLPElt
- LargeReeGroup(q) : RngIntElt -> GrpMat
- LargeReeSylow(G, p) : GrpMat, RngIntElt -> GrpMat, SeqEnum
- RecogniseLargeRee(G : parameters) : GrpMat -> BoolElt, Map, Map, Map, Map
- RecogniseRee(G : parameters) : GrpMat -> BoolElt, Map, Map, Map, Map
- ReeConjugacyClasses(G) : GrpMat -> SeqEnum
- ReeElementToWord(G, g) : GrpMat, GrpMatElt -> BoolElt, GrpSLPElt
- ReeGroup(q) : RngIntElt -> GrpMat
- ReeIrreducibleRepresentation(F, twists : parameters) : FldFin, SeqEnum[RngIntElt] -> GrpMat
- ReeMaximalSubgroups(G) : GrpMat -> SeqEnum, SeqEnum
- ReeMaximalSubgroupsConjugacy(G, R, S) : GrpMat, GrpMat, GrpMat -> GrpMatElt, GrpSLPElt
- ReeMaximals(q) : RngIntElt -> SeqEnum
- ReeSylow(G, p) : GrpMat, RngIntElt -> GrpMat, SeqEnum
- ReeSylowConjugacy(G, R, S, p) : GrpMat, GrpMat, GrpMat, RngIntElt -> GrpMatElt, GrpSLPElt
ree-sylow
- GrpASim_ree-sylow (Example H71E21)
ReeConjugacyClasses
- ReeConjugacyClasses(G) : GrpMat -> SeqEnum
Reed
- ReedMullerCode(r, m) : RngIntElt, RngIntElt -> Code
- ReedMullerCodeRMZ4(s, r, m) : RngIntElt, RngIntElt, RngIntElt -> CodeLinRng, Mtrx
- ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> Code
- ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> CodeLinRng
- ReedMullerCodesLRMZ4(r, m) : RngIntElt, RngIntElt -> SeqEnum
- ReedMullerCodesRMZ4(s, m) : RngIntElt, RngIntElt -> Tup
- ReedSolomonCode(K, d, b) : FldFin, RngIntElt, RngIntElt -> Code
- ReedSolomonCode(n, d) : RngIntElt, RngIntElt -> Code
reed
- Reed--Solomon and Justesen Codes (LINEAR CODES OVER FINITE FIELDS)
reed-solomon-justesen
- Reed--Solomon and Justesen Codes (LINEAR CODES OVER FINITE FIELDS)
ReedMullerCode
- ReedMullerCode(r, m) : RngIntElt, RngIntElt -> Code
- CodeFld_ReedMullerCode (Example H161E7)
ReedMullerCodeQRMZ4
- ReedMullerCodeQRMZ4(r, m) : RngIntElt, RngIntElt -> CodeLinRng
- ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> CodeLinRng
ReedMullerCodeRMZ4
- ReedMullerCodeRMZ4(s, r, m) : RngIntElt, RngIntElt, RngIntElt -> CodeLinRng, Mtrx
ReedMullerCodesLRMZ4
- ReedMullerCodesLRMZ4(r, m) : RngIntElt, RngIntElt -> SeqEnum
ReedMullerCodesRMZ4
- ReedMullerCodesRMZ4(s, m) : RngIntElt, RngIntElt -> Tup
ReedMullerCodeZ4
- ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> Code
- ReedMullerCodeZ4(r, m) : RngIntElt, RngIntElt -> CodeLinRng
ReedSolomonCode
- ReedSolomonCode(K, d, b) : FldFin, RngIntElt, RngIntElt -> Code
- ReedSolomonCode(n, d) : RngIntElt, RngIntElt -> Code
ReeElementToWord
- ReeElementToWord(G, g) : GrpMat, GrpMatElt -> BoolElt, GrpSLPElt
ReeGroup
- ReeGroup(q) : RngIntElt -> GrpMat
ReeIrreducibleRepresentation
- ReeIrreducibleRepresentation(F, twists : parameters) : FldFin, SeqEnum[RngIntElt] -> GrpMat
ReeMaximals
- ReeMaximals(q) : RngIntElt -> SeqEnum
ReeMaximalSubgroups
- ReeMaximalSubgroups(G) : GrpMat -> SeqEnum, SeqEnum
ReeMaximalSubgroupsConjugacy
- ReeMaximalSubgroupsConjugacy(G, R, S) : GrpMat, GrpMat, GrpMat -> GrpMatElt, GrpSLPElt
Rees
- ReesIdeal(P, I): RngMPol, RngMPol -> RngMPol, Map
ReesIdeal
- ReesIdeal(P, I): RngMPol, RngMPol -> RngMPol, Map
ReeSylow
- ReeSylow(G, p) : GrpMat, RngIntElt -> GrpMat, SeqEnum
ReeSylowConjugacy
- ReeSylowConjugacy(G, R, S, p) : GrpMat, GrpMat, GrpMat, RngIntElt -> GrpMatElt, GrpSLPElt
ref-group
- GrpRfl_ref-group (Example H106E2)
Reference
- CremonaReference(D, E) : DB, CrvEll -> MonStgElt
- ReferenceDivisor(F) : FldFun -> OMDiv

V2.28, 13 July 2023

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