[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: print .. Process
Automatic Printing (INPUT AND OUTPUT)
Magma Output: Printing of a Network (NETWORKS)
Print Names (FINITELY PRESENTED ALGEBRAS)
Print Names (MULTIVARIATE POLYNOMIAL RINGS)
Printing (INPUT AND OUTPUT)
Printing of a Multi(di)graph (MULTIGRAPHS)
The print-Statement (INPUT AND OUTPUT)
print expression;
AlgSym_print-style (Example H146E8)
The printf and fprintf Statements (INPUT AND OUTPUT)
printf format, expression, ..., expression;
IO_printf (Example H3E4)
IO_printf (Example H3E6)
IO_printf2 (Example H3E5)
Write(F, x) : MonStgElt, Any ->
PrintFile(F, x) : MonStgElt, Any ->
PrintFile(F, x, L) : MonStgElt, Any, MonStgElt ->
PrintFileMagma(F, x) : MonStgElt, Any ->
SetKantPrinting(f) : BoolElt -> BoolElt
SetPowerPrinting(F, l) : FldFin, BoolElt ->
RngInt_Printing (Example H18E3)
Print Styles (SYMMETRIC FUNCTIONS)
Printing of Elements (BRAID GROUPS)
Printing of Elements (RING OF INTEGERS)
Printing to a File (INPUT AND OUTPUT)
Printing to a File (INPUT AND OUTPUT)
PrintProbabilityDistribution(e) : HilbSpcElt ->
PrintSortedProbabilityDistribution(e) : HilbSpcElt ->
PrintSylowSubgroupStructure(G) : GrpLie ->
PrintTermsOfDegree(s, l, n) : RngPowLazElt, RngIntElt, RngIntElt ->
PrintToPrecision(s, n) : RngPowLazElt, RngIntElt ->
PrintTreesSU(Q, F) : SeqEnum[SeqEnum[Tup]], MonStgElt ->
AlgSrf_prj_crv_res (Example H116E10)
Projection Maps (SMALL MODULAR CURVES)
AlgSrf_prj_res (Example H116E12)
AlgSrf_prm (Example H116E15)
AlgSrf_prm2 (Example H116E16)
Inner Product and Probabilities of Quantum States (QUANTUM CODES)
PrintProbabilityDistribution(e) : HilbSpcElt ->
PrintSortedProbabilityDistribution(e) : HilbSpcElt ->
Probability(e, i) : HilbSpcElt, RngIntElt -> FldReElt
Probability(e, v) : HilbSpcElt, RngIntElt -> FldReElt
ProbabilityDistribution(e) : HilbSpcElt -> Mtrx
ProbabilityDistribution(e) : HilbSpcElt -> Mtrx
IsProbablyPrime(n: parameter) : RngIntElt -> BoolElt
IsProbablePrime(n: parameter) : RngIntElt -> BoolElt
ProbableAutomorphismGroup(A) : FldAb -> GrpFP, SeqEnum
ProbableRadicalDecomposition(I) : RngMPol -> [ RngMPol ]
ProbableAutomorphismGroup(A) : FldAb -> GrpFP, SeqEnum
FldAb_ProbableAutomorphismGroup (Example H39E7)
ProbableRadicalDecomposition(I) : RngMPol -> [ RngMPol ]
IsProbablyPrime(n: parameter) : RngIntElt -> BoolElt
IsProbablePrime(n: parameter) : RngIntElt -> BoolElt
IsProbablyMaximal(G, H: parameters) : GrpPerm, GrpPerm -> BoolElt
IsProbablyPerfect(G : parameters): Grp -> BoolElt
IsProbablyPermutationPolynomial(p) : RngUPolElt -> BoolElt
IsProbablySupersingular(E) : CrvEll -> BoolElt
WordProblem(A, x) : AlgMat -> BoolElt, AlgFrElt
WordProblemData(A) : AlgMat -> List
p := proc< x1, ..., xn, ...: parameters | expression >;
p := proc< x1, ..., xn: parameters | expression >;
Functions and Procedures (FUNCTIONS, PROCEDURES AND PACKAGES)
FUNCTIONS, PROCEDURES AND PACKAGES
Procedure Expressions (MAGMA SEMANTICS)
Procedures (FUNCTIONS, PROCEDURES AND PACKAGES)
p := procedure(x1, ..., xn, ...: parameters) statements : ->
p := procedure(x1, ..., xn: parameters) statements : ->
Procedure Expressions (MAGMA SEMANTICS)
Func_Procedures (Example H2E5)
AbsolutelyIrreducibleRepresentationProcessDelete(~P) : SolRepProc ->
CentralExtensionProcess(G, U) : GrpPC, GrpPC -> Proc
CloseVectorsProcess(L, w, u) : Lat, ModTupRngElt, RngElt -> LatEnumProc
CosetEnumerationProcess(G, H: parameters) : GrpFP, GrpFP -> GrpFPCosetEnumProc
ExtensionProcess(G, M, F) : GrpPerm, ModRng, GrpFP -> GrpFPExtProc
ExtensionProcess(G, M, F) : GrpPerm, ModRng, GrpFP -> Process
HomomorphismsProcess(F, G, A : parameters) : GrpFP, GrpPerm, GrpPerm -> GrpFPHomsProc
IsEmptySimpleQuotientProcess(P) : Rec -> BoolElt
IsolProcess() : -> Process
IsolProcessOfDegree(d) : . -> Process
IsolProcessOfDegreeField(d, p) : ., . -> Process
IsolProcessOfField(p) : . -> Process
LowIndexProcess(G, R : parameters) : GrpFP, RngIntElt -> Process(Lix)
PositiveConjugatesProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc
PrimitiveGroupProcess(d: parameters) : RngIntElt -> Process
PrimitiveGroupProcess(d, f: parameters) : RngIntElt, Program -> Process
ProcessLadder(L, G, U) : [GrpPerm], GrpPerm, GrpPerm -> Rec
RandomProcess(G) : GrpAb -> Process
RandomProcess(G) : GrpFin -> Process
RandomProcess(G) : GrpGPC -> Process
RandomProcess(G) : GrpMat -> Process
RandomProcess(G) : GrpPC -> Process
RandomProcess(G) : GrpPerm -> Process
RandomProcess(G) : GrpSLP -> Process
SUnitCohomologyProcess(S, U) : {RngOrdIdl}, GrpPerm -> {1}
SetProcessParameters(~P: parameters) : GrpFPCosetEnumProc ->
ShortVectorsProcess(L, u) : Lat, RngElt -> LatEnumProc
SimpleQuotientProcess(F, deg1, deg2, ord1, ord2: parameters) : GrpFP, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> Rec
SmallGroupProcess(o: parameters) : RngIntElt -> Process
SmallGroupProcess(o, f: parameters) : RngIntElt, Program -> Process
SmallGroupProcess(S: parameters) : [RngIntElt] -> Process
SmallGroupProcess(S, f: parameters) : [RngIntElt], Program -> Process
SuperSummitProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc
TietzeProcess(G: parameters) : GrpFP -> Process(Tietze)
TransitiveGroupProcess(d) : RngIntElt -> Process
TransitiveGroupProcess(d, f) : RngIntElt, Program -> Process
TransitiveGroupProcess(S) : [RngIntElt] -> Process
TransitiveGroupProcess(S, f) : [RngIntElt], Program -> Process
TransversalProcess(G, H) : GrpPerm, GrpPerm -> GrpPermTransProc
TransversalProcessNext(P) : GrpPermTransProc -> GrpPermElt
TransversalProcessRemaining(P) : GrpPermTransProc -> RngIntElt
UltraSummitProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc
pQuotientProcess(F, p, c: parameters) : GrpFP, RngIntElt, RngIntElt -> Process
[____] [____] [_____] [____] [__] [Index] [Root]
Version: V2.19 of
Mon Dec 17 14:40:36 EST 2012