[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: distance .. Divisor
OutNeighbors(u) : GrphVert -> { GrphVert }
Adjacency, Degree and Distance (GRAPHS)
Bounds on the Minimum Distance (LINEAR CODES OVER FINITE FIELDS)
Distance and Weight (LINEAR CODES OVER FINITE FIELDS)
Vector Space and Related Operations (LINEAR CODES OVER FINITE FIELDS)
DistanceMatrix(G) : Grph -> AlgMatElt
DistancePartition(u) : GrphVert -> [ { GrphVert } ]
DistancePartition(u) : GrphVert -> [ { GrphVert } ]
DistinctDegreeFactorization(f) : RngUPolElt -> [ <RngIntElt, RngUPolElt> ]
DistinctExtensions(G, N, F, M) : GrpPerm, GrpPerm, GrpFP, ModGrp -> SeqEnum
DistinctExtensions(CM) : ModCoho -> SeqEnum
DistinctDegreeFactorization(f) : RngUPolElt -> [ <RngIntElt, RngUPolElt> ]
DistinctExtensions(G, N, F, M) : GrpPerm, GrpPerm, GrpFP, ModGrp -> SeqEnum
DistinctExtensions(CM) : ModCoho -> SeqEnum
Distributing NFS factorizations (RING OF INTEGERS)
RngInt_distributed (Example H35E14)
CosetDistanceDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
DualEuclideanWeightDistribution(C) : Code -> SeqEnum
DualLeeWeightDistribution(C) : Code -> eseq
DualWeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
DualWeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
EuclideanWeightDistribution(C) : Code -> SeqEnum
LeeWeightDistribution(C) : Code -> eseq
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C, u) : Code, ModTupFldElt -> [ <RngIntElt, RngIntElt> ]
Hamming Weight (LINEAR CODES OVER FINITE RINGS)
The Weight Distribution (LINEAR CODES OVER FINITE FIELDS)
Weight Distributions (LINEAR CODES OVER FINITE RINGS)
MULTIVARIATE POLYNOMIAL RINGS
MULTIVARIATE POLYNOMIAL RINGS
LeftDiv(u, v) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
LeftDiv(u, ~v) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
Arithmetic with Places and Divisors (ORDERS AND ALGEBRAIC FIELDS)
Creation of Elements (ORDERS AND ALGEBRAIC FIELDS)
Creation of Structures (ORDERS AND ALGEBRAIC FIELDS)
Other functions for Divisors and Places (ORDERS AND ALGEBRAIC FIELDS)
Rings, Fields, and Algebras (OVERVIEW)
D + E : DivCrvElt,DivCrvElt -> DivCrvElt
v div d : LatElt, RngIntElt -> LatElt
f div s : ModMPolElt, RngMPolElt -> ModMPolElt
n div m : RngIntElt, RngIntElt -> RngIntElt
f div g : RngMPolElt, RngMPolElt -> RngMPolElt
w div v : RngOrdElt, RngOrdElt -> RngOrdElt
x div y : RngPadElt, RngPadElt -> RngPadElt
f div g : RngUPolElt, RngUPolElt -> RngUPolElt
v div w : RngValElt, RngValElt -> RngValElt
Arithmetic with Places and Divisors (ORDERS AND ALGEBRAIC FIELDS)
Creation of Elements (ORDERS AND ALGEBRAIC FIELDS)
DivisorGroup(K) : FldNum -> DivNum
Creation of Structures (ORDERS AND ALGEBRAIC FIELDS)
Other functions for Divisors and Places (ORDERS AND ALGEBRAIC FIELDS)
f div:= s : ModMPolElt, RngMPolElt ->
FldFunG_div_diff (Example H57E37)
IsDivisibleBy(a, b) : FldFunElt, FldFunElt -> BoolElt, FldFunElt
IsDivisibleBy(n, d) : RngIntElt, RngIntElt -> BoolElt, RngIntElt
IsDivisibleBy(a, b) : RngMPolElt, RngMPolElt -> BoolElt, RngMPolElt
IsDivisibleBy(a, b) : RngUPolElt, RngUPolElt -> BoolElt, RngUPolElt
IsExactlyDivisible(x, y) : RngPadElt, RngPadElt -> BoolElt, RngPadElt
DivisionFunction(E, n) : Fld, RngIntElt -> RngFunOrdElt
DivisionPoints(P, n) : PtEll, RngIntElt -> [ PtEll ]
DivisionPolynomial(E, n) : CrvEll, RngIntElt -> RngUPolElt, RngUPolElt, RngUPolElt
IsDivisionRing(R) : Rng -> BoolElt
TrialDivision(n) : RngIntElt -> RngIntEltFact, [ RngIntElt ]
TrialDivision(n, B) : RngQuadElt, RngIntElt -> SeqEnum, SeqEnum, Tup
RngLoc_Division (Example H61E10)
Operators (OVERVIEW)
Quotient and Reductum (MULTIVARIATE POLYNOMIAL RINGS)
Quotient and Remainder (UNIVARIATE POLYNOMIAL RINGS)
Rings, Fields, and Algebras (OVERVIEW)
DivisionFunction(E, n) : Fld, RngIntElt -> RngFunOrdElt
DivisionPoints(P, n) : PtEll, RngIntElt -> [ PtEll ]
DivisionPolynomial(E, n) : CrvEll, RngIntElt -> RngUPolElt, RngUPolElt, RngUPolElt
CrvEll_DivisionPolynomial (Example H91E19)
CurveDivisor(D) : DivFunElt -> DivCrvElt
Div ! D : DivCrv, DivFunElt -> DivCrvElt
Div ! p : DivCrv, PlcCrvElt -> DivCrvElt
D ! 0 : DivCrv,RngIntElt -> DivCrvElt
Div ! a : DivFun, RngElt -> DivFunElt
Div ! I : DivFun, RngFunOrdIdl -> DivFunElt
CanonicalDivisor(F) : FldFun -> DivFunElt
ComplementaryDivisor(D,p) : DivCrvElt,Pt -> DivCrvElt
ComplementaryDivisor(D) : DivFunElt -> DivFunElt
DifferentDivisor(F) : FldFun -> DivFunElt
DiscriminantDivisor(m, U) : DivFunElt, GrpAb -> DivFunElt
Divisor(C) : Code -> DivCrvElt
Divisor(d) : DiffFunElt -> DivFunElt
Divisor(Div,L) : DivCrv, Crv -> DivCrvElt
Divisor(Div,S) : DivCrv, SeqEnum -> DivCrvElt
Divisor(Div,a) : DivCrv,DiffFunElt -> DivCrvElt
Divisor(Div,p,q) : DivCrv,Pt,Pt -> DivCrvElt
Divisor(a) : FldFunGElt -> DivFunElt
Divisor(P) : PlcFunElt -> DivFunElt
Divisor(pl) : PlcNumElt -> DivNumElt
Divisor(I) : RngFunOrdIdl -> DivFunElt
Divisor(I, J) : RngFunOrdIdl, RngFunOrdIdl -> DivFunElt
Divisor(I, J) : RngFunOrdIdl, RngFunOrdIdl -> DivFunElt
Divisor(I) : RngOrdFracIdl -> DivNumElt
Divisor(Q) : SeqEnum -> DivCrvElt
DivisorGroup(C) : Crv -> DivCrv
DivisorGroup(D) : DivCrvElt -> DivCrv
DivisorGroup(F) : FldFun -> DivFun
DivisorGroup(F) : FldFun -> DivFun
DivisorGroup(F) : FldFun -> DivFun
DivisorIdeal(I) : RngMPolRes -> RngMPol
DivisorMap(D) : DivCrvElt -> MapSch
DivisorOfDegreeOne(F) : FldFun -> DivFunElt
DivisorSigma(i, n) : RngIntElt, RngIntElt -> RngIntElt
ExtendedGreatestCommonDivisor(m, n) : RngIntElt, RngIntElt -> RngIntElt, RngIntElt, RngIntElt
ExtendedGreatestCommonDivisor(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt, RngUPolElt, RngUPolElt
ExtendedGreatestCommonDivisor(v, w) : RngValElt, RngValElt -> RngValElt, RngValElt, RngValElt
ExtendedGreatestCommonDivisor(s) : [RngIntElt] -> RngIntElt, [RngIntElt]
FunctionFieldDivisor(D) : DivCrvElt -> DivFunElt
GCD(D1, D2) : DivCrvElt, DivCrvElt -> DivCrvElt
GCD(D1, D2) : DivFunElt, DivFunElt -> DivFunElt
GCD(I, J) : RngOrdFracIdl, RngOrdFracIdl -> RngOrdFracIdl
Gcd(a, b) : RngQuadElt, RngQuadElt -> RngQuadElt
GreatestCommonDivisor(a, b) : RngIntResElt, RngIntResElt -> RngIntResElt
GreatestCommonDivisor(f, g) : RngMPolElt, RngMPolElt -> RngMPolElt
GreatestCommonDivisor(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt
GreatestCommonDivisor(f, g) : RngUPolElt, RngUPolElt -> RngUPolElt
GreatestCommonDivisor(v, w) : RngValElt, RngValElt -> RngValElt
GreatestCommonDivisor(s) : [RngIntElt] -> RngIntElt
GreatestCommonDivisor(Q) : [RngIntResElt] -> RngIntResElt
IsZeroDivisor(a) : AlgGenElt -> BoolElt
IsZeroDivisor(x) : RngElt -> BoolElt
LeftGCD(u, v: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
LeftGCD(S: parameters) : Setq -> GrpBrdElt
NonSpecialDivisor(m): DivFunElt -> DivFunElt, RngIntElt
Places(K) : FldNum -> PlcNum
PrincipalDivisor(Div,f) : DivCrv, FldFunElt -> DivCrvElt
PrincipalDivisorMap(F) : FldFun -> Map
RamificationDivisor(D) : DivCrvElt -> DivCrvElt
RamificationDivisor(D) : DivFunElt -> DivFunElt
RamificationDivisor(F) : FldFunG -> DivFunElt
RamificationDivisor(m) : MapSch -> DivFunElt
RightGCD(u, v: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
RightGCD(S: parameters) : Setq -> GrpBrdElt
SPrincipalDivisorMap(S) : SetEnum[PlcFunElt] -> Map
[____] [____] [_____] [____] [__] [Index] [Root]