[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: ClebschGraph .. Co1
ShrikhandeGraph() : -> GrphUnd
GewirtzGraph() : -> GrphUnd
ClebschGraph() : -> GrphUnd
ClebschInvariants(C) : CrvHyp -> SeqEnum
ClebschInvariants(f) : RngUPolElt -> SeqEnum
ClebschToIgusaClebsch(Q) : SeqEnum -> SeqEnum
CliqueNumber(G : parameters) : GrphUnd -> RngIntElt
HasClique(G, k) : GrphUnd, RngIntElt -> BoolElt, { GrphVert }
HasClique(G, k, m : parameters) : GrphUnd, RngIntElt, BoolElt -> BoolElt, { GrphVert }
HasClique(G, k, m, f : parameters) : GrphUnd, RngIntElt, BoolElt, RngIntElt -> BoolElt, { GrphVert }
MaximumClique(G : parameters) : GrphUnd -> { GrphVert }
Cliques, Independent Sets (GRAPHS)
Cliques, Independent Sets (GRAPHS)
CliqueNumber(G : parameters) : GrphUnd -> RngIntElt
AllCliques(G : parameters) : GrphUnd -> SeqEnum
AllCliques(G, k : parameters) : GrphUnd, RngIntElt -> SeqEnum
AllCliques(G, k, m : parameters) : GrphUnd, RngIntElt, BoolElt -> SeqEnum
Graph_Cliques (Example H117E16)
CloseVectors(L, w, u) : Lat, ModTupRngElt, RngElt -> [ <LatElt, RngElt> ]
CloseVectorsMatrix(L, w, u) : Lat, ModTupRngElt, RngElt -> ModMatRngElt
CloseVectorsProcess(L, w, u) : Lat, ModTupRngElt, RngElt -> LatEnumProc
Short and Close Vectors (LATTICES)
HasCompleteCosetTable(P) : GrpFPCosetEnumProc -> BoolElt
HasClosedCosetTable(P) : GrpFPCosetEnumProc -> BoolElt
ALGEBRAICALLY CLOSED FIELDS
ClosestVectors(L, w) : Lat, ModTupRngElt -> [ LatElt ], RngElt
ClosestVectorsMatrix(L, w) : Lat, ModTupRngElt -> ModMatRngElt, RngElt
Lat_Closest (Example H66E10)
Shortest and Closest Vectors (LATTICES)
ClosestVectors(L, w) : Lat, ModTupRngElt -> [ LatElt ], RngElt
ClosestVectorsMatrix(L, w) : Lat, ModTupRngElt -> ModMatRngElt, RngElt
CloseVectors(L, w, u) : Lat, ModTupRngElt, RngElt -> [ <LatElt, RngElt> ]
CloseVectorsMatrix(L, w, u) : Lat, ModTupRngElt, RngElt -> ModMatRngElt
CloseVectorsProcess(L, w, u) : Lat, ModTupRngElt, RngElt -> LatEnumProc
AlgebraicClosure() : -> FldAC
AlgebraicClosure(K) : Fld -> FldAC
ClosureGraph(P, G) : GrpPerm, GrphUnd -> GrphUnd
IntegralClosure(R, F) : Rng, FldFun -> RngFunOrd
MakeProjectiveClosureMap(A, P, S) : Aff,Prj,SeqEnum ->
NeighbourClosure(L, p) : Lat, RngIntElt -> Lat
NormalClosure(G, H) : GrpAb, GrpAb -> GrpAb
OrbitClosure(G, S) : GrpMat, { Elt } -> GSet
OrbitClosure(G, Y, S) : GrpPerm, GSet, { Elt } -> GSet
ProjectiveClosure(f) : MapSch -> MapSch
ProjectiveClosure(A): Sch -> Sch
ProjectiveClosure(C) : Sch -> Sch
ProjectiveClosure(X) : Sch -> Sch
ProjectiveClosureMap(A) : Aff -> MapSch
RootClosure(R, S) : RootDtm, SetEnum[RngIntElt] -> SetEnum[RngIntElt]
VarietySizeOverAlgebraicClosure(I) : RngMPol -> RngIntElt
H ^ G : GrpFin -> GrpFin
H ^ G : GrpFin, GrpFin -> GrpFin
H ^ G : GrpFP, GrpFP -> GrpFP
H ^ G : GrpGPC, GrpGPC -> GrpGPC
H ^ G : GrpMat -> GrpMat
H ^ G : GrpMat, GrpMat -> GrpMat
H ^ G : GrpPC, GrpPC -> GrpPC
H ^ G : GrpPerm, GrpPerm -> GrpPerm
Affine Patches and Projective Closure (SCHEMES)
Maps and Closure (SCHEMES)
Projective Closure (ALGEBRAIC CURVES)
Projective Closure (SCHEMES)
Projective Closure and Affine Patches (ALGEBRAIC CURVES)
Projective Closure and Affine Patches (ALGEBRAIC CURVES)
ClosureGraph(P, G) : GrpPerm, GrphUnd -> GrphUnd
Cluster(p) : Pt -> Clstr
IsCluster(X) : Sch -> BoolElt,Clstr
Scheme(X,f) : Sch,RngMPolElt -> Sch
Scheme_cluster-degree5 (Example H97E9)
Zero-dimensional Schemes (SCHEMES)
IsCM(M : parameters) : ModSym -> BoolElt, RngIntElt
HasCM(M : parameters) : ModSym -> BoolElt, RngIntElt
Creation and Modification of Baskets (HILBERT SERIES OF POLARISED VARIETIES)
Creation and Modification of Baskets (HILBERT SERIES OF POLARISED VARIETIES)
x cmpeq y : Elt, Elt -> BoolElt
x cmpne y : Elt, Elt -> BoolElt
CMPoints(E, D : parameters) : CrvEll[FldRat], RngIntElt -> Tup, PtEll
CMTwists(A : parameters) : ModAbVar -> SeqEnum
GrpFP_1_Co1 (Example H30E59)
[____] [____] [_____] [____] [__] [Index] [Root]