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

Subindex: Conjugate(f)  ..  Constant


Conjugate(f)

   Conjugate(f) : QuadBinElt -> QuadBinElt

conjugate-norm-trace

   Conjugates, Norm and Trace (RATIONAL FIELD)
   Conjugates, Norm and Trace (RING OF INTEGERS)

ConjugatePartition

   ConjugatePartition(P) : SeqEnum -> SeqEnum

Conjugates

   Conjugates(H, g) : GrpAb, GrpAbElt -> { GrpAbElt }
   g ^ H : GrpAbElt, GrpAb -> { GrpAbElt }
   Class(H, g) : GrpAb, GrpAbElt -> { GrpAbElt }
   Class(G, H) : GrpFin, GrpFin -> { GrpFin }
   Class(H, x) : GrpFin, GrpFinElt -> { GrpFinElt }
   Class(H, x) : GrpMat, GrpMatElt -> { GrpMatElt }
   Class(H, g) : GrpPC, GrpPCElt -> { GrpPCElt }
   Class(H, x) : GrpPerm, GrpPermElt -> { GrpPermElt }
   Conjugates(a) : FldACElt -> [ FldACElt ]
   Conjugates(a) : FldAlgElt -> [ FldPrElt ]
   ExcludedConjugate(P) : GrpFPCosetEnumProc -> GrpFPElt
   ExcludedConjugates(V) : GrpFPCos -> { GrpFPElt }
   PositiveConjugates(u: parameters) : GrpBrdElt -> SetIndx
   PositiveConjugatesProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc
   GrpBrd_Conjugates (Example H29E7)

conjugates

   Conjugates (CYCLOTOMIC FIELDS)
   Conjugates (QUADRATIC FIELDS)

ConjugatesProcess

   GrpBrd_ConjugatesProcess (Example H29E8)

conjugation

   Groups (OVERVIEW)

Connect

   Connect(v,w) : GrphResVert,GrphResVert -> GrphRes

Connected

   IsConnected(G) : GrphUnd -> BoolElt
   IsKEdgeConnected(G, k) : Grph, RngIntElt -> BoolElt
   IsKVertexConnected(G, k) : Grph, RngIntElt -> BoolElt
   IsResiduallyConnected(C) : CosetGeom -> BoolElt
   IsResiduallyConnected(D) : IncGeom -> BoolElt
   IsSimplyConnected( G ) : GrpLie-> BoolElt
   IsSimplyConnected( R ) : RootDtm-> BoolElt
   IsStronglyConnected(G) : GrphDir -> BoolElt
   IsWeaklyConnected(G) : GrphDir -> BoolElt
   StronglyConnectedComponents(G) : GrphUnd -> [GrphDir]

connectedness

   Connectedness in a Graph (GRAPHS)
   Connectedness, Paths and Circuits (GRAPHS)

connectedness-graph

   Connectedness in a Graph (GRAPHS)

connectedness-path-circuit

   Connectedness, Paths and Circuits (GRAPHS)

Connecting

   ConnectingHomomorphism(f,g,n) : MapChn, MapChn, RngIntElt -> ModMatFldElt

ConnectingHomomorphism

   ConnectingHomomorphism(f,g,n) : MapChn, MapChn, RngIntElt -> ModMatFldElt

Connection

   ConnectionPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
   CharacteristicPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
   BerlekampMassey(S) : SeqEnum -> RngUPolElt, RngIntElt
   ConnectionNumber(D, p, B) : Inc, IncPt, IncBlk -> RngIntElt

ConnectionNumber

   ConnectionNumber(D, p, B) : Inc, IncPt, IncBlk -> RngIntElt

ConnectionPolynomial

   ConnectionPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
   CharacteristicPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
   BerlekampMassey(S) : SeqEnum -> RngUPolElt, RngIntElt

Connectivity

   EdgeConnectivity(G) : Grph -> RngIntElt, [ { GrphEdge } ]
   VertexConnectivity(G) : Grph -> RngIntElt, [ { GrphVert } ]
   Graph_Connectivity (Example H102E15)

connectivity

   General Vertex and Edge Connectivity in Graphs and Digraphs (GRAPHS)

consconv

   Element Constructions and Conversions (p-ADIC RINGS AND THEIR EXTENSIONS)

consconv-element

   Element Constructions and Conversions (p-ADIC RINGS AND THEIR EXTENSIONS)

Consecutive

   RandomConsecutiveBits(n, a, b) : RngIntElt, RngIntElt -> RngIntElt

Consistency

   Consistency(~P: parameters) : Process(pQuot) ->

Consistent

   IsConsistent(G) : GrpGPC -> BoolElt
   IsConsistent(G) : GrpPC -> BoolElt
   IsConsistent(A, w) : ModMatRngElt, ModTupRng -> BoolElt, ModTupRngElt, ModTupRng
   IsConsistent(A, W) : ModMatRngElt, [ ModTupRng ] -> BoolElt, [ ModTupRngElt ], ModTupRng
   IsConsistent(A, W) : Mtrx, Mtrx -> BoolElt, Mtrx, ModTupRng
   IsConsistent(A, Q) : Mtrx, [ ModTupRng ] -> BoolElt, [ ModTupRngElt ], ModTupRng

Consta

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

ConstaCyclicCode

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

Constant

   DefiningConstantField(F) : FldFun -> Rng
   ConstantField(F) : FldFun -> Rng
   ConstantMap(X,Y,p) : Sch,Sch,Pt -> MapSch
   ConstantWords(C, i) : Code, RngIntElt -> { ModTupFldElt }
   DegreeOfExactConstantField(m) : DivFunElt -> RngIntElt
   DegreeOfExactConstantField(m, U) : DivFunElt, GrpAb -> RngIntElt
   DimensionOfExactConstantField(F) : FldFun -> RngIntElt
   ExactConstantField(F) : FldFunG -> Rng, Map
   HeightConstant(J: parameters) : JacHyp -> FldPrElt, FldPrElt
   IsConstant(a) : FldFunElt -> BoolElt, RngElt
   IsZero(I) : Map -> BoolElt
   LieConstant_epsilon( R, r, s ) : RootDtm, RngIntElt, RngIntElt -> RngIntElt
   LieConstant_eta( R, r, s ) : RootDtm, RngIntElt, RngIntElt -> RngIntElt
   LieConstant_N( R, r, s ) : RootDtm, RngIntElt, RngIntElt -> RngIntElt
   LieConstant_p( R, r, s ) : RootDtm, RngIntElt, RngIntElt -> RngIntElt
   LieConstant_q( R, r, s ) : RootDtm, RngIntElt, RngIntElt -> RngIntElt
   LieConstant_M( R, r, s, i ) : RootDtm, RngIntElt, RngIntElt, RngIntElt -> RngIntElt
   LieConstant_C( R, i, j, r, s ) : RootDtm, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> RngIntElt
   NumberOfConstantWords(C, i) : Code, RngIntElt -> RngIntElt
   StructureConstant(G, i, j, k) : Grp, RngIntElt, RngIntElt, RngIntElt -> RngIntElt


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