[____] [____] [_____] [____] [__] [Index] [Root]
Index W
W
w
CordaroWagnerCode(n) : RngIntElt -> Code
IsWeaklyAG(C) : Code -> BoolElt
IsWeaklyConnected(G) : GrphDir -> BoolElt
IsWeaklyEqual(f, g) : RngSerElt, RngSerElt -> BoolElt
IsWeaklySelfDual(C) : Code -> BoolElt
IsWeaklySelfDual(C) : Code -> BoolElt
IsWeaklyZero(f) : RngSerElt -> BoolElt
CodeFld_WeaklySelfDual (Example H97E18)
WeberClassPolynomial(D) : RngIntElt -> RngUPolElt
WeberClassPolynomial(D) : RngIntElt -> RngUPolElt
WeberF(s) : FldPrElt -> FldPrElt
WeberF2(s) : FldPrElt -> FldPrElt
WeberF2(g) : RngSerElt -> RngSerElt
Weber's Functions (REAL AND COMPLEX FIELDS)
WeberClassPolynomial(D) : RngIntElt -> RngUPolElt
WeberClassPolynomial(D) : RngIntElt -> RngUPolElt
WeberF(s) : FldPrElt -> FldPrElt
WeberF2(s) : FldPrElt -> FldPrElt
WeberF2(g) : RngSerElt -> RngSerElt
AlgGrp_wedderburn (Example H73E3)
IsEllipticWeierstrass(C) : Crv -> BoolElt
IsHyperellipticWeierstrass(C) : Crv -> BoolElt
IsWeierstrassModel(E) : CrvEll -> BoolElt
IsWeierstrassPlace(P) : PlcCrvElt -> BoolElt
IsWeierstrassPlace(P) : PlcFunElt -> BoolElt
MinimalWeierstrassModel(C) : CrvHyp -> CrvHyp, MapCrvHyp
ReducedMinimalWeierstrassModel(C) : CrvHyp -> CrvHyp, MapCrvHyp
WeierstrassForm(C,p) : Crv, Pt -> CrvEll, MapSch
WeierstrassModel(E) : CrvEll -> CrvEll, Map, Map
WeierstrassPlaces(D) : DivCrvElt -> SeqEnum
WeierstrassPlaces(F) : FldFunG -> [PlcFunElt]
WeierstrassPlaces(F) : FldFunG -> [PlcFunElt]
WeierstrassPlaces(D) : DivFunElt -> [PlcFunElt]
WeierstrassSeries(z, t) : FldPrElt, RngSerElt -> RngSerElt
WeierstrassSeries(z, q, p) : RngElt, RngSerElt, RngIntElt -> RngSerElt
WeierstrassSeries(z, F) : RngSerElt, QuadBinElt -> RngSerElt
WeierstrassSeries(z, f) : RngSerElt, QuadBinElt -> RngSerElt
WeierstrassSeries(z, q) : RngSerElt, RngSerElt -> RngSerElt
WeierstrassSeries(z, L) : RngSerElt, SeqEnum -> RngSerElt
pMinimalWeierstrassModel(C, p) : CrvHyp, RngIntElt -> CrvHyp, MapCrvHyp
Weierstrass Series (REAL AND COMPLEX FIELDS)
WeierstrassForm(C,p) : Crv, Pt -> CrvEll, MapSch
WeierstrassModel(E) : CrvEll -> CrvEll, Map, Map
WeierstrassPoints(D) : DivCrvElt -> SeqEnum
WeierstrassPlaces(D) : DivCrvElt -> SeqEnum
WeierstrassPlaces(F) : FldFunG -> [PlcFunElt]
WeierstrassPlaces(F) : FldFunG -> [PlcFunElt]
WeierstrassPlaces(D) : DivFunElt -> [PlcFunElt]
WeierstrassPoints(D) : DivCrvElt -> SeqEnum
WeierstrassPlaces(D) : DivCrvElt -> SeqEnum
ModForm_WeierstrassPoints (Example H90E8)
WeierstrassSeries(z, t) : FldPrElt, RngSerElt -> RngSerElt
WeierstrassSeries(z, q, p) : RngElt, RngSerElt, RngIntElt -> RngSerElt
WeierstrassSeries(z, F) : RngSerElt, QuadBinElt -> RngSerElt
WeierstrassSeries(z, f) : RngSerElt, QuadBinElt -> RngSerElt
WeierstrassSeries(z, q) : RngSerElt, RngSerElt -> RngSerElt
WeierstrassSeries(z, L) : RngSerElt, SeqEnum -> RngSerElt
RemoveWeight(X,w) : VSrfK3,RngIntElt -> VSrfK3
AddWeight(X,w) : VSrfK3,RngIntElt -> VSrfK3
CompleteWeightEnumerator(C): Code -> RngMPolElt
CompleteWeightEnumerator(C): Code -> RngMPolElt
CompleteWeightEnumerator(C, u): Code, ModTupFldElt -> RngMPolElt
DominantWeight( W, v ) : GrpCox, . -> ModTupFldElt, []
DualWeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
DualWeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
EvenWeightCode(n) : RngIntElt -> Code
ExponentSum(w, x) : GrpFPElt, GrpFPElt -> RngIntElt
ExpurgateWeightCode(C, w) : Code,RngIntElt -> Code
GriesmerMinimumWeightBound(K, n, k) : FldFin,RngIntElt,RngIntElt->RngIntElt
LeeWeight(u) : ModTupRngElt -> RngIntElt
LeeWeight(v) : ModTupRngElt -> RngIntElt
LeeWeightEnumerator(C): Code -> RngMPolElt
MinimumWeight(C) : Code -> RngIntElt
MinimumWeight(C) : Code -> RngIntElt
PCClass(x) : GrpPCElt -> RngIntElt
SkewWeight(t) : Tableau -> RngIntElt
SubcodeWordsOfWeight(C, S) : Code,RngIntElt -> Code
SymmetricWeightEnumerator(C): Code -> RngMPolElt
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
Weight(M) : ModFrm -> RngIntElt
Weight(f) : ModFrmElt -> RngIntElt
Weight(u) : ModTupFldElt -> RngIntElt
Weight(u) : ModTupRngElt -> RngIntElt
Weight(u) : ModTupRngElt -> RngIntElt
Weight(v) : ModTupRngElt -> RngIntElt
Weight(F) : NwtnPgonFace -> RngIntElt
Weight(P) : SeqEnum -> RngIntElt
Weight(t) : Tableau -> RngIntElt
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C, u) : Code, ModTupFldElt -> [ <RngIntElt, RngIntElt> ]
WeightEnumerator(C): Code -> RngMPolElt
WeightEnumerator(C): Code -> RngMPolElt
WeightEnumerator(C): Code -> RngMPolElt
WeightEnumerator(C, u): Code, ModTupFldElt -> RngMPolElt
WeightLattice( G ) : RootDtm -> Lat
WeightLattice( RD ) : RootDtm -> Lat
WeightLattice( W ) : RootDtm -> Lat
WeightOrbit( W, v ) : GrpCox, . -> @ @
WordsOfBoundedWeight(C, l, u) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
Graded Polynomial Rings (IDEAL THEORY AND GRÖBNER BASES)
Graded Polynomial Rings (MULTIVARIATE POLYNOMIAL RINGS)
The Minimum Weight (LINEAR CODES OVER FINITE FIELDS)
The Minimum Weight (LINEAR CODES OVER FINITE RINGS)
The Weight Distribution (LINEAR CODES OVER FINITE FIELDS)
The Weight Distribution (LINEAR CODES OVER FINITE RINGS)
The Weight Enumerator (LINEAR CODES OVER FINITE FIELDS)
Weight Enumerators (LINEAR CODES OVER FINITE RINGS)
Weight: weight (IDEAL THEORY AND GRÖBNER BASES)
Weights (FINITELY PRESENTED ALGEBRAS)
Weights (FINITELY PRESENTED ALGEBRAS)
The Weight Distribution (LINEAR CODES OVER FINITE FIELDS)
The Weight Distribution (LINEAR CODES OVER FINITE RINGS)
The Weight Enumerator (LINEAR CODES OVER FINITE FIELDS)
Weight Enumerators (LINEAR CODES OVER FINITE RINGS)
WeightClass(x) : GrpPCElt -> RngIntElt
PCClass(x) : GrpPCElt -> RngIntElt
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C, u) : Code, ModTupFldElt -> [ <RngIntElt, RngIntElt> ]
CodeFld_WeightDistribution (Example H97E20)
LeadingWeightedDegree(f) : RngMPolElt -> RngIntElt
MonomialsOfWeightedDegree(P) : RngMPolElt -> {@ RngMPolElt @}
WeightedDegree(f) : FldFunRatElt -> RngIntElt
WeightedDegree(f) : RngMPolElt -> RngIntElt
Crv_weighted-blowup (Example H82E5)
WeightedDegree(f) : FldFunRatElt -> RngIntElt
WeightedDegree(f) : RngMPolElt -> RngIntElt
WeightEnumerator(C): Code -> RngMPolElt
WeightEnumerator(C): Code -> RngMPolElt
WeightEnumerator(C, u): Code, ModTupFldElt -> RngMPolElt
CodeFld_WeightEnumerator (Example H97E21)
CodeRng_WeightEnumerator (Example H98E10)
CoweightLattice( G ) : RootDtm -> Lat
WeightLattice( G ) : RootDtm -> Lat
WeightLattice( RD ) : RootDtm -> Lat
WeightLattice( W ) : RootDtm -> Lat
WeightOrbit( W, v ) : GrpCox, . -> @ @
FundamentalCoweights( W ) : GrpCox -> SeqEnum
FundamentalWeights( W ) : GrpCox -> SeqEnum
FundamentalWeights( G ) : GrpLie -> SeqEnum
FundamentalWeights( RD ) : RootDtm -> Mtrx
K3SurfacesFromWeights(DB,W) : SeqEnum,SeqEnum -> SeqEnum
SpecialWeights(G) : GrpPC -> [ <RngIntElt, RngIntElt, RngIntElt> ]
VariableWeights(P) : RngMPol -> [ RngIntElt ]
Weights(X) : VSrfK3 -> SeqEnum
RootDtm_Weights (Example H35E14)
Roots, coroots and weights (ROOT DATA FOR LIE THEORY)
Weights (COXETER GROUPS)
Weights (ROOT DATA FOR LIE THEORY)
MordellWeilGroup(H: parameters) : SetPtEll -> GrpAb, Map
AbelianGroup(H: parameters) : SetPtEll -> GrpAb, Map
NaiveHeight(P) : PtEll -> FldPrElt
Rank(H: parameters) : SetPtEll -> RngIntElt
RankBounds(H: parameters) : SetPtEll -> RngIntElt, RngIntElt
WeilPairing(P, Q, m) : JacHypPt, JacHypPt, RngIntElt -> RngElt
WeilPairing(P, Q, n) : PtEll, PtEll, RngIntElt -> RngElt
WeilRestriction(E, n) : FldFun, RngIntElt -> FldFun, UserProgram
Heights and Mordell--Weil Group (HYPERELLIPTIC CURVES)
Weil Pairing (ELLIPTIC CURVES)
WeilHeight(P) : PtEll -> FldPrElt
NaiveHeight(P) : PtEll -> FldPrElt
WeilPairing(P, Q, m) : JacHypPt, JacHypPt, RngIntElt -> RngElt
WeilPairing(P, Q, n) : PtEll, PtEll, RngIntElt -> RngElt
CrvEll_WeilPairing (Example H85E13)
Weil Pairing (HYPERELLIPTIC CURVES)
WeilRestriction(E, n) : FldFun, RngIntElt -> FldFun, UserProgram
WeylGroup( G ) : GrpLie -> GrpCox
WeylGroup( G ) : GrpLie -> GrpCox
The case statement (OVERVIEW)
The where ... is Construction (STATEMENTS AND EXPRESSIONS)
State_where (Example H1E9)
expression_1 where identifier := expression_2
expression_1 where identifier is expression_2
The where ... is Construction (STATEMENTS AND EXPRESSIONS)
expression_1 where identifier is expression_2
The while statement (OVERVIEW)
while boolexpr do statements end while : ->
State_while (Example H1E13)
CuspWidth(G,x) : GrpPSL2, SetCspElt -> RngIntElt
Widths(FS) : SymFry -> SeqEnum
IsWildlyRamified(K) : FldAlg -> BoolElt
IsWildlyRamified(O) : RngOrd -> BoolElt
IsWildlyRamified(P) : RngOrdIdl -> BoolElt
IsWildlyRamified(P, O) : RngOrdIdl, RngOrd -> BoolElt
MacWilliamsTransform(n, k, K, W) : RngIntElt, RngIntElt, FldFin, RngMPol -> RngMPol
MacWilliamsTransform(n, k, q, W) : RngIntElt, RngIntElt, RngIntElt, [ <RngIntElt, RngIntElt> ] -> [ <RngIntElt, RngIntElt> ]
TwistedWindingElement(M, i, eps) : ModSym, RngIntElt, GrpDrchElt -> ModSymElt
TwistedWindingSubmodule(M, j, eps) : ModSym, RngIntElt, GrpDrchElt -> ModTupFld
WindingElement(M) : ModSym -> ModSymElt
WindingElement(M, i) : ModSym, RngIntElt -> ModSymElt
WindingLattice(M, j : parameters) : ModSym, RngIntElt -> Lat
WindingSubmodule(M, j : parameters) : ModSym, RngIntElt -> ModTupFld
Winding Elements (MODULAR SYMBOLS)
WindingElement(M) : ModSym -> ModSymElt
WindingElement(M, i) : ModSym, RngIntElt -> ModSymElt
WindingLattice(M, j : parameters) : ModSym, RngIntElt -> Lat
WindingSubmodule(M, j : parameters) : ModSym, RngIntElt -> ModTupFld
ConstituentsWithMultiplicities(M) : ModRng -> [ <ModRng, RngIntElt> ]
ImageWithBasis(X, M) : ModMatRngElt, ModRng -> ModRng
IsGlobalUnitWithPreimage(a) : FldFunElt -> BoolElt, GrpAbElt
IsGlobalUnitWithPreimage(a) : FldFunElt -> BoolElt, GrpAbElt
IsSUnitWithPreimage(a, S) : FldFunElt, SetEnum[PlcFunElt] -> BoolElt, GrpAbElt
IsUnitWithPreimage(a) : RngFunOrdElt -> BoolElt, GrpAbElt
KMatrixSpaceWithBasis(Q) : [ ModMatRngElt ] -> ModMatRng
LatticeWithBasis(G, B) : GrpMat, ModMatRngElt -> Lat
LatticeWithBasis(G, B, M) : GrpMat, ModMatRngElt, AlgMatElt -> Lat
LatticeWithBasis(B) : ModMatRngElt -> Lat
LatticeWithBasis(B, M) : ModMatRngElt, AlgMatElt -> Lat
LatticeWithGram(F) : AlgMatElt -> Lat
LatticeWithGram(G, F) : GrpMat, AlgMatElt -> Lat
RMatrixSpaceWithBasis(Q) : [ ModMatRngElt ] -> ModMatRng
RMatrixSpaceWithBasis(Q) : [ModTupRngElt] -> ModMatRng
RModuleWithBasis(Q) : [ModRngElt] -> ModTupRng
UpperHalfPlaneWithCusps() : -> SpcHyp
VectorSpaceWithBasis(B) : [ModTupFldElt] -> ModTupFld
KModuleWithBasis(B) : [ModTupFldElt] -> ModTupFld
Construction of a Module with Specified Basis (FREE MODULES)
Modules öm_(R)(M, N) with Given Basis (FREE MODULES)
HasseWittInvariant(F) : FldFunG -> RngIntElt
HasseWittInvariant(F) : FldFunG -> RngIntElt
WittDesign(n) : RngIntElt -> Dsgn
The Witt Designs (INCIDENCE STRUCTURES AND DESIGNS)
WittDesign(n) : RngIntElt -> Dsgn
Design_wittex (Example H94E4)
IsLittleWoodRichardsonSkew(t) : Tableau -> BoolElt
ActingWord(G, x, y) : GrpPerm, Elt, Elt -> GrpFPElt
ColumnWord(t) : Tableau -> SeqEnum
EcheloniseWord(~P, ~r) : Process(pQuot) -> RngIntElt
InverseWordMap(G) : GrpMat -> Map
InverseWordMap(G) : GrpPerm -> Map
IsReverseLatticeWord(w) : SeqEnum -> BoolElt
MatrixToWord( W, M ) : GrpCox, AlgMatElt -> SeqEnum
MinimumWord(C) : Code -> ModTupFldElt
PermToWord( W, p ) : GrpCox, GrpPermElt -> SeqEnum
RotateWord(u, n) : GrpFPElt, RngIntElt -> GrpFPElt
RotateWord(u, n) : SgpFPElt, RngIntElt -> SgpFPElt
Word(t) : Tableau -> SeqEnum
WordGroup(G) : GrpMat -> GrpSLP, Map
WordGroup(G) : GrpPerm -> GrpBB, Map
WordOnRoot( W, r, w ) : GrpCox, RngIntElt, . -> RngIntElt
WordOnRootSpace( W, v, w ) : GrpCox, ., . -> .
WordProduct( F, w1, w2 ) : GrpFP, GrpFPElt, GrpFPElt -> GrpFPElt
WordStrip(H, x) : GrpPerm, GrpPermElt -> BoolElt, GrpFPElt, RngIntElt
WordToMatrix( W, w ) : GrpCox, [] -> AlgMatElt
WordToPerm( W, w ) : GrpCox, [] -> GrpPermElt
WordToTableau(w) : SeqEnum -> Tableau
Access Functions for Words (FINITELY PRESENTED GROUPS)
Arithmetic Operators for Words (FINITELY PRESENTED GROUPS)
Construction of Words (FINITELY PRESENTED GROUPS)
Permutations as Words (PERMUTATION GROUPS)
Access Functions for Words (FINITELY PRESENTED GROUPS)
Arithmetic Operators for Words (FINITELY PRESENTED GROUPS)
Construction of Words (FINITELY PRESENTED GROUPS)
Permutations as Words (PERMUTATION GROUPS)
GrpFP_1_WordAccess (Example H22E2)
GrpCox_WordArithmetic (Example H36E15)
WordGroup(G) : GrpMat -> GrpSLP, Map
WordGroup(G) : GrpPerm -> GrpBB, Map
WordOnCorootSpace( W, v, w ) : GrpCox, ., . -> .
WordOnRootSpace( W, v, w ) : GrpCox, ., . -> .
WordOnRoot( W, r, w ) : GrpCox, RngIntElt, . -> RngIntElt
WordOnCorootSpace( W, v, w ) : GrpCox, ., . -> .
WordOnRootSpace( W, v, w ) : GrpCox, ., . -> .
GrpCox_WordOperations (Example H36E14)
GrpFP_2_WordOps (Example H23E2)
WordProduct( F, w1, w2 ) : GrpFP, GrpFPElt, GrpFPElt -> GrpFPElt
ConstantWords(C, i) : Code, RngIntElt -> { ModTupFldElt }
GeneratingWords(G, H) : GrpFP, GrpFP -> { GrpFPElt }
MinimumWords(C) : Code -> { ModTupFldElt }
NumberOfConstantWords(C, i) : Code, RngIntElt -> RngIntElt
NumberOfWords(C, w) : Code, RngIntElt -> RngIntElt
SubcodeWordsOfWeight(C, S) : Code,RngIntElt -> Code
Words(C, w) : Code, RngIntElt -> { ModTupFldElt }
WordsOfBoundedWeight(C, l, u) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
CodeFld_Words (Example H97E23)
GrpAtc_Words (Example H31E2)
GrpFP_1_Words (Example H22E3)
GrpRWS_Words (Example H30E2)
MonRWS_Words (Example H18E2)
Low Level Operations on Words (FP GROUPS - ADVANCED FEATURES)
Matrices as Words (MATRIX GROUPS)
Words (ENUMERATIVE COMBINATORICS)
Words (LINEAR CODES OVER FINITE FIELDS)
WordsOfBoundedWeight(C, l, u) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
WordStrip(H, x) : GrpPerm, GrpPermElt -> BoolElt, GrpFPElt, RngIntElt
WordToDualMatrix( W, w ) : GrpCox, [] -> AlgMatElt
WordToMatrix( W, w ) : GrpCox, [] -> AlgMatElt
WordToDualMatrix( W, w ) : GrpCox, [] -> AlgMatElt
WordToMatrix( W, w ) : GrpCox, [] -> AlgMatElt
WordToPerm( W, w ) : GrpCox, [] -> GrpPermElt
WordToTableau(w) : SeqEnum -> Tableau
Saving and restoring Magma states (OVERVIEW)
Saving and Restoring Workspaces (INPUT AND OUTPUT)
The World of Rings (INTRODUCTION [BASIC RINGS])
PrimitiveWreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm
PrimitiveWreathProduct(Q) : [ GrpPerm ] -> GrpPerm
TensorWreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat
WreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat
WreathProduct(G, H) : GrpPC, GrpPC -> GrpPC
WreathProduct(G, H, f) : GrpPC, GrpPC, Map -> GrpPC
WreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm, SeqEnum[Map], Map, Map
WreathProduct(Q) : [ GrpPerm ] -> GrpPerm
WreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat
WreathProduct(G, H) : GrpPC, GrpPC -> GrpPC
WreathProduct(G, H, f) : GrpPC, GrpPC, Map -> GrpPC
WreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm, SeqEnum[Map], Map, Map
WreathProduct(Q) : [ GrpPerm ] -> GrpPerm
Write(F, x) : MonStgElt, Var ->
PrintFile(F, x) : MonStgElt, Var ->
PrintFile(F, x, L) : MonStgElt, Var, MonStgElt ->
WriteOverLargerField(G) : GrpMat -> GrpMat, GrpMat, GrpAb, SeqEnum
WriteOverSmallerField(G, F) : GrpMat, FldFin -> GrpMat, Map
WriteOverLargerField(G) : GrpMat -> GrpMat, GrpMat, GrpAb, SeqEnum
WriteOverSmallerField(G, F) : GrpMat, FldFin -> GrpMat, Map
GrpMat_WriteOverSmallerField (Example H21E38)
WronskianOrders(D) : DivCrvElt -> SeqEnum
WronskianOrders(F) : FldFunG -> [RngIntElt]
WronskianOrders(D) : DivFunElt -> [RngIntElt]
WronskianOrders(D) : DivCrvElt -> SeqEnum
WronskianOrders(F) : FldFunG -> [RngIntElt]
WronskianOrders(D) : DivFunElt -> [RngIntElt]
[____] [____] [_____] [____] [__] [Index] [Root]