[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: partial .. PathGraph
Creation of Partial Maps (MAPPINGS)
Partial Fraction Decomposition (RATIONAL FUNCTION FIELDS)
Partial Mappings (OVERVIEW)
Partial Fraction Decomposition (RATIONAL FUNCTION FIELDS)
Creation of Partial Maps (MAPPINGS)
RngInt_PartialFact (Example H39E9)
PartialFactorization(S) : [ RngIntElt ] -> [ RngIntEltFact ]
PartialFractionDecomposition(f) : FldFunRatUElt -> [ <RngUPolElt, RngIntElt, RngUPolElt> ]
FldFunRat_PartialFractionDecomposition (Example H54E3)
Partial Mappings (OVERVIEW)
PartialWeightDistribution(C, ub) : Code -> [ <RngIntElt, RngIntElt> ]
ConjugatePartition(P) : SeqEnum -> SeqEnum
DistancePartition(u) : GrphVert -> [ { GrphVert } ]
EquitablePartition(P, G) : { { GrphVert } }, GrphUnd -> { { GrphVert } }
IndexOfPartition(P) : SeqEnum -> RngIntElt
IsPartition(S) : SeqEnum -> BoolElt
IsPartitionRefined(G: parameters) : Grph -> BoolElt
MaximalPartition(G) : GrpPerm -> GSet
MinimalPartition(G: parameters) : GrpPerm -> GSet
OrbitsPartition(G) : GrphUnd -> [ { GrphVert } ]
Partition(S, p) : SeqEnum, RngIntElt -> SeqEnum(SeqEnum)
Partition(S, P) : SeqEnum, [RngIntElt] -> SeqEnum(SeqEnum)
PartitionCovers(P1, P2) : SeqEnum, SeqEnum -> BoolElt
RandomPartition(n) : RngIntElt -> SeqEnum
RestrictPartitionLength(a, n): AlgSymElt, RngIntElt -> AlgSymElt
Action on a G-invariant Partition (PERMUTATION GROUPS)
Action on a G-invariant Partition (PERMUTATION GROUPS)
PartitionCovers(P1, P2) : SeqEnum, SeqEnum -> BoolElt
AllPartitions(G) : GrpPerm -> SetEnum
MinimalPartitions(G: parameters) : GrpPerm -> [ GSet ]
NumberOfPartitions(n) : RngIntElt -> RngIntElt
NumberOfPartitions(n) : RngIntElt -> RngIntElt
Partitions(n) : RngIntElt -> [ [ RngIntElt ] ]
Partitions(n) : RngIntElt -> [ [ RngIntElt ] ]
Partitions(n, k) : RngIntElt, RngIntElt -> [ [ RngIntElt ] ]
RestrictedPartitions(n, k, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, k, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, M) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
RestrictedPartitions(n, Q) : RngIntElt, SetEnum -> [ [ RngIntElt ] ]
Tableau_Partitions (Example H115E1)
Partitions (PARTITIONS, WORDS AND YOUNG TABLEAUX)
RestrictParts(a, n): AlgSymElt, RngIntElt -> AlgSymElt
PascalTriangle(D) : Dsgn -> SeqEnum
PascalTriangle(D) : Dsgn -> SeqEnum
AllPassants(P, A) : Plane, { PlanePt } -> { PlaneLn }
ExternalLines(P, A) : Plane, { PlanePt } -> { PlaneLn }
AffinePatch(C,i) : Crv,RngIntElt -> SeqEnum
AffinePatch(X,p) : Sch,Pt -> Sch,Pt
AffinePatch(X,i) : Sch,RngIntElt -> Sch
CentredAffinePatch(S, p) : Sch, Pt -> Sch, MapSch
IsStandardAffinePatch(A) : Aff -> BoolElt, RngIntElt
RestrictionToPatch(f, Xi) : FldFunFracSchElt, Sch -> FldFracElt
RestrictionToPatch(f,j) : MapSch,RngIntElt -> MapSch
RestrictionToPatch(f,i,j) : MapSch,RngIntElt,RngIntElt -> MapSch
MAGMA_PATH
BranchVertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
DiameterPath(G) : Grph -> [GrphVert]
IsPath(G) : Grph -> BoolElt
Path(u, v : parameters) : GrphVert, GrphVert -> Eseq
PathExists(u, v : parameters) : GrphVert, GrphVert -> BoolElt, Eseq
PathGraph(n : parameters) : RngIntElt -> GrphUnd
PathTree(B, i) : AlgBas, RngIntElt -> ModRng
SetPath(s) : MonStgElt ->
VertexPath(u,v) : GrphSplVert,GrphSplVert -> SeqEnum,SeqEnum
VertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
Connectedness (GRAPHS)
Distances, Paths and Circuits in a Graph (GRAPHS)
Distances, Paths and Circuits in a Non-Weighted Graph (GRAPHS)
Distances, Paths and Circuits in a Possibly Weighted Graph (GRAPHS)
The Path Model (QUANTUM GROUPS)
Distances, Paths and Circuits in a Graph (GRAPHS)
Distances, Paths and Circuits in a Non-Weighted Graph (GRAPHS)
Distances, Paths and Circuits in a Possibly Weighted Graph (GRAPHS)
The Path Model (QUANTUM GROUPS)
PathExists(u, v : parameters) : GrphVert, GrphVert -> BoolElt, Eseq
PathGraph(n : parameters) : RngIntElt -> GrphUnd
[____] [____] [_____] [____] [__] [Index] [Root]