[____] [____] [_____] [____] [__] [Index] [Root]

Index F


F

WeberF(s) : FldPrElt -> FldPrElt

f

f(X) : Sch, MapSch -> Sch
Image(f) : MapSch -> Sch
f(p) : MapSch,Pt -> Pt
f(K) : MapSch,Rng -> Map

F-key

F<char>

f-key

f<char>

F2

WeberF2(s) : FldPrElt -> FldPrElt
WeberF2(g) : RngSerElt -> RngSerElt

F27

GrpFP_1_F27 (Example H19E18)

F276

GrpFP_1_F276 (Example H19E55)

F29

GrpFP_1_F29 (Example H19E57)

F4

GrpCox_F4 (Example H34E12)

Face

Face(e) : GrphEdge -> SeqEnum
Face(u, v) : GrphVert, GrphVert -> SeqEnum
FaceFunction(F) : NwtnPgon,Tup -> RngElt
IsFace(N, F) : NwtnPgon,Tup -> BoolElt

FaceFunction

FaceFunction(F) : NwtnPgon,Tup -> RngElt

Faces

AllFaces(N) : NwtnPgon -> SeqEnum
Faces(G) : GraphUnd -> SeqEnum[GrphVert]
Faces(N) : NwtnPgon -> SeqEnum
FacesContaining(N,p) : NwtnPgon,Tup -> SeqEnum
InnerFaces(N) : NwtnPgon -> SeqEnum
LowerFaces(N) : NwtnPgon -> SeqEnum
NFaces(G) : GraphUnd -> RngIntElt
OuterFaces(N) : NwtnPgon -> SeqEnum

faces-ex

Newton_faces-ex (Example H54E2)

FacesContaining

FacesContaining(N,p) : NwtnPgon,Tup -> SeqEnum

Facint

FactorizationToInteger(f) : RngIntEltFact -> RngIntElt
Facint(f) : RngIntEltFact -> RngIntElt
FactorizationToInteger(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt

Fact

SequenceToFactorization(s) : SeqEnum -> RngIntEltFact
SeqFact(s) : SeqEnum -> RngIntEltFact

fact

Factorization (LOCAL RINGS AND FIELDS)
Factorization (p-ADIC RINGS AND FIELDS)

Factor

ClassGroupCyclicFactorGenerators(O) : RngOrd -> ModHomElt
EulerFactor(J) : JacHyp -> RngUPolElt
EulerFactor(J, K) : JacHyp, FldFin -> RngUPolElt
EulerFactorModChar(J) : JacHyp -> RngUPolElt
FactorBasis(K, B) : FldNum, RngIntElt -> [ RngOrdIdl ]
FactorBasis(O) : RngOrd -> [ RngOrdIdl ], Integer
SocleFactor(G) : GrpPerm -> GrpPerm

factor

Factorization (RING OF INTEGERS)

FactorBasis

FactorBasis(K, B) : FldNum, RngIntElt -> [ RngOrdIdl ]
FactorBasis(O) : RngOrd -> [ RngOrdIdl ], Integer

Factored

FactoredCarmichaelLambda(n) : RngIntElt -> RngIntEltFact
FactoredCharacteristicPolynomial(A: parameters) : Mtrx -> [ <RngUPolElt, RngIntElt>]
FactoredDefiningPolynomials(f) : MapSch -> SeqEnum
FactoredEulerPhi(n) : RngIntElt -> RngIntEltFact
FactoredEulerPhiInverse(n) : RngIntElt -> RngIntEltFact
FactoredIndex(G, H) : GrpAb, GrpAb -> [<RngIntElt, RngIntElt>]
FactoredIndex(G, H) : GrpFin, GrpFin -> [ <RngIntElt, RngIntElt> ]
FactoredIndex(G, H) : GrpGPC, GrpGPC -> [<RngIntElt, RngIntElt>]
FactoredIndex(G, H) : GrpMat, GrpMat -> [ <RngIntElt, RngIntElt> ]
FactoredIndex(G, H) : GrpPC, GrpPC -> [<RngIntElt, RngIntElt>]
FactoredIndex(G, H) : GrpPerm, GrpPerm -> [ <RngIntElt, RngIntElt> ]
FactoredInverseDefiningPolynomials(f) : MapSch -> SeqEnum
FactoredMinimalAndCharacteristicPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]
FactoredMinimalPolynomial(A: parameter) : Mtrx -> [ <RngUPolElt, RngIntElt>]
FactoredModulus(R) : RngIntRes -> RngIntEltFact
FactoredOrder(A) : AlgMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(a) : AlgMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(a) : FldFinElt -> RngIntElt
FactoredOrder(G) : GrpAb -> [<RngIntElt, RngIntElt>]
FactoredOrder(A) : GrpAuto -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(G) : GrpFin -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(G) : GrpGPC -> [<RngIntElt, RngIntElt>]
FactoredOrder(G) : GrpMat -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(g) : GrpMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(G) : GrpPC -> [<RngIntElt, RngIntElt>]
FactoredOrder(G) : GrpPerm -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(J) : JacHyp -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(P) : Process(pQuot) -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(P) : PtEll -> RngIntElt
FactoredOrder(G) : SchGrpEll -> RngIntElt
FactoredOrder(H) : SetPtEll -> RngIntElt
FactoredProjectiveOrder(a) : AlgMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredProjectiveOrder(A) : AlgMatElt -> [ <RngIntElt, RngIntElt> ], RngElt
Index(G, H: parameters) : GrpFP, GrpFP -> RngIntElt
IsogenyFromKernelFactored(E, psi) : CrvEllSubgroup -> CrvEll, Map
IsogenyFromKernelFactored(G) : CrvEllSubgroup -> CrvEll, Map
Order(G: parameters) : GrpFP -> RngIntElt

FactoredCarmichaelLambda

FactoredCarmichaelLambda(n) : RngIntElt -> RngIntEltFact

FactoredCharacteristicPolynomial

FactoredCharacteristicPolynomial(A: parameters) : Mtrx -> [ <RngUPolElt, RngIntElt>]

FactoredDefiningPolynomials

FactoredDefiningPolynomials(f) : MapSch -> SeqEnum

FactoredEulerPhi

FactoredEulerPhi(n) : RngIntElt -> RngIntEltFact

FactoredEulerPhiInverse

FactoredEulerPhiInverse(n) : RngIntElt -> RngIntEltFact

FactoredIndex

FactoredIndex(G, H) : GrpAb, GrpAb -> [<RngIntElt, RngIntElt>]
FactoredIndex(G, H) : GrpFin, GrpFin -> [ <RngIntElt, RngIntElt> ]
FactoredIndex(G, H) : GrpGPC, GrpGPC -> [<RngIntElt, RngIntElt>]
FactoredIndex(G, H) : GrpMat, GrpMat -> [ <RngIntElt, RngIntElt> ]
FactoredIndex(G, H) : GrpPC, GrpPC -> [<RngIntElt, RngIntElt>]
FactoredIndex(G, H) : GrpPerm, GrpPerm -> [ <RngIntElt, RngIntElt> ]
Index(G, H: parameters) : GrpFP, GrpFP -> RngIntElt

FactoredInverseDefiningPolynomials

FactoredInverseDefiningPolynomials(f) : MapSch -> SeqEnum

FactoredMCPolynomials

FactoredMCPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]
FactoredMinimalAndCharacteristicPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]

FactoredMinimalAndCharacteristicPolynomials

FactoredMCPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]
FactoredMinimalAndCharacteristicPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]

FactoredMinimalPolynomial

FactoredMinimalPolynomial(A: parameter) : Mtrx -> [ <RngUPolElt, RngIntElt>]

FactoredModulus

FactoredModulus(R) : RngIntRes -> RngIntEltFact

FactoredOrder

FactoredOrder(A) : AlgMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(a) : AlgMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(a) : FldFinElt -> RngIntElt
FactoredOrder(G) : GrpAb -> [<RngIntElt, RngIntElt>]
FactoredOrder(A) : GrpAuto -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(G) : GrpFin -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(G) : GrpGPC -> [<RngIntElt, RngIntElt>]
FactoredOrder(G) : GrpMat -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(g) : GrpMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(G) : GrpPC -> [<RngIntElt, RngIntElt>]
FactoredOrder(G) : GrpPerm -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(J) : JacHyp -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(P) : Process(pQuot) -> [ <RngIntElt, RngIntElt> ]
FactoredOrder(P) : PtEll -> RngIntElt
FactoredOrder(G) : SchGrpEll -> RngIntElt
FactoredOrder(H) : SetPtEll -> RngIntElt
Order(G: parameters) : GrpFP -> RngIntElt

FactoredProjectiveOrder

FactoredProjectiveOrder(a) : AlgMatElt -> [ <RngIntElt, RngIntElt> ]
FactoredProjectiveOrder(A) : AlgMatElt -> [ <RngIntElt, RngIntElt> ], RngElt

Factorial

Factorial(n) : RngIntElt -> RngIntElt
Factorial(n) : RngIntElt -> RngIntElt

Factorisation

