[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: CycleCount .. CyclotomicPolynomial
CycleCount(fn) : MonStgElt -> RngIntElt
CycleCount(P) : NFSProc -> RngIntElt
CycleDecomposition(e) : GrpPermElt -> SeqEnum[SetIndx]
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(g) : GrpPermElt -> [ <RngIntElt, RngIntElt> ]
CyclicSubgroups(G) : GrpPC -> SeqEnum
ElementaryAbelianSubgroups(G) : GrpPC -> SeqEnum
NilpotentSubgroups(G) : GrpPC -> SeqEnum
AbelianSubgroups(G) : GrpPC -> SeqEnum
ClassGroupCyclicFactorGenerators(O) : RngOrd -> ModHomElt
ConstaCyclicCode(f, n, 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
QuasiCyclicCode(n, Gen, h) : RngIntElt, SeqEnum, RngIntElt -> Code
QuasiCyclicCode(Gen) : RngIntElt, [ ModTupRngElt ] -> Code
QuasiCyclicCode(n, Gen) : RngIntElt, [ RngUPolElt ] -> Code
QuasiCyclicCode(Gen, h) : [ModTupRngElt] , RngIntElt -> Code
QuasiTwistedCyclicCode(n, Gen, alpha) : RngIntElt, [RngUPolElt], FldFinElt -> Code
QuasiTwistedCyclicCode(Gen, alpha) : [ModTupRngElt], FldFinElt -> Code
Construction of General Cyclic Codes (LINEAR CODES OVER FINITE RINGS)
Cyclic and Quasicyclic Codes (LINEAR CODES OVER FINITE FIELDS)
CodeRng_cyclic-galois-ring (Example H108E6)
FldAC_Cyclic6 (Example H55E5)
GB_Cyclic6 (Example H47E2)
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
CodeFld_CyclicCode (Example H107E5)
CodeRng_CyclicCode (Example H108E5)
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) : GrpPC -> SeqEnum
ElementaryAbelianSubgroups(G) : GrpPC -> SeqEnum
NilpotentSubgroups(G) : GrpPC -> SeqEnum
AbelianSubgroups(G) : GrpPC -> SeqEnum
CyclicSubgroups(G: parameters) : GrpFin -> [ rec< Grp, RngIntElt, RngIntElt, GrpFP> ]
CyclicSubgroups(G: parameters) : GrpPerm -> [ rec< GrpPerm, RngIntElt, RngIntElt, GrpFP> ]
CyclotomicFactors(n) : RngIntElt -> [RngUPolElt]
CyclotomicField(m) : RngIntElt -> FldCyc
CyclotomicOrder(K) : FldCyc -> RngIntElt
CyclotomicPolynomial(m) : RngIntElt -> RngUPolElt
CYCLOTOMIC FIELDS
Functions Returning a Scalar (CHARACTERS OF FINITE GROUPS)
Rings, Fields, and Algebras (OVERVIEW)
FldAb_cyclotomic-extension (Example H54E8)
CyclotomicFactors(n) : RngIntElt -> [RngUPolElt]
CyclotomicField(m) : RngIntElt -> FldCyc
CyclotomicOrder(K) : FldCyc -> RngIntElt
CyclotomicPolynomial(m) : RngIntElt -> RngUPolElt
[____] [____] [_____] [____] [__] [Index] [Root]