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


Subindex: Cusps  ..    cyclic




Cusps

   Cusps(G) : GrpPSL2 -> SeqEnum

   Cusps(FS) : SymFry -> SeqEnum

   UpperHalfPlaneWithCusps() : -> SpcHyp


cusps

   Cusps and Elliptic Points of Congruence Subgroups (SUBGROUPS OF PSL_2(R))


cusps-and-elliptic-points

   Cusps and Elliptic Points of Congruence Subgroups (SUBGROUPS OF PSL_2(R))


CuspWidth

   CuspWidth(G,x) : GrpPSL2, SetCspElt -> RngIntElt


Cut

   CutVertices(G) : Grph -> { GrphVert }

   CutVertices(G) : GrphMultUnd -> { GrphVert }

   MinimumCut(s, t : parameters) : GrphVert, GrphVert -> SeqEnum, RngIntElt

   MinimumCut(Ss, Ts : parameters) : [ GrphVert ], [ GrphVert ] -> SeqEnum, RngIntElt


CutVertices

   CutVertices(G) : Grph -> { GrphVert }

   CutVertices(G) : GrphMultUnd -> { GrphVert }


cwi

   Magma and CWI NFS interoperability (RING OF INTEGERS)


CWIFormat

   ConvertToCWIFormat(P, pb) : NFSProc, RngIntElt -> .;

   FindRelationsInCWIFormat(P) : NFSProc -> RngIntElt


cy

   Calabi--Yau 3-folds (HILBERT SERIES OF POLARISED VARIETIES)


Cycle

   CreateCycleFile(P) : NFSProc -> .

   Cycle(e, x) : GrpPermElt, Elt -> SetIndx

   Cycle(~u: parameters) : GrpBrdElt ->

   Cycle(u: parameters) : GrpBrdElt -> GrpBrdElt

   CycleCount(fn) : MonStgElt -> RngIntElt

   CycleCount(P) : NFSProc -> RngIntElt

   CycleDecomposition(e) : GrpPermElt -> SeqEnum[SetIndx]

   CycleStructure(g) : GrpPermElt -> [ <RngIntElt, RngIntElt> ]

   GirthCycle(G) : GrphUnd -> [GrphVert]

   HasNegativeWeightCycle(G) : Grph -> BoolElt

   HasNegativeWeightCycle(u : parameters) : GrphVert ->  BoolElt


CycleCount

   CycleCount(fn) : MonStgElt -> RngIntElt

   CycleCount(P) : NFSProc -> RngIntElt


CycleDecomposition

   CycleDecomposition(e) : GrpPermElt -> SeqEnum[SetIndx]


Cycles

   Random(B, r, s, m, n: parameters) : GrpBrd, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> GrpBrdElt

   RandomCFP(B, r, s, m, n: parameters) : GrpBrd, RngIntElt, RngIntElt -> GrpBrdElt

   IsProductOfParallelDescendingCycles(p) : GrpPermElt -> BoolElt


CycleStructure

   CycleStructure(g) : GrpPermElt -> [ <RngIntElt, RngIntElt> ]


Cyclic

   CyclicSubgroups(G) : GrpPC -> SeqEnum

   ElementaryAbelianSubgroups(G) : GrpPC -> SeqEnum

   NilpotentSubgroups(G) : GrpPC -> SeqEnum

   AbelianSubgroups(G) : GrpPC -> SeqEnum

   AdditiveCyclicCode(v) : ModTupFldElt -> CodeAdd

   AdditiveCyclicCode(v4, v2) : ModTupFldElt, ModTupFldElt -> CodeAdd

   AdditiveCyclicCode(n, f) : RngIntElt, RngUPolElt -> CodeAdd

   AdditiveCyclicCode(n, f4, f2) : RngIntElt, RngUPolElt, RngUPolElt -> CodeAdd

   AdditiveQuasiCyclicCode(n, Q) : RngIntElt, SeqEnum[RngUPolElt] -> CodeAdd

   AdditiveQuasiCyclicCode(n, Q, h) : RngIntElt, SeqEnum[RngUPolElt], RngIntElt 							    -> CodeAdd

   AdditiveQuasiCyclicCode(Q) : SeqEnum[ModTupFldElt] -> CodeAdd

   AdditiveQuasiCyclicCode(Q, h) : SeqEnum[ModTupFldElt], RngIntElt 							    -> CodeAdd

   ClassGroupCyclicFactorGenerators(O) : RngOrd -> ModHomElt

   ConstaCyclicCode(n, f, alpha) : RngUPolElt, RngIntElt, FldFinElt -> Code

   CyclicCode(u) : ModTupRngElt -> Code

   CyclicCode(u) : ModTupRngElt -> Code

   CyclicCode(n, g) : RngIntElt, RngUPolElt -> Code

   CyclicCode(n, g) : RngIntElt, RngUPolElt -> Code

   CyclicCode(n, T, K) : RngIntElt, [ FldFinElt ], FldFin -> Code

   CyclicGroup(C, n) : Cat, RngIntElt -> GrpFin

   CyclicGroup(GrpFP, n) : Cat, RngIntElt -> GrpFP

   CyclicGroup(GrpGPC, n) : Cat, RngIntElt -> GrpGPC

   CyclicGroup(GrpPC, n) : Cat, RngIntElt -> GrpPC

   CyclicGroup(GrpPerm, n) : Cat, RngIntElt -> GrpPerm

   CyclicSubgroups(G: parameters) : GrpFin -> [ rec< Grp, RngIntElt, RngIntElt, GrpFP> ]

   CyclicSubgroups(G: parameters) : GrpPerm -> [ rec< GrpPerm, RngIntElt, RngIntElt, GrpFP> ]

   IsCyclic(C) : Code -> BoolElt

   IsCyclic(C) : Code -> BoolElt

   IsCyclic(G) : GrpAb -> BoolElt

   IsCyclic(G) : GrpFin -> BoolElt

   IsCyclic(G) : GrpGPC -> BoolElt

   IsCyclic(G) : GrpMat -> BoolElt

   IsCyclic(G) : GrpPC -> BoolElt

   IsCyclic(G) : GrpPerm -> BoolElt

   QuantumCyclicCode(v) : ModTupFldElt -> CodeAdd

   QuantumCyclicCode(v4, v2) : ModTupFldElt, ModTupFldElt -> CodeAdd

   QuantumCyclicCode(n, f) : RngIntElt, RngUPolElt -> CodeAdd

   QuantumQuasiCyclicCode(n, Q) : RngIntElt, SeqEnum[RngUPolElt] -> CodeAdd

   QuantumQuasiCyclicCode(Q) : SeqEnum[ModTupFldElt] -> CodeAdd

   QuasiCyclicCode(n, Gen) : RngIntElt, [ RngUPolElt ] -> Code

   QuasiCyclicCode(n, Gen, h) : RngIntElt, [ RngUPolElt ], RngIntElt -> Code

   QuasiCyclicCode(Gen) : [ ModTupRngElt ] -> Code

   QuasiCyclicCode(Gen, h) : [ModTupRngElt] , RngIntElt -> Code

   QuasiTwistedCyclicCode(n, Gen, alpha) : RngIntElt, [RngUPolElt], FldFinElt -> Code

   QuasiTwistedCyclicCode(Gen, alpha) : [ModTupRngElt], FldFinElt -> Code


cyclic

   Construction of General Cyclic  Codes (LINEAR CODES OVER FINITE RINGS)

   Cyclic and Quasicyclic Codes (LINEAR CODES OVER FINITE FIELDS)

   Cyclic Codes (ADDITIVE CODES)




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