[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: DirectSumDecomposition .. Distance
DirectSumDecomposition(L) : AlgLie -> [ AlgLie ]
DirectSumDecomposition( R ) : RootDtm -> []
AlgLie_DirectSumDecomposition (Example H81E7)
RootDtm_DirectSumDual (Example H80E18)
RootSys_DirectSumDual (Example H79E16)
DirichletCharacters(M) : ModFrm -> [GrpDrchElt]
DirichletGroup(N) : RngIntElt -> GrpDrch
DirichletGroup(N,R) : RngIntElt, Rng -> GrpDrch
DirichletGroup(N,R,z,r) : RngIntElt, Rng, RngElt, RngIntElt -> GrpDrch
ModSym_Dirichlet (Example H94E7)
Dirichlet Characters (MODULAR SYMBOLS)
DirichletCharacters(M) : ModFrm -> [GrpDrchElt]
DirichletGroup(N) : RngIntElt -> GrpDrch
DirichletGroup(N,R) : RngIntElt, Rng -> GrpDrch
DirichletGroup(N,R,z,r) : RngIntElt, Rng, RngElt, RngIntElt -> GrpDrch
RayClassGroupDiscLog(y, D) : DivFunElt, DivFunElt -> GrpAbElt
Disconnect(v,w) : GrphResVert -> GrphRes
Discrete Logarithms (ELLIPTIC CURVES)
SMat_DiscreteLog (Example H43E3)
AbsoluteDiscriminant(K) : FldAlg -> FldRatElt
AbsoluteDiscriminant(O) : RngFunOrd -> .
AbsoluteDiscriminant(O) : RngOrd -> RngIntElt
Discriminant(A) : AlgQuat -> FldRatElt
Discriminant(S) : AlgQuatOrd -> RngIntElt
Discriminant(C) : CrvCon -> FldElt
Discriminant(E) : CrvEll -> RngElt
Discriminant(C) : CrvHyp -> RngElt
Discriminant(A) : FldAb -> RngOrdIdl, [RngIntElt]
Discriminant(K) : FldQuad -> RngIntElt
Discriminant(Q) : FldRat -> RngIntElt
Discriminant(M) : ModBrdt -> RngIntElt
Discriminant(Q) : QuadBin -> RngIntElt
Discriminant(f) : QuadBinElt -> RngIntElt
Discriminant(O) : RngFunOrd -> .
Discriminant(f, i) : RngMPolElt, RngIntElt -> RngMPolElt
Discriminant(O) : RngOrd -> RngIntElt
Discriminant(I) : RngQuadFracIdl -> RngIntElt
Discriminant(f) : RngUPolElt -> RngIntElt
DiscriminantDivisor(m, U) : DivFunElt, GrpAb -> DivFunElt
DiscriminantOfHeckeAlgebra(M : Bound) : ModSym -> RngIntElt
FundamentalDiscriminant(D) : RngIntElt -> RngIntElt
IsDiscriminant(D) : RngIntElt -> BoolElt
IsFundamentalDiscriminant(D) : RngIntElt -> BoolElt
ReducedDiscriminant(O) : RngOrd -> RngIntElt
RngOrd_Discriminant (Example H50E16)
Elementary Invariants (RATIONAL CURVES AND CONICS)
Resultant and Discriminant (UNIVARIATE POLYNOMIAL RINGS)
Resultants and Discriminants (MULTIVARIATE POLYNOMIAL RINGS)
DiscriminantDivisor(m, U) : DivFunElt, GrpAb -> DivFunElt
DiscriminantOfHeckeAlgebra(M : Bound) : ModSym -> RngIntElt
Geometry and Basic Conventions (DATABASE OF K3 SURFACES)
IsDisjoint(R, S) : SetEnum, SetEnum -> BoolElt
DisownChildren(M) : ModSym ->
DisownChildren(M) : ModSym ->
Display(P) : Process(pQuot) ->
DisplayBurnsideMatrix(G) : GrpPC ->
DisplayFareySymbolDomain(FS,file) : SymFry, MonStgElt -> SeqEnum
DisplayPolygons(P,file) : SeqEnum, MonStgElt ->
SetDisplayLevel(~P, Level) : Process(pQuot), RngIntElt ->
DisplayBurnsideMatrix(G) : GrpPC ->
DisplayFareySymbolDomain(FS,file) : SymFry, MonStgElt -> SeqEnum
DisplayPolygons(P,file) : SeqEnum, MonStgElt ->
CosetDistanceDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
Distance(u, v) : GrphVert, GrphVert -> RngIntElt
Distance(u, v) : GrphVert, GrphVert -> RngIntElt
Distance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
Distance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
DistanceMatrix(G) : Grph -> AlgMatElt
DistancePartition(u) : GrphVert -> [ { GrphVert } ]
DistancePartition(u) : GrphVert -> [ { GrphVert } ]
EuclideanDistance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
GoppaDesignedDistance(C) : Code -> RngIntElt
IsDistanceRegular(G) : GrphUnd -> BoolElt
IsDistanceTransitive(G) : GrphUnd -> BoolElt
IsMaximumDistanceSeparable(C) : Code -> BoolElt
LeeDistance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
MinimumEuclideanWeight(C) : Code -> RngIntElt
MinimumLeeWeight(C) : Code -> RngIntElt
MinimumWeight(C) : Code -> RngIntElt
MinimumWeight(C: parameters) : Code -> RngIntElt
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
CodeFld_Distance (Example H107E11)
[____] [____] [_____] [____] [__] [Index] [Root]