[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: conjugate .. consconv-element
Conjugacy (FINITELY PRESENTED ABELIAN GROUPS)
Conjugacy (MATRIX GROUPS OVER GENERAL RINGS)
Conjugacy (PERMUTATION GROUPS)
Conjugacy (POLYCYCLIC GROUPS)
Conjugacy Classes of Elements (GROUPS)
Conjugates, Norm and Trace (RATIONAL FIELD)
Conjugates, Norm and Trace (RING OF INTEGERS)
Conjugation of Class Functions (CHARACTERS OF FINITE GROUPS)
Groups (OVERVIEW)
Conjugate(f) : QuadBinElt -> QuadBinElt
Conjugates, Norm and Trace (RATIONAL FIELD)
Conjugates, Norm and Trace (RING OF INTEGERS)
ConjugatePartition(P) : SeqEnum -> SeqEnum
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 -> [ FldComElt ]
ExcludedConjugate(P) : GrpFPCosetEnumProc -> GrpFPElt
ExcludedConjugates(V) : GrpFPCos -> { GrpFPElt }
PositiveConjugates(u: parameters) : GrpBrdElt -> SetIndx
PositiveConjugatesProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc
GrpBrd_Conjugates (Example H33E7)
Conjugates (CYCLOTOMIC FIELDS)
Conjugates (QUADRATIC FIELDS)
Conjugates, Norm and Trace (DIFFERENTIAL RINGS, FIELDS AND OPERATORS)
Conjugates, Norm and Trace (DIFFERENTIAL RINGS, FIELDS AND OPERATORS)
GrpBrd_ConjugatesProcess (Example H33E8)
MinimalElementConjugatingToSuperSummit(x, s: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
MinimalElementConjugatingToUltraSummit(x, s: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
Transport(x, s: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
MinimalElementConjugatingToPositive(x, s: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
StandardFormConjugationMatrices(A) : AlgMat -> Tup
Groups (OVERVIEW)
CharacterTableConlon(G) : GrpPC -> [ AlgChtrElt ]
Connect(v,w) : GrphResVert,GrphResVert -> GrphRes
ConnectedKernel(phi) : MapModAbVar -> ModAbVar, MapModAbVar
IsConnected(G) : GrphMultUnd -> BoolElt
IsConnected(G) : GrphUnd -> BoolElt
IsKEdgeConnected(G, k) : Grph, RngIntElt -> BoolElt
IsKEdgeConnected(G, k : parameters) : GrphMult, RngIntElt -> BoolElt
IsKVertexConnected(G, k) : Grph, RngIntElt -> BoolElt
IsKVertexConnected(G, k : parameters) : GrphMult, RngIntElt -> BoolElt
IsResiduallyConnected(X) : IncGeom -> BoolElt
IsSimplyConnected(G) : GrpLie-> BoolElt
IsSimplyConnected(R) : RootDtm -> BoolElt
IsStronglyConnected(G) : GrphDir -> BoolElt
IsStronglyConnected(G) : GrphMultDir -> BoolElt
IsWeaklyConnected(G) : GrphDir -> BoolElt
IsWeaklyConnected(G) : GrphMultDir -> BoolElt
StronglyConnectedComponents(G) : GrphDir -> [ { GrphVert } ]
StronglyConnectedComponents(G) : GrphMultDir -> [ { GrphVert } ]
ConnectedKernel(phi) : MapModAbVar -> ModAbVar, MapModAbVar
Connectedness (GRAPHS)
Connectedness (MULTIGRAPHS)
Connectedness in a Graph (GRAPHS)
Connectedness in a Multigraph (MULTIGRAPHS)
Connectedness in a Graph (GRAPHS)
Connectedness (GRAPHS)
ConnectingHomomorphism(f, g, n) : MapChn, MapChn, RngIntElt -> ModMatRngElt
ConnectingHomomorphism(f, g, n) : MapChn, MapChn, RngIntElt -> ModMatRngElt
ConnectionPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
CharacteristicPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
BerlekampMassey(S) : SeqEnum -> RngUPolElt, RngIntElt
ConnectionNumber(D, p, B) : Inc, IncPt, IncBlk -> RngIntElt
WaitForConnection(S) : IOSocket -> IOSocket
ConnectionNumber(D, p, B) : Inc, IncPt, IncBlk -> RngIntElt
ConnectionPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
CharacteristicPolynomial(S) : SeqEnum -> RngUPolElt, RngIntElt
BerlekampMassey(S) : SeqEnum -> RngUPolElt, RngIntElt
EdgeConnectivity(G) : Grph -> RngIntElt, [ GrphEdge ]
EdgeConnectivity(G : parameters) : GrphMult -> RngIntElt, [ GrphEdge ]
VertexConnectivity(G) : Grph -> RngIntElt, [ GrphVert ]
VertexConnectivity(G : parameters) : GrphMult -> RngIntElt, [ GrphVert ]
Graph_Connectivity (Example H117E14)
General Vertex and Edge Connectivity in Graphs and Digraphs (GRAPHS)
General Vertex and Edge Connectivity in Multigraphs and Multidigraphs (MULTIGRAPHS)
Element Constructions and Conversions (p-ADIC RINGS AND THEIR EXTENSIONS)
Element Constructions and Conversions (p-ADIC RINGS AND THEIR EXTENSIONS)
[____] [____] [_____] [____] [__] [Index] [Root]