Documentation

equation
- Diophantine Equations (NUMBER FIELDS AND ORDERS)
- Norm Equations (NUMBER FIELDS AND ORDERS)
- Nullspace and Rowspace (SPARSE MATRICES)
- Nullspaces and Solutions of Systems (MATRICES)
- Solutions of Systems of Linear Equations (MATRIX ALGEBRAS)
- Solving Equations over Z/mZ (INTEGER RESIDUE CLASS RINGS)
- Solving Norm Equations (NUMBER FIELDS)
- The Solution of Modular Equations (RING OF INTEGERS)
- Unit Equations (NUMBER FIELDS AND ORDERS)
EquationOrder
- EquationOrder(A) : FldAb -> RngOrd
- EquationOrder(K) : FldNum -> RngOrd
- EquationOrder(F) : FldQuad -> RngQuad
- EquationOrder(O) : RngFunOrd -> RngFunOrd
- EquationOrder(O) : RngOrd -> RngOrd
- EquationOrder(f) : RngUPolElt -> RngOrd
- EquationOrder(S) : [RngUPolElt] -> RngOrd
EquationOrderFinite
- EquationOrderFinite(F) : FldFun -> RngFunOrd
EquationOrderInfinite
- EquationOrderInfinite(F) : FldFun -> RngFunOrd
Equations
- DefiningEquations(model) : ModelG1 -> [ RngMPolElt ]
- DefiningPolynomials(f) : MapSch -> SeqEnum
- DefiningPolynomials(X) : Sch -> SeqEnum
- Equations(model) : ModelG1 -> [ RngMPolElt ]
- LinearSpanEquations(C) : TorCon -> SeqEnum
equations
- Functions of the Equations (SCHEMES)
- Norm Equations (CLASS FIELD THEORY)
Equidimensional
- EquidimensionalDecomposition(I) : RngMPol -> [ RngMPol ]
- FineEquidimensionalDecomposition(I) : RngMPol -> SeqEnum
- EquidimensionalPart(I) : RngMPol -> RngMPol
equidimensional
- Equidimensional Decomposition (POLYNOMIAL RING IDEAL OPERATIONS)
equidimensional-decomposition
- Equidimensional Decomposition (POLYNOMIAL RING IDEAL OPERATIONS)
EquidimensionalDecomposition
- EquidimensionalDecomposition(I) : RngMPol -> [ RngMPol ]
- FineEquidimensionalDecomposition(I) : RngMPol -> SeqEnum
- EquidimensionalPart(I) : RngMPol -> RngMPol
- Ideal_EquidimensionalDecomposition (Example H113E12)
EquidimensionalPart
- EquidimensionalDecomposition(I) : RngMPol -> [ RngMPol ]
- FineEquidimensionalDecomposition(I) : RngMPol -> SeqEnum
- EquidimensionalPart(I) : RngMPol -> RngMPol
Equidistant
- IsEquidistant(C) : Code -> BoolElt
Equitable
- EquitablePartition(P, G) : { { GrphVert } }, GrphUnd -> { { GrphVert } }
- IsEquitable(G, P) : GrphUnd, { { GrphVert } } -> BoolElt
EquitablePartition
- EquitablePartition(P, G) : { { GrphVert } }, GrphUnd -> { { GrphVert } }
equivalence
- IsEquivalent(C, D: parameters) : Code, Code -> BoolElt, Map
- Equivalence and Isomorphism of Codes (LINEAR CODES OVER FINITE FIELDS)
- Equivalence of Genus One Models (MODELS OF GENUS ONE CURVES)
- Linear Equivalence of Divisors (ALGEBRAIC CURVES)
Equivalent
- AreLinearlyEquivalent(D,E) : DivCrvElt, DivCrvElt -> BoolElt
- AreLinearlyEquivalent(D,E) : DivTorElt,DivTorElt -> BoolElt
- ColonIdealEquivalent(I, f) : RngMPol, RngMPolElt -> RngMPol, RngMPolElt
- EquivalentPoint(x) : SpcHypElt -> SpcHypElt, GrpPSL2Elt
- IsBravaisEquivalent(G, H) : GrpMat[RngInt], GrpMat[RngInt] -> BoolElt, GrpMatElt
- IsCartanEquivalent(C1, C2) : AlgMatElt, AlgMatElt -> BoolElt
- IsCartanEquivalent(G, H) : GrpLie, GrpLie -> BoolElt
- IsCartanEquivalent(W1, W2) : GrpMat, GrpMat -> BoolElt
- IsCartanEquivalent(W1, W2) : GrpPermCox, GrpPermCox -> BoolElt
- IsCartanEquivalent(N1, N2) : MonStgElt, MonStgElt -> BoolElt
- IsCartanEquivalent(R1, R2) : RootDtm, RootDtm -> BoolElt, SeqEnum
- IsCartanEquivalent(R1, R2) : RootSys, RootSys -> BoolElt
- IsEquivalent(G,a,b) : GrpPSL2, SpcHypElt, SpcHypElt -> BoolElt, GrpPSL2Elt
- IsEquivalent(g,h,G) : GrpPSL2Elt, GrpPSL2Elt, GrpPSL2 -> BoolElt
- IsEquivalent(model1, model2) : ModelG1, ModelG1 -> BoolElt, TransG1
- IsEquivalent(f, g) : QuadBinElt, QuadBinElt -> BoolElt, AlgMatElt
- IsEquivalent(f,g) : RngUPolElt, RngUPolElt -> BoolElt
- IsEquivalent(P,Q) : TorPol,TorPol -> BoolElt, Map, TorLatElt
- IsGL2Equivalent(f, g, n) : RngUPolElt, RngUPolElt, RngIntElt -> BoolElt, SeqEnum
- IsGL2EquivalentExtended(f1, f2, deg) : RngUPolElt, RngUPolElt, RngIntElt -> BoolElt, List
- IsHadamardEquivalent(H, J : parameters) : AlgMatElt, AlgMatElt -> BoolElt, AlgMatElt, AlgMatElt
- IsIsomorphic(C, D: parameters) : Code, Code -> BoolElt, Map
- IsKnuthEquivalent(w1, w2) : MonOrdElt, MonOrdElt -> BoolElt
- IsLinearlyEquivalent(D1,D2) : DivCrvElt,DivCrvElt -> BoolElt
- IsLinearlyEquivalent(D,E) : DivSchElt, DivSchElt -> BoolElt, FldFunFracSchElt
- IsLinearlyEquivalentToCartier(D) : DivTorElt -> BoolElt, DivTorElt
- IsRationallyEquivalent(L1, L2) : LatNF, LatNF -> BoolElt
- IsRationallyEquivalent(L1, L2, p) : LatNF, LatNF, RngOrdIdl -> BoolElt
- LinearlyEquivalentDivisorWithNoSupportOn(D,S) : DivTorElt,[RngMPolElt] -> DivTorElt
equivalent
- Writing Representations over Subfields (MATRIX GROUPS OVER FINITE FIELDS)
equivalent-rep
- Writing Representations over Subfields (MATRIX GROUPS OVER FINITE FIELDS)
EquivalentPoint
- EquivalentPoint(x) : SpcHypElt -> SpcHypElt, GrpPSL2Elt
Erf
- Erf(r) : FldReElt -> FldReElt
- ErrorFunction(r) : FldReElt -> FldReElt
Erfc
- Erfc(r) : FldReElt -> FldReElt
- ComplementaryErrorFunction(r) : FldReElt -> FldReElt
errmsg
- Common Error Messages, and How to Avoid Them (AUTOMATIC AND HYPERBOLIC GROUPS)
Error
- Erfc(r) : FldReElt -> FldReElt
- ComplementaryErrorFunction(r) : FldReElt -> FldReElt
- Error(x) : Any -> Err
- ErrorFunction(r) : FldReElt -> FldReElt
- QuantumBinaryErrorGroup(n) : RngIntElt -> GrpPC
- QuantumErrorGroup(Q) : CodeQuantum -> GrpPC
- QuantumErrorGroup(p, n) : RngIntElt, RngIntElt -> GrpPC
- SetDebugOnError(f) : BoolElt ->
- SetQuitOnError(b) : BoolElt ->

V2.28, 13 July 2023

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