[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: discriminant .. Distribution
Elementary Invariants (RATIONAL CURVES AND CONICS)
Resultant and Discriminant (UNIVARIATE POLYNOMIAL RINGS)
Resultants and Discriminants (MULTIVARIATE POLYNOMIAL RINGS)
DiscriminantDivisor(m, U) : DivFunElt, GrpAb -> DivFunElt
DiscriminantDivisor(A) : FldFunAb -> DivFunElt
DiscriminantFromShiodaInvariants(JI) : SeqEnum -> RngElt
DiscriminantOfHeckeAlgebra(M : Bound) : ModSym -> RngIntElt
DiscriminantRange(D) : DB -> RngIntElt, RngIntElt
HeegnerDiscriminants(E,lo,hi) : CrvEll[FldRat], RngIntElt, RngIntElt -> SeqEnum
DiscToPlane(H,z) : SpcHyp, SpcHydElt -> SpcHypElt
IsDisjoint(R, S) : SetEnum, SetEnum -> BoolElt
Display(P) : GrpPCpQuotientProc ->
DisplayBurnsideMatrix(G) : GrpPC ->
DisplayCompTreeNodes(G : parameters) : Grp ->
DisplayFareySymbolDomain(FS,file) : SymFry, MonStgElt -> SeqEnum
DisplayPolygons(P,file) : SeqEnum, MonStgElt ->
SetDisplayLevel(~P, Level) : GrpPCpQuotientProc, RngIntElt ->
DisplayBurnsideMatrix(G) : GrpPC ->
DisplayCompTreeNodes(G : parameters) : Grp ->
DisplayFareySymbolDomain(FS,file) : SymFry, MonStgElt -> SeqEnum
DisplayPolygons(P,file) : SeqEnum, MonStgElt ->
CrvHyp_DisregardTheWarning (Example H125E33)
Curves and Dissident Points (HILBERT SERIES OF POLARISED VARIETIES)
CanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
PossibleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
PossibleSimpleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
SimpleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
CosetDistanceDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
Distance(x, L) : FldReElt, [FldReElt] -> FldReElt, RngIntElt
Distance(u, v) : GrphVert, GrphVert -> RngIntElt
Distance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
Distance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
Distance(u, v) : ModTupRngElt, ModTupRngElt -> RngIntElt
Distance(u, v : parameters) : GrphVert, GrphVert -> RngElt
Distance(f, g) : RngUPolElt, RngUPolElt -> RngIntElt
Distance(z,w) : SpcHydElt, SpcHydElt -> FldReElt
Distance(z,w) : SpcHypElt, SpcHypElt -> FldReElt
DistanceMatrix(G) : Grph -> AlgMatElt
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
MinimumWeight(C: parameters) : CodeAdd -> RngIntElt
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
CodeFld_Distance (Example H152E11)
Bounds on the Minimum Distance (LINEAR CODES OVER FINITE FIELDS)
Distance and Weight (ADDITIVE CODES)
Distance and Weight (LINEAR CODES OVER FINITE FIELDS)
Vector Space and Related Operations (ADDITIVE CODES)
Vector Space and Related Operations (LINEAR CODES OVER FINITE FIELDS)
Distance and Angles (ARITHMETIC FUCHSIAN GROUPS AND SHIMURA CURVES)
Distances, Angles and Geodesics (CONGRUENCE SUBGROUPS OF PSL2(R))
DistanceMatrix(G) : Grph -> AlgMatElt
DistancePartition(u) : GrphVert -> [ { GrphVert } ]
Distances(u : parameters) : GrphVert -> Eseq
DistinctDegreeFactorization(f) : RngUPolElt -> [ <RngIntElt, RngUPolElt> ]
DistinctExtensions(CM) : ModCoho -> SeqEnum
GrpCoh_distinct-extensions (Example H68E11)
GrpCoh_distinct-extensions (Example H68E8)
DistinctDegreeFactorization(f) : RngUPolElt -> [ <RngIntElt, RngUPolElt> ]
DistinctExtensions(CM) : ModCoho -> SeqEnum
DistinguishedOrbitsOnSimples(R) : RootDtm -> SeqEnum[GSetEnum]
DistinguishedOrbitsOnSimples(R) : RootDtm -> SeqEnum[GSetEnum]
Distributing NFS Factorizations (RING OF INTEGERS)
RngInt_distributed (Example H18E14)
CosetDistanceDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
DualEuclideanWeightDistribution(C) : Code -> SeqEnum
DualLeeWeightDistribution(C) : Code -> SeqEnum
DualWeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
DualWeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
DualWeightDistribution(C) : CodeAdd -> [ <RngIntElt, RngIntElt> ]
EuclideanWeightDistribution(C) : Code -> SeqEnum
LeeWeightDistribution(C) : Code -> SeqEnum
PartialWeightDistribution(C, ub) : Code -> [ <RngIntElt, RngIntElt> ]
PrintProbabilityDistribution(e) : HilbSpcElt ->
PrintSortedProbabilityDistribution(e) : HilbSpcElt ->
ProbabilityDistribution(e) : HilbSpcElt -> Mtrx
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C) : Code -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C, u) : Code, ModTupFldElt -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(C) : CodeAdd -> [ <RngIntElt, RngIntElt> ]
WeightDistribution(Q) : CodeQuantum -> SeqEnum, SeqEnum, SeqEnum
[____] [____] [_____] [____] [__] [Index] [Root]
Version: V2.19 of
Mon Dec 17 14:40:36 EST 2012