Factorisation(I) : RngFunOrdIdl -> [<RngFunOrdIdl, RngIntElt>]
Factorization(I) : RngFunOrdIdl -> [ <RngFunOrdIdl, RngIntElt> ]
Factorization(n) : RngIntElt -> RngIntEltFact, RngIntElt, SeqEnum
Factorization(I) : RngOrdFracIdl -> [<RngOrdIdl, RngIntElt>]
Factorization(n) : RngQuadElt -> SeqEnum, Tup
FactorizationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin
FactorizationToInteger(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt

FactorisationOverSplittingField

FactorisationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin
FactorizationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin

FactorisationToInteger

FactorisationToInteger(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt
Facint(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt
FactorizationToInteger(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt

Factorization

DistinctDegreeFactorization(f) : RngUPolElt -> [ <RngIntElt, RngUPolElt> ]
EqualDegreeFactorization(f, d, g) : RngUPolElt, RngIntElt, RngUPolElt -> [ RngUPolElt ]
Facint(f) : RngIntEltFact -> RngIntElt
Factorization(I) : RngFunOrdIdl -> [ <RngFunOrdIdl, RngIntElt> ]
Factorization(n) : RngIntElt -> RngIntEltFact, RngIntElt, SeqEnum
Factorization(f) : RngMPolElt -> [ < RngMPolElt, RngIntElt >], RngElt
Factorization(I) : RngOrdFracIdl -> [<RngOrdIdl, RngIntElt>]
Factorization(n) : RngQuadElt -> SeqEnum, Tup
Factorization(g) : RngUPolElt -> [ < RngUPolElt, RngIntElt > ]
Factorization(g) : RngUPolElt -> [ < RngUPolElt, RngIntElt > ]
Factorization(f) : RngUPolElt -> [ < RngUPolElt, RngIntElt >], RngElt
FactorizationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin
FactorizationToInteger(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt
HasPolynomialFactorization(R) : Rng -> BoolElt
IsUFD(R) : Rng -> BoolElt
PartialFactorization(S) : [ RngIntElt ] -> [ RngIntEltFact ]
SeqFact(s) : SeqEnum -> RngIntEltFact
SquareFreeFactorization(g) : RngUPolElt -> [ < RngUPolElt, RngIntElt > ]
SquareFreeFactorization(g) : RngUPolElt -> [ < RngUPolElt, RngIntElt > ]
SquarefreeFactorization(n) : RngIntElt -> RngIntElt, RngIntElt
SquarefreeFactorization(f) : RngMPolElt -> [ <RngMPolElt, RngIntElt> ]
SquarefreeFactorization(f) : RngUPolElt -> [ <RngUPolElt, RngIntElt> ]
AlgAff_Factorization (Example H67E4)

factorization

Factorization (QUADRATIC FIELDS)
Factorization (UNIVARIATE POLYNOMIAL RINGS)
Factorization and Irreducibility (MULTIVARIATE POLYNOMIAL RINGS)
Factorization and Irreducibility (UNIVARIATE POLYNOMIAL RINGS)
Factorization and Primes (ORDERS AND ALGEBRAIC FIELDS)
Factorization Related Functions (RING OF INTEGERS)
Factorization Sequences (RING OF INTEGERS)
General Factorization (RING OF INTEGERS)
Specific Factorization Algorithms (RING OF INTEGERS)

factorization-general

Factorisation(n) : RngIntElt -> RngIntEltFact, RngIntElt, SeqEnum
General Factorization (RING OF INTEGERS)

factorization-irreducibility

Factorization and Irreducibility (MULTIVARIATE POLYNOMIAL RINGS)
Factorization and Irreducibility (UNIVARIATE POLYNOMIAL RINGS)

factorization-related

Factorization Related Functions (RING OF INTEGERS)

factorization-sequence

Factorization Sequences (RING OF INTEGERS)

factorization-specific

Specific Factorization Algorithms (RING OF INTEGERS)

FactorizationOverSplittingField

FactorisationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin
FactorizationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin

FactorizationToInteger

FactorizationToInteger(f) : RngIntEltFact -> RngIntElt
Facint(f) : RngIntEltFact -> RngIntElt
FactorizationToInteger(s) : [ <RngIntElt, RngIntElt> ] -> RngIntElt

Factors

ChiefFactors(G) : GrpMat -> [ <RngIntElt, RngIntElt, RngIntElt, RngIntElt> ]
ChiefFactors(G) : GrpPerm -> [ <RngIntElt, RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(G) : : GrpFin -> [ <RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(G) : : GrpMat -> [ <RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(G) : GrpPC -> SeqEnum
CompositionFactors(G) : GrpPerm -> [ <RngIntElt, RngIntElt, RngIntElt> ]
CompositionFactors(M) : ModRng -> [ ModRng ]
InvariantFactors(a) : AlgMatElt -> [ AlgPolElt ]
InvariantFactors(A) : Mtrx -> [ RngUPolElt ]
PrimaryInvariantFactors(a) : AlgMatElt -> [ <RngUPolElt, RngIntElt ]
PrimaryInvariantFactors(A) : Mtrx -> [ <RngUPolElt, RngIntElt> ]
SocleFactors(G) : GrpPerm -> [ GrpPerm ]
SocleFactors(M) : ModRng -> [ ModRng ]
TensorFactors(G) : GrpMat -> GrpMat, GrpMat
Z4CyclotomicFactors(n) : RngIntElt -> [RngUPolElt]
RngLoc_Factors (Example H55E20)
RngPad_Factors (Example H40E18)

factors

Composition and Chief Factors (MATRIX GROUPS)

factors-infinite

RngLoc_factors-infinite (Example H55E18)
RngPad_factors-infinite (Example H40E16)

factors-precision

RngLoc_factors-precision (Example H55E19)
RngPad_factors-precision (Example H40E17)

Faithful

IsFaithful(G, Y) : : GrpPerm, GSet -> BoolElt
IsFaithful(x) : AlgChtrElt -> BoolElt

false

Booleans (OVERVIEW)
true

families

Families of Linear Codes (LINEAR CODES OVER FINITE FIELDS)
Families of Linear Codes (LINEAR CODES OVER FINITE RINGS)
Special Families of Polynomials (UNIVARIATE POLYNOMIAL RINGS)

families-polynomials

Special Families of Polynomials (UNIVARIATE POLYNOMIAL RINGS)

Family

GrpFP_1_Family (Example H19E33)

Farey

Farey Symbols and Fundamental domains (SUBGROUPS OF PSL_2(R))
DisplayFareySymbolDomain(FS,file) : SymFry, MonStgElt -> SeqEnum
FareySymbol(G) : GrpPSL2 -> SymFry
Seq_Farey (Example H8E3)

Farey-Symbols

Farey Symbols and Fundamental domains (SUBGROUPS OF PSL_2(R))

FareySymbol

FareySymbol(G) : GrpPSL2 -> SymFry

feature

Magma Updates (OVERVIEW)

Feet

UnitalFeet(P, U, p) : Plane, { PlanePt }, PlanePt -> { PlanePt }

ff

Differential Space (PLANE ALGEBRAIC CURVES)
Differentials (PLANE ALGEBRAIC CURVES)
Function Fields (PLANE ALGEBRAIC CURVES)
Operations on Differentials (PLANE ALGEBRAIC CURVES)
Places (PLANE ALGEBRAIC CURVES)
Places (PLANE ALGEBRAIC CURVES)
Sets of Places (PLANE ALGEBRAIC CURVES)

ff-creation-example

Crv_ff-creation-example (Example H84E10)

ff-diff

Differentials (PLANE ALGEBRAIC CURVES)

ff-diff-element-operations

Operations on Differentials (PLANE ALGEBRAIC CURVES)

ff-diff-space

Differential Space (PLANE ALGEBRAIC CURVES)

ff-elements-example

Crv_ff-elements-example (Example H84E11)

ff-ff

Function Fields (PLANE ALGEBRAIC CURVES)

ff-places

Places (PLANE ALGEBRAIC CURVES)

ff-places-sets

Places (PLANE ALGEBRAIC CURVES)
Sets of Places (PLANE ALGEBRAIC CURVES)

ff_curves

Curves over Finite Fields (ELLIPTIC CURVES)
Enumeration of Points (ELLIPTIC CURVES)
Point Counting (ELLIPTIC CURVES)
Predicates for Supersingularity (ELLIPTIC CURVES)

ff_curves-point_counting

Point Counting (ELLIPTIC CURVES)

ff_curves-points

Enumeration of Points (ELLIPTIC CURVES)

ff_curves-supersingular_predicates

Predicates for Supersingularity (ELLIPTIC CURVES)

Fibonacci

Fibonacci(n) : RngIntElt -> RngIntElt
Fibonacci(n) : RngIntElt -> RngIntElt
GeneralizedFibonacciNumber(g0, g1, n) : RngIntElt, RngIntElt, RngIntElt -> RngIntElt
GeneralizedFibonacciNumber(g0, g1, n) : RngIntElt, RngIntElt, RngIntElt -> RngIntElt

Fibres

HasIrregularFibres(s) : GrphSpl -> BoolElt

Field

AbsoluteField(F) : FldAlg -> FldAlg
AbsoluteModuleOverMinimalField(M, F) : ModGrp, FldFin -> ModGrp
AbsoluteModulesOverMinimalField(Q, K) : [ ModGrp ], FldFin -> [ ModGrp ]
Alphabet(C) : Code -> Rng
BaseField(A) : AlgQuat -> Fld
BaseField(Q) : FldRat -> FldRat
BaseField(J) : JacHyp -> Fld
BaseField(C) : Sch -> Fld
BaseField(K) : SrfKum -> Fld
BaseRing(F) : Fld -> Rng
CoefficientRing(F) : FldFun -> Rng
BaseRing(C) : Sch -> Rng
CoefficientField(x) : AlgChtrElt -> Rng
CoefficientField(V) : ModTupFld -> Fld
CoefficientRing(R) : RngInvar -> Grp
CoefficientRing(X) : Sch -> Fld
CoefficientField(X) : Sch -> Fld
CoeffientField(A) : FldAb -> Field
ComplexField() : Null -> FldPr
ComplexField(p) : RngIntElt -> FldCom
ConstantField(F) : FldFun -> Rng
CyclotomicField(m) : RngIntElt -> FldCyc
DecompositionField(p, A) : PlcNumElt, FldAb -> FldAb
DecompositionField(p) : RngOrdIdl -> FldNum, Map
DecompositionField(p, A) : RngOrdIdl, FldAb -> FldAb
DegreeOfFieldExtension(G) : GrpMat -> RngIntElt
DimensionOfExactConstantField(F) : FldFun -> RngIntElt
ExactConstantField(F) : FldFunG -> Rng, Map
ExtendField(C, L) : Code, FldFin -> Code, Map
ExtendField(G, L) : GrpMat, FldFin -> GrpMat, Map
ExtendField(V, L) : ModTupFld, Fld -> ModTupFld, MapHom
ExtensionField<F, x | P> : FldFin, RngIntElt -> FldFin, Map
FactorizationOverSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin
Field(P) : Plane -> FldFin
FieldOfFractions(Q) : FldRat -> FldRat
FieldOfFractions(O) : RngFunOrd -> FldFun
FieldOfFractions(Z) : RngInt -> FldRat
FieldOfFractions(L) : RngLoc -> FldLoc
FieldOfFractions(P) : RngLoc -> FldLoc
FieldOfFractions(O) : RngOrd -> FldOrd
FieldOfFractions(P) : RngPol -> FldFunRat
FieldOfFractions(V) : RngVal -> Rng
FiniteField(q) : RngIntElt -> FldFin
GF(q) : RngIntElt -> FldFin
FiniteField(p, n) : RngIntElt, RngIntElt -> FldFin
GF(p, n) : RngIntElt, RngIntElt -> FldFin
FixedField(K, U) : FldAlg, GrpPerm -> FldNum, Map
FunctionField(A) : Aff -> FldFunRat
FunctionField(C) : Crv -> FldFun
FunctionField(E) : CrvEll -> FldFun
FunctionField(X) : CrvMod -> FldFun
FunctionField(D) : DiffFun -> FldFun
FunctionField(S) : DiffFun -> FldFun
FunctionField(a) : DiffFunElt -> FldFun
FunctionField(d) : DiffFunElt -> FldFun
FunctionField(G) : DivFun -> FldFun
FunctionField(D) : DivFunElt -> FldFun
FunctionField(f : parameters) : RngMPolElt -> FldFun
FunctionField(S) : PlcFun -> FldFun
FunctionField(P) : PlcFunElt -> FldFun
FunctionField(R) : Rng -> FldFunRat
FunctionField(R, r) : Rng, RngIntElt -> FldFunRat
FunctionField(A) : Sch -> FldFunG
FunctionField(C) : Sch -> FldFunG
FunctionFieldDivisor(D) : DivCrvElt -> DivFunElt
FunctionFieldPlace(P) : PlcCrvElt -> PlcFunElt
GHomOverCentralizingField(M, N) : ModGrp, ModGrp -> ModMatGrp
GenusField(A): FldAb -> FldAb
GetDefaultRealField() : Null -> FldPr
GroundField(F) : FldAlg -> Fld
CoefficientField(F) : FldAlg -> Fld
GroundField(F) : FldFin -> FldFin
HeckeEigenvalueField(M) : ModSym -> Fld, Map
HermitianFunctionField(p, d) : RngIntElt, RngIntElt -> FldFun
HilberClassField(K) : FldAlg -> FldAb
InertiaField(L) : FldLoc -> FldLoc
InertiaField(p) : RngOrdIdl -> FldNum, Map
IsAbsoluteField(K) : FldAlg -> BoolElt
IsField(R) : Rng -> BoolElt
IsOverSmallerField(G) : GrpMat -> BoolElt, GrpMat
IsOverSmallerField(G, d) : GrpMat, RngIntElt -> BoolElt, GrpMat
IsRealisableOverSmallerField(M) : ModGrp -> BoolElt, ModGrp
IsolGroupOfDegreeFieldSatisfying(d,{p, f}) : RngIntElt, RngIntElt, Predicate -> GrpMat
IsolGroupsOfDegreeFieldSatisfying(d,{p, f}) : RngIntElt, RngIntElt, Predicate -> SeqEnum
IsolNumberOfDegreeField(n, p) : RngIntElt, RngIntElt -> RngIntElt
IsolProcessOfDegreeField(d, p) : ., . -> Process
IsolProcessOfField(p) : . -> Process
LocalRing(p, f, n) : RngIntElt, RngIntElt, RngIntElt -> RngLoc
LocalRing(p, f, g, n) : RngIntElt, RngIntElt, RngUPolElt, RngIntElt -> RngLoc
LocalRing(p, g, n) : RngIntElt, RngUPolElt, RngIntElt -> RngLoc
LocalRing(L, f, n) : RngLoc, RngIntElt -> RngLoc
LocalRing(L, g, n) : RngLoc, RngUPolElt, RngIntElt -> RngLoc
MinimalField(a) : FldCycElt -> FldCyc
MinimalField(q) : FldRatElt -> FldRat
MinimalField(G) : GrpMat -> FldFin
MinimalField(M) : ModRng -> FldFin
MinimalField(S) : SetEnum -> FldRat
MinimalField(S) : [ FldCycElt ] -> FldCyc
ModuleOverSmallerField(M, F) : ModGrp, FldFin -> ModGrp
ModulesOverCommonField(M, N) : ModGrp, ModGrp -> ModGrp, ModGrp
ModulesOverSmallerField(Q, F) : SeqEnum, FldFin -> ModGrp
NumberField(A) : FldAb -> FldNum
NumberField(F) : FldOrd -> FldNum
NumberField(O) : RngOrd -> FldNum
NumberField(O) : RngQuad -> FldQuad
NumberField(f) : RngUPolElt -> FldNum
NumberField(e) : SubFldLatElt -> FldNum
NumberField(s) : [ RngUPolElt ] -> FldNum
PointsOverSplittingField(Z) : Clstr -> SetEnum
PrimeField(F) : Fld -> Fld
PrimeField(F) : FldFin -> FldFin
PrimeRing(F) : FldFun -> Rng
PrimeRing(L) : RngLoc -> RngLoc
pAdicRing(L) : RngLoc -> RngLoc
QuadraticField(m) : RngIntElt -> FldQuad
RamificationField(p) : RngOrdIdl -> FldNum, Map
RamificationField(p, i) : RngOrdIdl -> FldNum, Map
Rationals() : Null -> FldRat
RayClassField(m) : Map -> FldAb
RealField() : Null -> FldPr
RealField(p) : RngIntElt -> FldRe
RelativeField(F, L) : FldAlg, FldAlg -> FldAlg
ResidueClassField(P) : PlcFunElt -> Rng
ResidueClassField(R, I) : Rng, Rng -> Fld, Map
ResidueClassField(I) : RngFunOrdIdl -> Rng, Map
ResidueClassField(L) : RngLoc -> FldFin, Map
ResidueClassField(P) : RngLoc -> FldFin, Map
ResidueClassField(O, I) : RngOrd, RngOrdIdl -> FldFin, Map
ResidueField(R) : RngGal -> RngIntElt
RestrictField(G, S) : GrpMat, FldFin -> GrpMat, Map
RestrictField(V, L) : ModTupFld, Fld -> ModTupFld, MapHom
RootsInSplittingField(f) : RngPolElt(FldFin) -> [<RngPolElt, RngIntElt>], FldFin
SetDefaultRealField(R) : FldRe ->
SplittingField(F) : FldAlg -> FldAlg, SeqEnum
SplittingField(S) : RngPolElt(FldFin) -> FldFin
SplittingField(P) : RngPolElt(FldFin) -> FldFin
SplittingField(f) : RngUPolElt -> FldAlg
SubfieldSubcode(C, S) : Code, FldFin -> Code, Map
WriteOverLargerField(G) : GrpMat -> GrpMat, GrpMat, GrpAb, SeqEnum
WriteOverSmallerField(G, F) : GrpMat, FldFin -> GrpMat, Map
WriteOverSmallerField(M, F) : ModGrp, FldFin -> ModGrp, Map
ext< K | f > : FldFunRat, RngUPolElt -> FldFun
pAdicRing(p, n) : RngIntElt, RngIntElt -> RngLoc
pAdicRing(p, n) : RngIntElt, RngIntElt -> RngLoc
pAdicRing(p, n) : RngIntElt, RngIntElt -> RngLoc

field

Affine Algebras which are Fields (AFFINE ALGEBRAS)
ALGEBRAIC FUNCTION FIELDS
ALGEBRAICALLY CLOSED FIELDS
Arithmetic (ORDERS AND ALGEBRAIC FIELDS)
Between Ring and Field (LOCAL RINGS AND FIELDS)
Between Ring and Field (p-ADIC RINGS AND FIELDS)
Canonical Forms for Matrices over a Field (MATRIX ALGEBRAS)
Canonical Forms over Fields (MATRICES)
Changing the Coefficient Field (VECTOR SPACES)
FINITE FIELDS
ORDERS AND ALGEBRAIC FIELDS
p-adic Fields (p-ADIC RINGS AND FIELDS)
Q as a Number Field (RING OF INTEGERS)
RATIONAL FUNCTION FIELDS
Residue Class Fields (INTRODUCTION [BASIC RINGS])
Rings, Fields, and Algebras (OVERVIEW)

field-element

Arithmetic (ORDERS AND ALGEBRAIC FIELDS)

FieldOfFractions

FieldOfFractions(Q) : FldRat -> FldRat
FieldOfFractions(O) : RngFunOrd -> FldFun
FieldOfFractions(Z) : RngInt -> FldRat
FieldOfFractions(L) : RngLoc -> FldLoc
FieldOfFractions(P) : RngLoc -> FldLoc
FieldOfFractions(O) : RngOrd -> FldOrd
FieldOfFractions(P) : RngPol -> FldFunRat
FieldOfFractions(V) : RngVal -> Rng

Fields

CompositeFields(F, L) : FldAlg, FldAlg -> SeqEnum
MergeFields(F, L) : FldAlg, FldAlg -> SeqEnum

fields

Creation of Algebraic Function Fields (ALGEBRAIC FUNCTION FIELDS)
Gröbner Bases over Fields (IDEAL THEORY AND GRÖBNER BASES)
Local Fields (LOCAL RINGS AND FIELDS)
Rings, Fields, and Algebras (OVERVIEW)
The Fields of the Record (DATABASES OF GROUPS)

FILE

MAGMA_STARTUP_FILE

File

HasOutputFile() : -> BoolElt
NFSCycleFile(n, F, tuple) : RngIntElt, RngMPolElt, Tup -> .
OpenGraphFile(s, f, p): MonStgElt, RngIntElt, RngIntElt -> File
PrintFile(F, x) : MonStgElt, Var ->
PrintFile(F, x, L) : MonStgElt, Var, MonStgElt ->
PrintFileMagma(F, x) : MonStgElt, Var ->
SetLogFile(F) : MonStgElt ->
SetLogFile(F) : MonStgElt ->
SetOutputFile(F) : MonStgElt ->
SetOutputFile(F) : MonStgElt ->
SetOutputFile(F) : MonStgElt ->
UnsetLogFile() : ->
UnsetOutputFile() : ->

file

External Files (INPUT AND OUTPUT)
Opening Files (INPUT AND OUTPUT)
Printing to a File (INPUT AND OUTPUT)
Reading a Complete File (INPUT AND OUTPUT)

FillingLPObject

LP_FillingLPObject (Example H104E4)

Find

FindGenerators(G) : GrpFP -> []

find_keys

Finding Legal Keys (DATABASES OF GROUPS)

FindGenerators

FindGenerators(G) : GrpFP -> []

finding

Finding Irreducibles (CHARACTERS OF FINITE GROUPS)
Finding Points (RATIONAL CURVES AND CONICS)

finding-irreducibles

Finding Irreducibles (CHARACTERS OF FINITE GROUPS)

FindingPrimes

GB_FindingPrimes (Example H66E5)

finish

Control-C key (OVERVIEW)
Quitting (OVERVIEW)

Finite

EquationOrderFinite(F) : FldFun -> RngFunOrd
FiniteAffinePlane(D) : Inc -> Plane, PlanePtSet, PlaneLnSet
FiniteAffinePlane(W) : ModFld -> PlaneAff
FiniteAffinePlane< v | X : parameters > : RngIntElt, List -> PlaneAff
FiniteAffinePlane(P, l) : PlaneProj, PlaneLn -> PlaneAff, PlanePtSet, PlaneLnSet, Map
FiniteField(q) : RngIntElt -> FldFin
FiniteField(p, n) : RngIntElt, RngIntElt -> FldFin
FiniteProjectivePlane(D) : Inc -> Plane, PlanePtSet, PlaneLnSet
FiniteProjectivePlane(W) : ModTupFld -> PlaneProj
FiniteProjectivePlane< v | X : parameters > : RngIntElt, List -> PlaneProj
HasFiniteOrder(g) : GrpMatElt -> BoolElt, RngIntElt
HasFiniteOrder(A) : Mtrx -> BoolElt
IsFinite(G) : GrpAb -> BoolElt
IsFinite(G) : GrpAtc -> BoolElt, RngIntElt
IsFinite(G) : GrpGPC -> BoolElt
IsFinite(G) : GrpMat -> Bool, RngIntElt
IsFinite(G) : GrpRWS -> BoolElt, RngIntElt
IsFinite(x) : Infty -> BoolElt
IsFinite(M) : MonRWS -> BoolElt, RngIntElt
IsFinite(P) : PlcFunElt -> BoolElt
IsFinite(R) : Rng -> BoolElt
IsFiniteOrder(O) : RngFunOrd -> BoolElt
MaximalOrderFinite(F) : FldFun -> RngFunOrd

finite

Finite Dimensional Affine Algebras (AFFINE ALGEBRAS)
FINITE FIELDS
Rings, Fields, and Algebras (OVERVIEW)

finite-dimension-quotient

Finite Dimensional Affine Algebras (AFFINE ALGEBRAS)

finite-Galois-field

FINITE FIELDS

FiniteAffinePlane

FiniteAffinePlane(D) : Inc -> Plane, PlanePtSet, PlaneLnSet
FiniteAffinePlane(W) : ModFld -> PlaneAff
FiniteAffinePlane< v | X : parameters > : RngIntElt, List -> PlaneAff
FiniteAffinePlane(P, l) : PlaneProj, PlaneLn -> PlaneAff, PlanePtSet, PlaneLnSet, Map

FiniteField

GaloisField(q) : RngIntElt -> FldFin
GF(q) : RngIntElt -> FldFin
FiniteField(q) : RngIntElt -> FldFin
FiniteField(p, n) : RngIntElt, RngIntElt -> FldFin

FiniteFieldFactorization

RngMPol_FiniteFieldFactorization (Example H43E10)

finitefields

Polynomials over finite fields (UNIVARIATE POLYNOMIAL RINGS)

finitely

FINITELY PRESENTED ALGEBRAS
Finitely Presented Algebras (FINITELY PRESENTED ALGEBRAS)
FINITELY PRESENTED GROUPS
Finitely Presented Modules (FINITELY PRESENTED ALGEBRAS)
FINITELY PRESENTED SEMIGROUPS
FP GROUPS - ADVANCED FEATURES
Rings, Fields, and Algebras (OVERVIEW)

finitely-presented

FINITELY PRESENTED ALGEBRAS
FINITELY PRESENTED GROUPS
FINITELY PRESENTED SEMIGROUPS

finitely-presented-advanced

FP GROUPS - ADVANCED FEATURES

finitely-presented-algebra

Finitely Presented Algebras (FINITELY PRESENTED ALGEBRAS)

finitely-presented-module

Finitely Presented Modules (FINITELY PRESENTED ALGEBRAS)

finitely_presented_group

Presentations (MATRIX GROUPS)

FiniteProjectivePlane

FiniteProjectivePlane(D) : Inc -> Plane, PlanePtSet, PlaneLnSet
FiniteProjectivePlane(W) : ModTupFld -> PlaneProj
FiniteProjectivePlane< v | X : parameters > : RngIntElt, List -> PlaneProj

Fire

FireCode(h, s, n) : RngUPolElt, RngIntElt, RngIntElt -> Code

FireCode

FireCode(h, s, n) : RngUPolElt, RngIntElt, RngIntElt -> Code

Firm

IsFirm(C) : CosetGeom -> BoolElt
IsFirm(D) : IncGeom -> BoolElt

First

BasisOfHolomorphicDifferentials(F) : FldFunG -> SeqEnum[DiffFunElt]
BasisOfDifferentialsFirstKind(F) : FldFunG -> SeqEnum[DiffFunElt]
BreadthFirstSearchTree(u) : GrphVert -> Grph
ChebyshevFirst(n) : RngIntElt -> RngUPolElt
DepthFirstSearchTree(u) : GrphVert -> Grph
DicksonFirst(n, a) : RngIntElt, RngElt -> RngUPolElt
DicksonFirst(n, a) : RngIntElt, RngElt -> RngUPolElt
FirstIndexOfColumn(t, j) : Tbl,RngIntElt -> RngIntElt
FirstIndexOfRow(t, i) : Tbl,RngIntElt -> RngIntElt
SpaceOfDifferentialsFirstKind(C) : Crv -> ModFld, Map
SpaceOfDifferentialsFirstKind(F) : FldFunG -> ModFld, Map
StirlingFirst(m, n) : RngIntElt, RngIntElt -> RngIntElt
StirlingFirst(m, n) : RngIntElt, RngIntElt -> RngIntElt

first

The `first use' Rule (MAGMA SEMANTICS)

first-use

The `first use' Rule (MAGMA SEMANTICS)

FirstIndexOfColumn

FirstIndexOfColumn(t, j) : Tbl,RngIntElt -> RngIntElt

FirstIndexOfRow

FirstIndexOfRow(t, i) : Tbl,RngIntElt -> RngIntElt

Fitting

FittingLength(G) : GrpGPC -> RngIntElt
FittingSeries(G) : GrpGPC -> [GrpGPC]
FittingSubgroup(G) : GrpAb -> GrpAb
FittingSubgroup(G) : GrpFin -> GrpFin
FittingSubgroup(G) : GrpGPC -> GrpGPC
[Future release] FittingSubgroup(G) : GrpMat -> GrpMat
FittingSubgroup(G) : GrpPC -> GrpPC
FittingSubgroup(G) : GrpPerm -> GrpPerm

FittingGroup

FittingGroup(G) : GrpGPC -> GrpGPC
FittingSubgroup(G) : GrpGPC -> GrpGPC
FittingSubgroup(G) : GrpPC -> GrpPC

FittingLength

FittingLength(G) : GrpGPC -> RngIntElt

FittingSeries

FittingSeries(G) : GrpGPC -> [GrpGPC]

FittingSubgroup

FittingSubgroup(G) : GrpAb -> GrpAb
FittingSubgroup(G) : GrpFin -> GrpFin
FittingSubgroup(G) : GrpGPC -> GrpGPC
[Future release] FittingSubgroup(G) : GrpMat -> GrpMat
FittingSubgroup(G) : GrpPC -> GrpPC
FittingSubgroup(G) : GrpPerm -> GrpPerm
GrpGPC_FittingSubgroup (Example H23E15)

fiurg

REFLECTION GROUPS

Fix

Fix(C, G) : Code, GrpPerm -> Code
Fix(G, Y) : GrpPerm, GSet -> { Elt }
Fix(g, Y): GrpPermElt, GSet -> { Elt }
Fix(M): Mod -> Mod

Fixed

FixedArc(g,H) : GrpPSL2Elt, SpcHyp -> SeqEnum
FixedField(K, U) : FldAlg, GrpPerm -> FldNum, Map
FixedGroup(K, L) : FldAlg, FldAlg -> GrpPerm
FixedPoints(g,H) : GrpPSL2Elt, SpcHyp -> SeqEnum
NumberOfFixedSpaces(x, s) : GrpMatElt, RngIntElt -> RngIntElt

fixed

Fixed Precision Real Numbers (REAL AND COMPLEX FIELDS)
Free and Fixed Precision (POWER, LAURENT AND PUISEUX SERIES)
The Fixed-point Space of a Module (K[G]-MODULES AND GROUP REPRESENTATIONS)

fixed-points

The Fixed-point Space of a Module (K[G]-MODULES AND GROUP REPRESENTATIONS)

fixed-precision

Fixed Precision Real Numbers (REAL AND COMPLEX FIELDS)
Free and Fixed Precision (POWER, LAURENT AND PUISEUX SERIES)

FixedArc

FixedArc(g,H) : GrpPSL2Elt, SpcHyp -> SeqEnum

FixedField

FixedField(K, U) : FldAlg, GrpPerm -> FldNum, Map

FixedGroup

FixedGroup(K, L) : FldAlg, FldAlg -> GrpPerm

FixedPoints

FixedPoints(g,H) : GrpPSL2Elt, SpcHyp -> SeqEnum

FixedPrecision

FldRe_FixedPrecision (Example H41E1)

Flat

Flat(C) : Cop -> Cop
Flat(e) : FldAlgElt -> [ FldRatElt]
Flat(C) : SetCart -> SetCart
Flat(T) : Tup -> Tup

flat

Flattening (COPRODUCTS)

FldAb

Rings, Fields, and Algebras (OVERVIEW)

FldCom

Rings, Fields, and Algebras (OVERVIEW)

FldCyc

Rings, Fields, and Algebras (OVERVIEW)

FldFin

Rings, Fields, and Algebras (OVERVIEW)

FldFunG

Rings, Fields, and Algebras (OVERVIEW)

FldFunRat

Rings, Fields, and Algebras (OVERVIEW)

FldPad

Rings, Fields, and Algebras (OVERVIEW)

FldPr

Rings, Fields, and Algebras (OVERVIEW)

FldQuad

Rings, Fields, and Algebras (OVERVIEW)

FldRat

Rings, Fields, and Algebras (OVERVIEW)

FldRe

Rings, Fields, and Algebras (OVERVIEW)

Fletcher

ReidNumber(X) : VSrfK3 -> RngIntElt
FletcherNumber(X) : VSrfK3 -> RngIntElt
AltinokNumber(X) : VSrfK3 -> RngIntElt
AFRNumber(X) : VSrfK3 -> RngIntElt

FletcherNumber

ReidNumber(X) : VSrfK3 -> RngIntElt
FletcherNumber(X) : VSrfK3 -> RngIntElt
AltinokNumber(X) : VSrfK3 -> RngIntElt
AFRNumber(X) : VSrfK3 -> RngIntElt

Flex

IsFlex(C,p) : Sch,Pt -> BoolElt,RngIntElt
IsInflectionPoint(p) : Sch,Pt -> BoolElt,RngIntElt

Flexes

InflectionPoints(C) : Sch -> SeqEnum
Flexes(C) : Sch -> SeqEnum

Flip

Translation(A,p) : Sch,Pt -> AutSch
FlipCoordinates(A) : Sch -> AutSch
Automorphism(A,q) : Sch,RngMPolElt -> AutSch
IdentityAutomorphism(A) : Sch -> AutSch

FlipCoordinates

Translation(A,p) : Sch,Pt -> AutSch
FlipCoordinates(A) : Sch -> AutSch
Automorphism(A,q) : Sch,RngMPolElt -> AutSch
IdentityAutomorphism(A) : Sch -> AutSch

Floor

Floor(q) : FldRatElt -> RngIntElt
Floor(r) : FldReElt -> RngIntElt
Floor(n) : RngIntElt -> RngIntElt

Flush

Flush(F) : File ->

fns

Associated Functions (DATABASES OF GROUPS)

For

SearchForDecomposition(G, S) : GrpMat, [GrpMatElt] -> BoolElt

for

Definite Iteration (STATEMENTS AND EXPRESSIONS)
The for statement (OVERVIEW)
for x in S do statements; end for;
for i := expr_1 to expr_2 by expr_3 do : ->
for i := expr_1 to expr_2 do : ->

for-statement

Definite Iteration (STATEMENTS AND EXPRESSIONS)

forall

forall(t){ e(x) : x in E | P(x) }
forall(t){ e(x_1, ..., x_k): x_1 in E_1,..., x_k in E_k | P(x_1, ..., x_k) }

forced

Forced Coercion (INTRODUCTION [BASIC RINGS])
Magmas (or Structures) (OVERVIEW)

Forest

IsForest(G) : GrphUnd -> BoolElt
SpanningForest(G) : Grph -> Grph

Form

DualCoxeterForm( RD ) : RootDtm -> AlgMatElt
CoxeterForm( RD ) : RootDtm -> AlgMatElt
DiagonalForm(f) : RngMPolElt -> RngMPolElt, ModMatRngElt
EchelonForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt
EchelonForm(A) : Mtrx -> Mtrx, AlgMatElt
FormType(G) : GrpMat -> MonStgElt
HermiteForm(X) : AlgMatElt -> AlgMatElt, AlgMatElt
HermiteForm(A) : Mtrx -> Mtrx, ModMatRngElt
HessenbergForm(a) : AlgMatElt -> AlgMatElt
HessenbergForm(A) : Mtrx -> AlgMatElt
HilbertForm(X) : VSrfK3 -> SeqEnum
NoetherForm(X) : VSrfK3 -> SeqEnum
IndexFormEquation(O, k) : RngOrd, RngIntElt -> [ RngOrdElt ]
JordanForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
JordanForm(A) : Mtrx -> Mtrx, AlgMatElt, [ <RngUPolElt, RngIntElt> ]
ManhattanForm(M) : Mtrx -> Mtrx, AlgMatElt
ManhattanForm(M) : Mtrx -> Mtrx, AlgMatElt
ModularForm(E) : CrvEll -> ModFrm
ModularForm(E) : CrvEll -> ModFrm
NormalForm(u) : GrpBrdElt -> Tup
NormalForm(f, M) : ModMPolElt, ModMPol -> ModMPolElt
NormalForm(f, I) : RngMPolElt, RngMPol -> RngMPolElt
NormalForm(f, S) : RngMPolElt, [ RngMPolElt ] -> RngMPolElt
NormalFormWord(u) : GrpBrdElt -> GrpBrdElt
PositiveDefiniteForm(G) : GrpMat -> AlgMatElt
PrimaryRationalForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
PrimaryRationalForm(A) : Mtrx -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
PrimeForm(Q, p) : QuadBin, RngIntElt -> QuadBinElt
QuadraticForm(G): GrpMat -> AlgMatElt
QuadraticForm(L) : Lat -> RngMPolElt
QuadraticForm(I) : RngQuadFracIdl -> QuadBinElt
QuadraticForm(S) : { PlanePt } -> RngMPolElt
RationalForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, [ RngUPolElt ]
RationalForm(A) : Mtrx -> Mtrx, AlgMatElt, [ RngUPolElt ]
Reduction(f) : QuadBinElt -> QuadBinElt
ScalarsQuadraticForm(G) : GrpMat -> SeqEnum
ScalarsSymmetricBilinearForm(G) : GrpMat -> SeqEnum
ScalarsSymplecticForm(G) : GrpMat -> SeqEnum
ScalarsUnitaryForm(G) : GrpMat -> SeqEnum
SmithForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, AlgMatElt
SmithForm(A) : ModMatRngElt -> ModMatRngElt, ModMatRngElt, ModMatRngElt
StandardForm(C) : Code -> Code, Map
StandardForm(C) : Code -> Code, Map
SteinitzForm(M) : ModDed -> ModDed
SymmetricBilinearForm(G) : GrpMat -> AlgMatElt
SymmetricBilinearForm(f) : RngMPolElt -> ModMatRngElt
SymplecticForm(G) : GrpMat -> AlgMatElt
UnitaryForm(G) : GrpMat -> AlgMatElt
WeierstrassForm(C,p) : Crv, Pt -> CrvEll, MapSch

form

Canonical Forms (MATRIX ALGEBRAS)
Index Form Equations (ORDERS AND ALGEBRAIC FIELDS)
Matrix Action on Forms (BINARY QUADRATIC FORMS)
Normal Form for Elements of a Braid Group (BRAID GROUPS)
Operations on Forms (BINARY QUADRATIC FORMS)
The Standard Form (LINEAR CODES OVER FINITE RINGS)

form-action-matrix

Matrix Action on Forms (BINARY QUADRATIC FORMS)

form-operations

Operations on Forms (BINARY QUADRATIC FORMS)

Formal

FormalSet(M) : Struct -> SetForm
PowerFormalSet(R) : Struct -> PowSetIndx

formal

Formal Sequences (SEQUENCES)
Formal Sets (SETS)
Sets (OVERVIEW)
The Formal Sequence Constructor (SEQUENCES)
The Formal Set Constructor (SETS)

FormalSet

FormalSet(M) : Struct -> SetForm

Format

Format(r) : Rec -> RecFormat

format

RECORDS
The Record Format Constructor (RECORDS)

Forms

AmbiguousForms(Q) : QuadBin -> SeqEnum
AntisymmetricForms(G) : GrpMat -> [ AlgMatElt ]
AntisymmetricForms(G, n) : GrpMat, RngIntElt -> [ AlgMatElt ]
BinaryQuadraticForms(D) : RngIntElt -> QuadBin
ClassicalForms(G): GrpMat -> BoolElt
DimensionCuspForms(eps, k) : GrpDrchElt, RngIntElt -> RngIntElt
DimensionCuspFormsGamma0(N, k) : RngIntElt, RngIntElt -> RngIntElt
DimensionCuspFormsGamma1(N, k) : RngIntElt, RngIntElt -> RngIntElt
DimensionNewCuspFormsGamma0(N, k) : RngIntElt, RngIntElt -> RngIntElt
DimensionNewCuspFormsGamma1(N, k) : RngIntElt, RngIntElt -> RngIntElt
InvariantForms(G) : GrpMat -> [ AlgMatElt ]
InvariantForms(G, n) : GrpMat, RngIntElt -> [ AlgMatElt ]
IsRingOfAllModularForms(M) : ModFrm -> BoolElt
ModularForms(G) : -> ModFrm
ModularForms(G, k) : -> ModFrm
ModularForms(N) : RngIntElt -> ModFrm
ModularForms(N, k) : RngIntElt, RngIntElt -> ModFrm
ModularForms(chars, k) : [GrpDrchElt], RngIntElt -> ModFrm
NumberOfAntisymmetricForms(G) : GrpMat -> RngIntElt
NumberOfInvariantForms(G) : GrpMat -> RngIntElt, RngIntElt
NumberOfSymmetricForms(G) : GrpMat -> RngIntElt
ReducedForms(Q) : QuadBin -> [ QuadBinElt ]
SymmetricForms(G) : GrpMat -> [ AlgMatElt ]
SymmetricForms(G, n) : GrpMat, RngIntElt -> [ AlgMatElt ]
QuadBin_Forms (Example H65E1)

forms

An Illustrative Overview (MODULAR FORMS)
Invariant Forms (LATTICES)
MODULAR FORMS
Modular Forms (MODULAR FORMS)

Forms1

Mat_Forms1 (Example H59E10)

FormType

FormType(G) : GrpMat -> MonStgElt

formulas

Dimension Formulas (MODULAR SYMBOLS)
Dimensions of Spaces (BRANDT MODULES)

forward

Recursion and forward (OVERVIEW)
The forward Declaration (FUNCTIONS, PROCEDURES AND PACKAGES)
forward f; : identifier ->
Func_forward (Example H2E5)

fp

Construction from a Finite Permutation or Matrix Group (FINITELY PRESENTED GROUPS)
Construction of an FP-Group (FINITELY PRESENTED GROUPS)
Construction of the Standard Presentation for a Coxeter Group (FINITELY PRESENTED GROUPS)
Conversion from a Special Form of FP-Group (FINITELY PRESENTED GROUPS)
Generators and Relations (PERMUTATION GROUPS)
Groups (OVERVIEW)
Rings, Fields, and Algebras (OVERVIEW)
The FP-Group Constructor (FINITELY PRESENTED GROUPS)
The Quotient Group Constructor (FINITELY PRESENTED GROUPS)

fp-group

Generators and Relations (PERMUTATION GROUPS)

fp-group-construction

Construction of an FP-Group (FINITELY PRESENTED GROUPS)

fp-group-constructor

Construction from a Finite Permutation or Matrix Group (FINITELY PRESENTED GROUPS)
The FP-Group Constructor (FINITELY PRESENTED GROUPS)

fp-group-conversion

Conversion from a Special Form of FP-Group (FINITELY PRESENTED GROUPS)

fp-group-conversion-coxeter-group

Construction of the Standard Presentation for a Coxeter Group (FINITELY PRESENTED GROUPS)

fp-group-quotient

The Quotient Group Constructor (FINITELY PRESENTED GROUPS)

FPCoxeterGroups

GrpCox_FPCoxeterGroups (Example H34E13)
GrpFP_1_FPCoxeterGroups (Example H19E12)

FPGroup

FPGroup(A) : GrpAb -> GrpFP, Hom(Grp)
FPGroup(A) : GrpAuto -> GrpFP, Map
FPGroup(G) : GrpGPC -> GrpFP, Map
FPGroup(G) : GrpMat :-> GrpFP, Hom(Grp)
FPGroup(G) : GrpPC -> GrpFP, Hom(Grp)
FPGroup(G) : GrpPC -> GrpFP, Map
FPGroup(G) : GrpPerm -> GrpFP, Hom(Grp)
FPGroup(G) : GrpPerm :-> GrpFP, Hom(Grp)
FPGroup(G: parameters) : GrpPerm :-> GrpFP, Hom(Grp)
FPGroupStrong(G) : GrpMat :-> GrpFP, Hom(Grp)
FPGroupStrong(G) : GrpPerm -> GrpFP, Hom(Grp)
FPGroupStrong(G, N) : GrpPerm, GrpPerm -> GrpFP, Hom(Grp)
FPGroupStrong(G: parameters) : GrpPerm :-> GrpFP, Hom(Grp)
OuterFPGroup(A) : GrpAuto -> GrpFP, Map
Grp_FPGroup (Example H16E10)

FPGroup1

GrpFP_1_FPGroup1 (Example H19E11)

FPGroup2

GrpFP_1_FPGroup2 (Example H19E13)

FPGroupStrong

FPGroupStrong(G) : GrpMat :-> GrpFP, Hom(Grp)
FPGroupStrong(G) : GrpPerm -> GrpFP, Hom(Grp)
FPGroupStrong(G, N) : GrpPerm, GrpPerm -> GrpFP, Hom(Grp)
FPGroupStrong(G: parameters) : GrpPerm :-> GrpFP, Hom(Grp)

FPQuotient

FPQuotient(G, N) : GrpPerm, GrpPerm :-> GrpFP, Hom(Grp)

fprintf

fprintf file, format, expression, ..., expression;

frac

frac< R | a_1, ..., a_r > : Rng, RngElt, ..., RngElt -> Fld, Map

Fraction

ContinuedFraction(r) : FldPrElt -> [ RngIntElt ]
PartialFractionDecomposition(f) : FldFunRatUElt -> [ <RngUPolElt, RngIntElt, RngUPolElt> ]
SquarefreePartialFractionDecomposition(f) : FldFunRatUElt -> [ <RngUPolElt, RngIntElt, RngUPolElt> ]

fraction

Continued Fractions (REAL AND COMPLEX FIELDS)
Partial Fraction Decomposition (RATIONAL FUNCTION FIELDS)
Rings, Fields, and Algebras (OVERVIEW)

Fractions

FieldOfFractions(Q) : FldRat -> FldRat
FieldOfFractions(O) : RngFunOrd -> FldFun
FieldOfFractions(Z) : RngInt -> FldRat
FieldOfFractions(L) : RngLoc -> FldLoc
FieldOfFractions(P) : RngLoc -> FldLoc
FieldOfFractions(O) : RngOrd -> FldOrd
FieldOfFractions(P) : RngPol -> FldFunRat
FieldOfFractions(V) : RngVal -> Rng

fractions

RngOrd_fractions (Example H48E5)

Frattini

FrattiniSubgroup(G) : GrpAb -> GrpAb
FrattiniSubgroup(G) : GrpFin -> GrpFin
FrattiniSubgroup(G) : GrpMat -> GrpMat
FrattiniSubgroup(G) : GrpPC -> GrpPC
FrattiniSubgroup(G) : GrpPerm -> GrpPerm

FrattiniSubgroup

FrattiniSubgroup(G) : GrpAb -> GrpAb
FrattiniSubgroup(G) : GrpFin -> GrpFin
FrattiniSubgroup(G) : GrpMat -> GrpMat
FrattiniSubgroup(G) : GrpPC -> GrpPC
FrattiniSubgroup(G) : GrpPerm -> GrpPerm

Free

FreeAbelianGroup(GrpGPC, n) : Cat, RngIntElt -> GrpGPC
FreeAbelianGroup(n) : RngIntElt -> GrpAb
FreeAbelianQuotient(G) : GrpAb -> GrpAb, Map
FreeAbelianQuotient(G) : GrpGPC -> GrpAb, Map
FreeAlgebra(R, M) : Rng, MonFP -> AlgFP
FreeGroup(n) : RngIntElt -> GrpFP
FreeMonoid(n) : RngIntElt -> MonFP
FreeNilpotentGroup(r, e) : RngIntElt, RngIntElt -> GrpGPC
FreeProduct(G, H) : GrpFP, GrpFP -> GrpFP
FreeProduct(R, S) : SgpFP, SgpFP -> SgpFP
FreeProduct(Q) : [ GrpFP ] -> GrpFP
FreeResolution(M) : ModMPol -> [ ModMPol ]
FreeResolution(R) : RngInvar -> [ ModMPol ]
FreeSemigroup(n) : RngIntElt -> SgpFP
IsBasePointFree(L) : LinSys -> BoolElt
MinimalFreeResolution(M) : ModMPol -> [ ModMPol ]
MinimalFreeResolution(M) : ModMPol -> [ ModMPol ]
SquareFreeFactorization(g) : RngUPolElt -> [ < RngUPolElt, RngIntElt > ]
SquareFreeFactorization(g) : RngUPolElt -> [ < RngUPolElt, RngIntElt > ]
TorsionFreeRank(A) : GrpAb -> RngIntElt
TorsionFreeRank(G) : GrpFP -> RngIntElt
TorsionFreeSubgroup(A) : GrpAb -> GrpAb
GrpFP_1_Free (Example H19E1)

free

Construction of a Free Group (FINITELY PRESENTED GROUPS)
Free Modules (FREE MODULES)
Free Real Numbers (REAL AND COMPLEX FIELDS)
Free Resolutions (MODULES OVER AFFINE ALGEBRAS)
Structure Constructors (ABELIAN GROUPS)
Structure Constructors (FINITELY PRESENTED SEMIGROUPS)
Structure Constructors (GROUPS OF STRAIGHT-LINE PROGRAMS)

free-modules

Free Modules (FREE MODULES)

free-resolution

Free Resolutions (MODULES OVER AFFINE ALGEBRAS)

FreeAbelianGroup

FreeAbelianGroup(GrpGPC, n) : Cat, RngIntElt -> GrpGPC
FreeAbelianGroup(n) : RngIntElt -> GrpAb
GrpAb_FreeAbelianGroup (Example H18E1)

FreeAbelianQuotient

FreeAbelianQuotient(G) : GrpAb -> GrpAb, Map
FreeAbelianQuotient(G) : GrpGPC -> GrpAb, Map

FreeAlgebra

FreeAlgebra(R, M) : Rng, MonFP -> AlgFP
AlgFP_FreeAlgebra (Example H75E1)

FreeGroup

FreeGroup(n) : RngIntElt -> GrpFP

FreeMonoid

FreeMonoid(n) : RngIntElt -> MonFP

FreeNilpotentGroup

FreeNilpotentGroup(r, e) : RngIntElt, RngIntElt -> GrpGPC

FreeProduct

FreeProduct(G, H) : GrpFP, GrpFP -> GrpFP
FreeProduct(R, S) : SgpFP, SgpFP -> SgpFP
FreeProduct(Q) : [ GrpFP ] -> GrpFP

FreeResolution

FreeResolution(M) : ModMPol -> [ ModMPol ]
FreeResolution(R) : RngInvar -> [ ModMPol ]
PMod_FreeResolution (Example H68E6)

FreeSemigroup

FreeSemigroup(n) : RngIntElt -> SgpFP
SgpFP_FreeSemigroup (Example H14E1)

freeze

freeze;

Frequency

DecompositionTypeFrequency(A, a, b) : FldAb, RngIntElt, RngIntElt -> Mset
DecompositionTypeFrequency(A, l) : FldAb, [ ] -> Mset

Frobenius

Frobenius(P, k) : JacHypPt, FldFin -> JacHypPt
Frobenius(P, F) : PtHyp, FldFin -> PtHyp
FrobeniusAutomorphisms(G) : GrpMat -> SeqEnum
FrobeniusAutomosphism(A, p) : FldAb, RngOrdIdl -> Map
FrobeniusMap(E) : CrvEll -> Map
FrobeniusMap(E, i) : CrvEll, RngIntElt -> Map
IsFrobenius(G) : GrpPerm -> BoolElt
Trace(H): SetPtEll -> RngIntElt
Trace(H, r): SetPtEll, RngIntElt -> RngIntElt
CrvEll_Frobenius (Example H87E38)

frobenius

Frobenius (HYPERELLIPTIC CURVES)
Frobenius (HYPERELLIPTIC CURVES)

FrobeniusAutomorphisms

FrobeniusAutomorphisms(G) : GrpMat -> SeqEnum

FrobeniusAutomosphism

FrobeniusAutomosphism(A, p) : FldAb, RngOrdIdl -> Map

FrobeniusMap

FrobeniusMap(E) : CrvEll -> Map
FrobeniusMap(E, i) : CrvEll, RngIntElt -> Map

From

ConvertFromManinSymbol(M, x) : ModSym, Tup -> ModSymElt
GSetFromIndexed(G, Y) : GrpPerm, SetIndx -> GSet
HyperellipticCurveFromIgusaClebsch(S) : SeqEnum -> CrvHyp
IsogenyFromKernel(E, psi) : CrvEll, RngUPolElt -> CrvEll, Map
IsogenyFromKernel(G) : CrvEllSubgroup -> CrvEll, Map
IsogenyFromKernelFactored(E, psi) : CrvEllSubgroup -> CrvEll, Map
IsogenyFromKernelFactored(G) : CrvEllSubgroup -> CrvEll, Map
K3SurfaceFromAFR(DB,c,n) : SeqEnum,RngIntElt,RngIntElt -> VSrfK3
K3SurfacesFromBasket(DB,B) : SeqEnum,SeqEnum -> SeqEnum
K3SurfacesFromWeights(DB,W) : SeqEnum,SeqEnum -> SeqEnum
ProjectionFromNonsingularPoint(X,p) : Sch,Pt -> Sch,MapSch,Sch

from

Creation from Curve Singularities (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
Creation from Pencils (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
Transfer from GrpPC (FINITE SOLUBLE GROUPS)

from-grp-pc

Transfer from GrpPC (FINITE SOLUBLE GROUPS)

FTGeometry

IsFTGeometry(C) : CosetGeom -> BoolElt
IsFTGeometry(D) : IncGeom -> BoolElt

func

pAdicField(p, n) : RngIntElt, RngIntElt -> FldLoc
Creation Functions (p-ADIC RINGS AND FIELDS)
Function Expressions (OVERVIEW)
f := func< x_1, ..., x_n: parameters | expression >;

Function

BesselFunction(n, r) : RngIntElt, FldReElt -> FldReElt
ClassFunctionSpace(G) : Grp -> AlgChtr
ComplementaryErrorFunction(r) : FldReElt -> FldReElt
DivisionFunction(E, n) : Fld, RngIntElt -> RngFunOrdElt
ErrorFunction(r) : FldReElt -> FldReElt
FaceFunction(F) : NwtnPgon,Tup -> RngElt
Function(f) : Map -> UserProgram
FunctionDegree(f) : MapSch -> RngIntElt
FunctionField(A) : Aff -> FldFunRat
FunctionField(C) : Crv -> FldFun
FunctionField(E) : CrvEll -> FldFun
FunctionField(X) : CrvMod -> FldFun
FunctionField(D) : DiffFun -> FldFun
FunctionField(S) : DiffFun -> FldFun
FunctionField(a) : DiffFunElt -> FldFun
FunctionField(d) : DiffFunElt -> FldFun
FunctionField(G) : DivFun -> FldFun
FunctionField(D) : DivFunElt -> FldFun
FunctionField(f : parameters) : RngMPolElt -> FldFun
FunctionField(S) : PlcFun -> FldFun
FunctionField(P) : PlcFunElt -> FldFun
FunctionField(R) : Rng -> FldFunRat
FunctionField(R, r) : Rng, RngIntElt -> FldFunRat
FunctionField(A) : Sch -> FldFunG
FunctionField(C) : Sch -> FldFunG
FunctionFieldDivisor(D) : DivCrvElt -> DivFunElt
FunctionFieldPlace(P) : PlcCrvElt -> PlcFunElt
GrowthFunction(G) : GrpAtc -> FldFunRatElt
HermitianFunctionField(p, d) : RngIntElt, RngIntElt -> FldFun
ImplicitFunction(f, d, n) : RngUPolElt, RngIntElt, RngIntElt -> RngSerElt
IsAmbientFunction(A,f) : Sch,RngElt -> BoolElt, RngElt
IsAmbientRationalFunction(A,f) : Sch,RngElt -> BoolElt
IsMaximisingFunction(L) : LP -> BoolElt
ObjectiveFunction(L) : LP -> Mtrx
RationalFunction(a) : FldFunGElt -> RngElt
SetMaximiseFunction(L, m) : LP, BoolElt ->
SetObjectiveFunction(L, F) : LP, Mtrx ->
ZetaFunction(E) : CrvEll -> FldFunRatUElt
ZetaFunction(C) : CrvHyp -> FldFunRatUElt
ZetaFunction(C,K) : CrvHyp, FldFin -> FldFunRatUElt
ZetaFunction(F) : FldFun -> FldFunRatUElt
ZetaFunction(F, m) : FldFun, RngIntElt -> FldFunRatUElt
ZetaFunction(s) : FldPrElt -> FldPrElt
ext< K | f > : FldFunRat, RngUPolElt -> FldFun

function

ALGEBRAIC FUNCTION FIELDS
Arithmetic Functions (RING OF INTEGERS)
Function (MAPPINGS)
Function Application (MAGMA SEMANTICS)
Function Expressions (MAGMA SEMANTICS)
Function Values Assigned to Identifiers (MAGMA SEMANTICS)
Functions (FUNCTIONS, PROCEDURES AND PACKAGES)
Functions (OVERVIEW)
Functions and Procedures (FUNCTIONS, PROCEDURES AND PACKAGES)
FUNCTIONS, PROCEDURES AND PACKAGES
Functions, Procedures, and Mappings (OVERVIEW)
RATIONAL FUNCTION FIELDS
Rings, Fields, and Algebras (OVERVIEW)
Structure Creation (CHARACTERS OF FINITE GROUPS)
f := function(x_1, ..., x_n: parameters) : ->

function-application

Function Application (MAGMA SEMANTICS)

function-expression

Function Expressions (MAGMA SEMANTICS)

function-field

ALGEBRAIC FUNCTION FIELDS

function-procedure

Functions and Procedures (FUNCTIONS, PROCEDURES AND PACKAGES)

function-procedure-mapping

Functions, Procedures, and Mappings (OVERVIEW)

function-procedure-package

FUNCTIONS, PROCEDURES AND PACKAGES

function-value-assignment

Function Values Assigned to Identifiers (MAGMA SEMANTICS)

function_field

Function Field (ELLIPTIC CURVES)
Function Field (HYPERELLIPTIC CURVES)
Function Field and Defining Polynomial (ELLIPTIC CURVES)
Function Fields (PLANE ALGEBRAIC CURVES)
Torsion Polynomials (ELLIPTIC CURVES)

function_field-functions

Function Field and Defining Polynomial (ELLIPTIC CURVES)

function_field-torsion_polynomials

Torsion Polynomials (ELLIPTIC CURVES)

function_field_and_polynomials

Function Field and Polynomial Ring (HYPERELLIPTIC CURVES)

FunctionDegree

FunctionDegree(f) : MapSch -> RngIntElt

FunctionField

FunctionField(A) : Aff -> FldFunRat
FunctionField(C) : Crv -> FldFun
FunctionField(E) : CrvEll -> FldFun
FunctionField(X) : CrvMod -> FldFun
FunctionField(D) : DiffFun -> FldFun
FunctionField(S) : DiffFun -> FldFun
FunctionField(a) : DiffFunElt -> FldFun
FunctionField(d) : DiffFunElt -> FldFun
FunctionField(G) : DivFun -> FldFun
FunctionField(D) : DivFunElt -> FldFun
FunctionField(f : parameters) : RngMPolElt -> FldFun
FunctionField(S) : PlcFun -> FldFun
FunctionField(P) : PlcFunElt -> FldFun
FunctionField(R) : Rng -> FldFunRat
FunctionField(R, r) : Rng, RngIntElt -> FldFunRat
FunctionField(A) : Sch -> FldFunG
FunctionField(C) : Sch -> FldFunG
ext< K | f > : FldFunRat, RngUPolElt -> FldFun
FldFunRat_FunctionField (Example H44E1)

FunctionFieldDivisor

FunctionFieldDivisor(D) : DivCrvElt -> DivFunElt

FunctionFieldPlace

FunctionFieldPlace(P) : PlcCrvElt -> PlcFunElt

Functions

RationalFunctions(P) : CrvPlcElt -> SeqEnum
FldAC_Functions (Example H52E4)
FldFin_Functions (Example H45E3)
FldFin_Functions (Example H45E4)

functions

Associated Structures (MODULAR CURVES)
Construction Functions (FINITE SOLUBLE GROUPS)
Conversion Functions (INCIDENCE GEOMETRY)
Elementary Functions (MODULES OVER DEDEKIND DOMAINS)
Function Field and Defining Polynomial (ELLIPTIC CURVES)
Functions and Homogeneity on Ambient Spaces (SCHEMES)
The Functions (FP GROUPS - ADVANCED FEATURES)
Transfer Between Group Categories (FINITE SOLUBLE GROUPS)

Fundamental

FundamentalDiscriminant(D) : RngIntElt -> RngIntElt
FundamentalDomain(G) : GrpPSL2 -> SeqEnum
FundamentalDomain(FS) : SymFry -> SeqEnum
FundamentalGroup( t ) : AlgMatElt -> GrpAb
FundamentalGroup( G ) : GrpLie -> RootDtm
FundamentalGroup( RD ) : RootDtm -> GrpAb
FundamentalInvariants(R) : RngInvar -> [ RngMPolElt ]
FundamentalQuotient(Q) : QuadBin -> Map
FundamentalUnit(K) : FldQuad -> FldQuadElt
FundamentalUnits(O) : RngFunOrd -> SeqEnum[RngFunOrdElt]
FundamentalWeights( W ) : GrpCox -> SeqEnum
FundamentalWeights( G ) : GrpLie -> SeqEnum
FundamentalWeights( RD ) : RootDtm -> Mtrx
IsFundamentalDiscriminant(D) : RngIntElt -> BoolElt
SetOrderUnitsAreFundamental(O) : RngOrd ->

fundamental

Fundamental Invariants (INVARIANT RINGS OF FINITE GROUPS)

FundamentalCoweights

FundamentalCoweights( W ) : GrpCox -> SeqEnum
FundamentalWeights( W ) : GrpCox -> SeqEnum
FundamentalWeights( G ) : GrpLie -> SeqEnum
FundamentalWeights( RD ) : RootDtm -> Mtrx

FundamentalDiscriminant

FundamentalDiscriminant(D) : RngIntElt -> RngIntElt

FundamentalDomain

FundamentalDomain(G) : GrpPSL2 -> SeqEnum
FundamentalDomain(FS) : SymFry -> SeqEnum

FundamentalGroup

FundamentalGroup( t ) : AlgMatElt -> GrpAb
FundamentalGroup( G ) : GrpLie -> RootDtm
FundamentalGroup( RD ) : RootDtm -> GrpAb

FundamentalInvariants

FundamentalInvariants(R) : RngInvar -> [ RngMPolElt ]
RngInvar_FundamentalInvariants (Example H80E8)

FundamentalQuotient

FundamentalQuotient(Q) : QuadBin -> Map

FundamentalUnit

FundamentalUnit(K) : FldQuad -> FldQuadElt

FundamentalUnits

FundamentalUnits(O) : RngFunOrd -> SeqEnum[RngFunOrdElt]

FundamentalWeights

FundamentalCoweights( W ) : GrpCox -> SeqEnum
FundamentalWeights( W ) : GrpCox -> SeqEnum
FundamentalWeights( G ) : GrpLie -> SeqEnum
FundamentalWeights( RD ) : RootDtm -> Mtrx

FunWithHeights

CrvEll_FunWithHeights (Example H87E19)

further

Further Ideal Operations (ALGEBRAIC FUNCTION FIELDS)

[____] [____] [_____] [____] [__] [Index] [Root]