[____] [____] [_____] [____] [__] [Index] [Root]
Index V
Release Notes V1.00-4 (19 May 1994) (OVERVIEW)
Release Notes V1.00-5 (10 June 1994) (OVERVIEW)
Release Notes V1.00-4 (19 May 1994) (OVERVIEW)
Release Notes V1.00-5 (10 June 1994) (OVERVIEW)
Release Notes V1.01-3 (28 September 1994) (OVERVIEW)
Release Notes V1.01-5 (25 November 1994) (OVERVIEW)
Release Notes V1.01-3 (28 September 1994) (OVERVIEW)
Release Notes V1.01-5 (25 November 1994) (OVERVIEW)
Release Notes V1.02-1 (3 March 1995) (OVERVIEW)
Release Notes V1.02-1 (3 March 1995) (OVERVIEW)
Release Notes V1.10-1 (8 June 1995) (OVERVIEW)
Release Notes V1.10-1 (8 June 1995) (OVERVIEW)
Release Notes V1.20-1 (8 January 1996) (OVERVIEW)
Release Notes V1.20-1 (8 January 1996) since June 1995 (OVERVIEW)
Release Notes V1.20-1 (8 January 1996) (OVERVIEW)
Release Notes V1.20-1 (8 January 1996) since June 1995 (OVERVIEW)
Release Notes V1.30-1 (5 March 1996) (OVERVIEW)
Release Notes V1.30-1 (5 March 1996) (OVERVIEW)
Release Notes V2.01-1 (21 June 1996) (OVERVIEW)
Release Notes V2.01-1 (21 June 1996) (OVERVIEW)
Release Notes V2.10-1 (14 October 1996) (OVERVIEW)
Release Notes V2.10-1 (14 October 1996) (OVERVIEW)
Release Notes V2.20 (18 April 1997) (OVERVIEW)
Release Notes V2.3 (January 30, 1998) (OVERVIEW)
Release Notes V2.4 (December 14, 1998) (OVERVIEW)
Release Notes V2.5 (July 7, 1999) (OVERVIEW)
Release Notes V2.6 (November 8, 1999) (OVERVIEW)
Release Notes V2.7 (June 30, 2000) (OVERVIEW)
Release Notes V2.8 (July 31, 2001) (OVERVIEW)
Precision and Valuation (LOCAL RINGS AND FIELDS)
Precision and Valuation (p-ADIC RINGS AND FIELDS)
Valence(G) : GrphUnd -> RngIntElt
Valency(v) : GrphSplVert -> RngIntElt
HasValidCosetTable(P) : GrpFPCosetEnumProc -> BoolElt
HasValidIndex(P) : GrpFPCosetEnumProc -> BoolElt
Valuation(v) : RngValElt -> RngIntElt
EuclideanNorm(v) : RngValElt -> RngIntElt
Valuation(d, P) : DiffFunElt, PlcFunElt -> RngIntElt
Valuation(a,P) : DiffFunElt,PlcCrvElt -> RngIntElt
Valuation(D,p) : DivCrvElt, Pt -> DivCrvElt
Valuation(D, P) : DivFunElt, PlcFunElt -> RngIntElt
Valuation(f,P) : FldFunElt, PlcCrvElt -> RngIntElt
Valuation(a, P) : FldFunElt, PlcFunElt -> RngIntElt
Valuation(a, P) : FldFunElt, PlcFunElt -> RngIntElt
Valuation(f,p) : FldFunElt,Pt -> RngIntElt
Valuation(x, p) : FldRatElt, RngIntElt -> RngIntElt, FldRatElt
Valuation(P) : PlcCrvElt -> Map
Valuation(p) : Pt -> Map
Valuation(a, P) : RngElt, RngFunOrdIdl -> RngIntElt
Valuation(a, P) : RngFunOrdElt, PlcFunElt -> RngIntElt
Valuation(x, I) : RngIntElt, RngInt -> RngIntElt
Valuation(x, p) : RngIntElt, RngIntElt -> RngIntElt, RngIntElt
Valuation(x) : RngLocElt -> RngIntElt
Valuation(w, I) : RngOrdElt, RngOrdIdl -> RngIntElt
Valuation(I, p) : RngOrdFracIdl, RngOrdIdl -> RngIntElt
Valuation(f) : RngSerElt -> RngIntElt
Valuation(p) : RngUPolElt -> RngIntElt
ValuationRing(F) : FldFun -> RngVal
ValuationRing(F, f) : FldFun, RngUPolElt -> RngVal
ValuationRing(F) : FldFunRat -> RngVal
ValuationRing(F, f) : FldFunRat -> RngVal
ValuationRing(Q, p) : FldRat, RngIntElt -> RngVal
Rings, Fields, and Algebras (OVERVIEW)
Valuation (RATIONAL FIELD)
VALUATION RINGS
ValuationRing(F) : FldFun -> RngVal
ValuationRing(F, f) : FldFun, RngUPolElt -> RngVal
ValuationRing(F) : FldFunRat -> RngVal
ValuationRing(F, f) : FldFunRat -> RngVal
ValuationRing(Q, p) : FldRat, RngIntElt -> RngVal
ValuationsOfRoots(g) : RngUPolElt -> SeqEnum[<FldRatElt, RngIntElt>]
ValuationsOfRoots(g) : RngUPolElt -> SeqEnum[<FldRatElt, RngIntElt>]
ValuationsOfRoots(g) : RngUPolElt -> SeqEnum[<FldRatElt, RngIntElt>]
ValuationsOfRoots(g) : RngUPolElt -> SeqEnum[<FldRatElt, RngIntElt>]
Abs(s) : FldPrElt-> FldPrElt
AbsoluteValue(s) : FldPrElt-> FldPrElt
AbsoluteValue(q) : FldRatElt -> FldRatElt
AbsoluteValue(n) : RngIntElt -> RngIntElt
AbsoluteValue(f) : RngMPolElt -> RngMPolElt
AbsoluteValue(p) : RngUPolElt -> RngUPolElt
ComplexValue(x) : SpcHypElt) -> FldPrElt
ExactValue(z) : SpcHypElt -> .
Call by Value Evaluation (MAGMA SEMANTICS)
Expression (OVERVIEW)
Function Values Assigned to Identifiers (MAGMA SEMANTICS)
AbsoluteValues(a) : FldAlgElt -> [FldPrElt]
ShowValues() : ->
VanLintBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
RngMPol_Vandermonde (Example H45E8)
VanLintBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
VariableExtension(I, k, b) : RngMPol, RngIntElt, BoolElt -> RngMPol, Map
VariableWeights(P) : RngMPol -> [ RngIntElt ]
Environment Variables (ENVIRONMENT AND OPTIONS)
Identifier names (OVERVIEW)
Identifiers and variables (OVERVIEW)
Variable Extension of Ideals (IDEAL THEORY AND GRÖBNER BASES)
Variables (ALGEBRAICALLY CLOSED FIELDS)
Variable Extension of Ideals (IDEAL THEORY AND GRÖBNER BASES)
VariableExtension(I, k, b) : RngMPol, RngIntElt, BoolElt -> RngMPol, Map
IntegerSolutionVariables(L) : LP -> SeqEnum
NumberOfVariables(L) : LP -> RngIntElt
SetIntegerSolutionVariables(L, I, m) : LP, SeqEnum[RngIntElt], BoolElt ->
VariableWeights(P) : RngMPol -> [ RngIntElt ]
Variants of Automorphism Group (GRAPHS)
Elliptic Curves (MODULAR FORMS)
Variety(I) : RngMPol -> [ ModTupFldElt ]
VarietySequence(I) : RngMPol -> [ [ RngElt ] ]
VarietySizeOverAlgebraicClosure(I) : RngMPol -> RngIntElt
GB_Variety (Example H50E10)
Computation of Varieties (IDEAL THEORY AND GRÖBNER BASES)
VarietySequence(I) : RngMPol -> [ [ RngElt ] ]
VarietySizeOverAlgebraicClosure(I) : RngMPol -> RngIntElt
State_Various (Example H1E16)
GilbertVarshamovAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
GilbertVarshamovBound(K, n, d) : FldFin, RngIntElt, RngIntElt -> RngIntElt
GilbertVarshamovLinearBound(K, n, d) : FldFin,RngIntElt,RngIntElt -> RngIntElt
Creating Vectors (MATRICES)
CharacteristicVector(M, S) : ModRng, { RngIntElt } -> ModRngElt
CharacteristicVector(V, S) : ModTupFld, { RngElt } -> ModTupFldElt
CoordinateVector(L, v) : LatElt -> LatElt
CoordinateVector(v) : LatElt -> LatElt
DecomposeVector(U, v) : ModTupRng, ModTupRngElt -> ModTupRngElt, ModTupRngElt
DualVectorSpace(M) : ModSym -> ModTupFld
GradientVector(F) : NwtnPgonFace -> Tup
NextVector(P) : LatEnumProc -> LatElt, RngElt
RSpace(C) : Code -> ModTupRng
ReduceVector(W, ~v) : ModTupRng, ModTupRngElt ->
ReduceVector(W, v) : ModTupRng, ModTupRngElt -> ModTupRngElt
SchreierVector(G, i) : GrpPerm, RngIntElt -> [RngIntElt]
Vector(R, n, Q) : Rng, RngIntElt, [ RngElt ] -> ModTupRngElt
Vector(R, Q) : Rng, [ RngElt ] -> ModTupRngElt
Vector(n, Q) : RngIntElt, [ RngElt ] -> ModTupRngElt
Vector(Q) : [ RngElt ] -> ModTupRngElt
VectorSpace(B) : AlgBas -> ModTupFld
VectorSpace(K, n) : Fld, RngIntElt -> ModTupFld
VectorSpace(K, n, F) : Fld, RngIntElt, Mtrx -> ModTupFld
VectorSpace(K, J) : FldCyc, Fld -> ModTupFld, Map
VectorSpace(F, E) : FldFin, FldFin -> ModTupFld, Map
VectorSpace(F, E, B) : FldFin, FldFin, [ FldFinElt ] -> ModTupFld, Map
VectorSpace(G) : GrpMat -> ModTupFld
VectorSpace(M) : ModSym -> ModTupFld, Map, Map
VectorSpace(V, F) : ModTupFld, Fld -> ModTupFld, Map
VectorSpace(M) : ModTupRng -> ModTupRng
VectorSpace(P) : Plane -> ModTupFld
VectorSpace(Q) : RngMPolRes -> ModTupFld, Map
VectorSpaceWithBasis(B) : [ModTupFldElt] -> ModTupFld
KModuleWithBasis(B) : [ModTupFldElt] -> ModTupFld
Matrices and Vector Spaces Associated with a Graph or Digraph (GRAPHS)
Modules (OVERVIEW)
Representation (UNIVARIATE POLYNOMIAL RINGS)
The Underlying Vector Space (MODULES OVER A MATRIX ALGEBRA)
Vector Enumeration (FINITELY PRESENTED ALGEBRAS)
Vector Enumeration (FINITELY PRESENTED ALGEBRAS)
VECTOR SPACES
Vector Enumeration (FINITELY PRESENTED ALGEBRAS)
Vector Enumeration (FINITELY PRESENTED ALGEBRAS)
Modules (OVERVIEW)
VECTOR SPACES
Representation (UNIVARIATE POLYNOMIAL RINGS)
CloseVectors(L, w, u) : Lat, ModTupRngElt, RngElt -> [ <LatElt, RngElt> ]
CloseVectorsMatrix(L, w, u) : Lat, ModTupRngElt, RngElt -> ModMatRngElt
CloseVectorsProcess(L, w, u) : Lat, ModTupRngElt, RngElt -> LatEnumProc
ClosestVectors(L, w) : Lat, ModTupRngElt -> [ LatElt ], RngElt
ClosestVectorsMatrix(L, w) : Lat, ModTupRngElt -> ModMatRngElt, RngElt
SchreierVectors(G) : GrpPerm -> [ [RngIntElt] ]
ShortVectors(L, u) : Lat, RngElt -> [ <LatElt, RngElt> ]
ShortVectorsMatrix(L, u) : Lat, RngElt -> ModMatRngElt
ShortVectorsProcess(L, u) : Lat, RngElt -> LatEnumProc
ShortestVectors(L) : Lat -> [ LatElt ], RngElt
ShortestVectorsMatrix(L) : Lat -> ModMatRngElt
ModFld_Vectors (Example H63E3)
Reducing Vectors Relative to a Subspace (VECTOR SPACES)
VectorSpace(C) : Code -> ModTupFld
RSpace(C) : Code -> ModTupRng
VectorSpace(B) : AlgBas -> ModTupFld
VectorSpace(K, n) : Fld, RngIntElt -> ModTupFld
VectorSpace(K, n, F) : Fld, RngIntElt, Mtrx -> ModTupFld
VectorSpace(K, J) : FldCyc, Fld -> ModTupFld, Map
VectorSpace(F, E) : FldFin, FldFin -> ModTupFld, Map
VectorSpace(F, E, B) : FldFin, FldFin, [ FldFinElt ] -> ModTupFld, Map
VectorSpace(G) : GrpMat -> ModTupFld
VectorSpace(M) : ModSym -> ModTupFld, Map, Map
VectorSpace(V, F) : ModTupFld, Fld -> ModTupFld, Map
VectorSpace(M) : ModTupRng -> ModTupRng
VectorSpace(P) : Plane -> ModTupFld
VectorSpace(Q) : RngMPolRes -> ModTupFld, Map
FldFin_VectorSpace (Example H47E2)
KSpaceWithBasis(B) : [ModTupFldElt] -> ModTupFld
KModuleWithBasis(B) : [ModTupFldElt] -> ModTupFld
VectorSpaceWithBasis(B) : [ModTupFldElt] -> ModTupFld
Verbose Output (BRANDT MODULES)
ClearVerbose() : ->
GetVerbose(s) : MonStgElt -> RngIntElt
IsVerbose(s) : MonStgElt -> BoolElt
IsVerbose(s, l) : MonStgElt, RngIntElt -> BoolElt
ListVerbose() : ->
SetVerbose("Cunningham", b) : MonStgElt, Boolean ->
SetVerbose("Buchberger", v) : MonStgElt, RngIntElt ->
SetVerbose("CrvHypRed", v) : MonStgElt, RngIntElt ->
SetVerbose("Decomposition", v) : MonStgElt, RngIntElt ->
SetVerbose("Factorization", v) : MonStgElt, RngIntElt ->
SetVerbose("Faugere", v) : MonStgElt, RngIntElt ->
SetVerbose("FFLog", v) : MonStgElt, RngIntElt ->
SetVerbose("FGLM", v) : MonStgElt, RngIntElt ->
SetVerbose("Groebner", v) : MonStgElt, RngIntElt ->
SetVerbose("GroebnerWalk", v) : MonStgElt, RngIntElt ->
SetVerbose("HilbertGroebner", v) : MonStgElt, RngIntElt ->
SetVerbose("Invariants", v) : MonStgElt, RngIntElt ->
SetVerbose("JacHypCnt", v) : MonStgElt, RngIntElt ->
SetVerbose("KBMAG", v) : MonStgElt, RngIntElt ->
SetVerbose("KBMAG", v) : MonStgElt, RngIntElt ->
SetVerbose("KBMAG", v) : MonStgElt, RngIntElt ->
SetVerbose("LLL", v) : MonStgElt, RngIntElt ->
SetVerbose("Newton", v) : MonStgElt, RngIntElt ->
SetVerbose("NilpotentQuotient", n) : MonStgElt, RngIntElt ->
SetVerbose("PolyFact", v) : MonStgElt, RngIntElt ->
SetVerbose("PolyFact", v) : MonStgElt, RngIntElt ->
SetVerbose("SEA", v) : MonStgElt, RngIntElt ->
SetVerbose("SubgroupLattice", i) : MonStgElt, RngIntElt ->
SetVerbose("SubmoduleLattice", i) : MonStgElt, RngIntElt ->
SetVerbose(s, n) : MonStgElt, RngIntElt ->
SetVerbose(s, i) : MonStgElt, RngIntElt ->
Categories and Verbose Output (MODULAR FORMS)
User-defined Verbose Flags (FUNCTIONS, PROCEDURES AND PACKAGES)
Verbose Levels (ENVIRONMENT AND OPTIONS)
Verbose Output (MODULAR SYMBOLS)
Verbosity (IDEAL THEORY AND GRÖBNER BASES)
Verbosity (INVARIANT RINGS OF FINITE GROUPS)
Verbose Output (BRANDT MODULES)
CodeFld_VerboseBestCode (Example H97E41)
Verify(G) : GrpMat ->
Verify(G: parameters ) : RngIntElt ->
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
CodeFld_VerifyLower (Example H97E19)
VerifyMinimumWeightLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumWeightUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumWeightLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumWeightUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
GetVersion() : -> RngIntElt, RngIntElt, RngIntElt
Magma Updates (OVERVIEW)
AddVertex(~G) : Grph ->
AddVertex(~G, l) : Grph, . ->
BranchVertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
InsertVertex(e) : GrphEdge -> Grph
InsertVertex(T) : { GrphEdge } -> Grph
IsLabelledVertex(G, i) : Grph, RngIntElt -> BoolElt
IsTransitive(G : parameters) : GrphUnd -> BoolElt
IsVertex(g,v) : GrphRes,GrphResVert -> BoolElt
IsVertex(N, p) : NwtnPgon,Tup -> BoolElt
OptimalVertexColouring(G) : GrphUnd -> SeqEnum
RemoveVertex(~G, i) : Grph, RngIntElt ->
ResolutionGraphVertex(g,i) : GrphRes,RngIntElt -> GrphResVert
RootVertex(s) : GrphSpl -> GrphSplVert
SpliceDiagramVertex(s,i) : GrphSpl,RngIntElt -> GrphSplVert
UnderlyingVertex(v) : GrphSplVert -> GrphVert
Vertex(v) : GrphResVert -> GrphVert
VertexLabel(G, i) : Grph, RngIntElt -> .
VertexLabels(G) : Grph -> SeqEnum
VertexLabels(G, S) : Grph, [RngIntElt] -> SeqEnum
VertexLabels(s) : GrphSpl -> SeqEnum
VertexPath(u,v) : GrphSplVert,GrphSplVert -> SeqEnum,SeqEnum
VertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
VertexSet(G) : Grph -> GrphVertSet
The Vertex--Set and Edge--Set of a Graph (GRAPHS)
The Vertex--Set and Edge--Set of a Graph (GRAPHS)
VertexLabel(G, i) : Grph, RngIntElt -> .
VertexLabels(G) : Grph -> SeqEnum
VertexLabels(G, S) : Grph, [RngIntElt] -> SeqEnum
VertexLabels(s) : GrphSpl -> SeqEnum
VertexPath(u,v) : GrphSplVert,GrphSplVert -> SeqEnum,SeqEnum
VertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
VertexSet(G) : Grph -> GrphVertSet
VerticalJoin(X, Y) : ModMatRngElt, ModMatRngElt -> ModMatRngElt
VerticalJoin(X, Y) : Mtrx, Mtrx -> Mtrx
VerticalJoin(Q) : [ ModMatRngElt ] -> ModMatRngElt
VerticalJoin(Q) : [ Mtrx ] -> Mtrx
VerticalJoin(X, Y) : ModMatRngElt, ModMatRngElt -> ModMatRngElt
VerticalJoin(X, Y) : Mtrx, Mtrx -> Mtrx
VerticalJoin(Q) : [ ModMatRngElt ] -> ModMatRngElt
VerticalJoin(Q) : [ Mtrx ] -> Mtrx
G +:= n : Grph, RngIntElt ->
AddVertices(~G, n) : Grph, RngIntElt ->
AddVertices(~G, n, L) : Grph, RngIntElt, SeqEnum ->
AllVertices(N) : NwtnPgon -> SeqEnum
CutVertices(G) : Grph -> { GrphVert }
EndVertices(e) : GrphEdge -> [GrphVert]
EndVertices(e) : GrphEdge -> { GrphVert }
EndVertices(F) : NwtnPgon, NwtnPgonFace -> SeqEnum
InnerVertices(N) : NwtnPgon -> SeqEnum
LowerVertices(N) : NwtnPgon -> SeqEnum
OuterVertices(N) : NwtnPgon -> SeqEnum
RemoveVertices(~G, S) : Grph, [RngIntElt] ->
Vertices(G) : Grph -> { GrphVert }
Vertices(s) : GrphSpl -> SeqEnum
Vertices(N) : NwtnPgon -> SeqEnum
Graphs, Vertices and Printing (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
Newton_vertices-ex (Example H58E3)
Vertices and Faces of polygons (NEWTON POLYGONS)
Key Bindings (Emacs and VI mode) (ENVIRONMENT AND OPTIONS)
Key Bindings in VI mode only (ENVIRONMENT AND OPTIONS)
GetViMode() : -> BoolElt
SetViMode(b) : BoolElt ->
MinusVolume(M, prec) : ModSym, RngIntElt) -> FldPrElt
RealVolume(M, prec) : ModSym, RngIntElt -> FldPrElt
VoronoiCell(L) : Lat -> [ ModTupFldElt ], SetEnum , [ ModTupFldElt ]
VoronoiGraph(L) : Lat -> GrphUnd
Lat_Voronoi (Example H66E11)
Voronoi Cells, Holes and Covering Radius (LATTICES)
VoronoiCell(L) : Lat -> [ ModTupFldElt ], SetEnum , [ ModTupFldElt ]
VoronoiGraph(L) : Lat -> GrphUnd
vprintf flag, n: format, expression, ..., expression;
Verbose Printing (vprint, vprintf) (INPUT AND OUTPUT)
vprint flag: expression, ..., expression;
vprintf flag: format, expression, ..., expression;
vprintf flag, n: format, expression, ..., expression;
vprintf flag: format, expression, ..., expression;
vtime flag: statement;
[____] [____] [_____] [____] [__] [Index] [Root]