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

Subindex: poset-element  ..  Power


poset-element

   Operations on Poset Elements (GROUPS)

poset-operation

   Operations on Subgroup Class Posets (GROUPS)

Position

   Position(s, t) : MonStgElt, MonStgElt -> RngIntElt
   Index(s, t) : MonStgElt, MonStgElt -> RngIntElt
   Index(S, x) : SeqEnum, Elt -> RngIntElt
   Index(S, x) : SetIndx, Elt -> RngIntElt
   PlaceEnumPosition(R) : PlcEnum -> [RngIntElt]
   RootPosition(G, v) : GrpLie, . -> {@@}
   RootPosition(W, v) : GrpMat, . -> {@@}
   RootPosition(W, v) : GrpPermCox, . -> {@@}
   RootPosition(R, v) : RootStr, . -> {@@}
   RootPosition(R, v) : RootSys, . -> {@@}

Positions

   IdempotentPositions(B) : AlgBas -> SeqEnum

Positive

   PositiveGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   NegativeGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   ZeroGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   GammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   IsEffective(D) : DivCrvElt -> BoolElt
   IsPositive(W, r) : GrpPermCox, RngIntElt -> BoolElt
   IsPositive(R, r) : RootStr, RngIntElt -> BoolElt
   IsPositive(R, r) : RootSys, RngIntElt -> BoolElt
   IsPositiveDefinite(F) : ModMatRngElt -> BoolElt
   IsPositiveSemiDefinite(F) : ModMatRngElt -> BoolElt
   MinimalElementConjugatingToPositive(x, s: parameters) : GrpBrdElt, GrpBrdElt -> GrpBrdElt
   NumberOfPositiveRoots(C) : AlgMatElt -> RngIntElt
   NumberOfPositiveRoots(W) : GrpFPCox -> RngIntElt
   NumberOfPositiveRoots(G) : GrpLie -> RngIntElt
   NumberOfPositiveRoots(W) : GrpMat -> RngIntElt
   NumberOfPositiveRoots(W) : GrpPermCox -> RngIntElt
   NumberOfPositiveRoots(N) : MonStgElt -> .
   NumberOfPositiveRoots(R) : RootStr -> RngIntElt
   NumberOfPositiveRoots(R) : RootSys -> RngIntElt
   PositiveConjugates(u: parameters) : GrpBrdElt -> SetIndx
   PositiveConjugatesProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc
   PositiveDefiniteForm(G) : GrpMat -> AlgMatElt
   PositiveRoots(G) : GrpLie -> {@@}
   PositiveRoots(W) : GrpMat -> {@@}
   PositiveRoots(W) : GrpPermCox -> {@@}
   PositiveRoots(R) : RootStr -> {@@}
   PositiveRoots(R) : RootSys -> {@@}
   PositiveRootsPerm(U) : AlgQUE -> SeqEnum
   PositiveSum(m, i) : Map, RngIntElt -> FldReElt
   RelativeRoots(R) : RootDtm -> SetIndx

positive

   Simple and Positive Roots (ROOT DATA)
   Simple and Positive Roots (ROOT SYSTEMS)
   The Coxeter Group (ROOT SYSTEMS)

positive-simple-roots

   Simple and Positive Roots (ROOT DATA)
   Simple and Positive Roots (ROOT SYSTEMS)
   The Coxeter Group (ROOT SYSTEMS)

PositiveConjugates

   PositiveConjugates(u: parameters) : GrpBrdElt -> SetIndx

PositiveConjugatesProcess

   PositiveConjugatesProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc

PositiveCoroots

   PositiveCoroots(G) : GrpLie -> {@@}
   PositiveRoots(G) : GrpLie -> {@@}
   PositiveRoots(W) : GrpMat -> {@@}
   PositiveRoots(W) : GrpPermCox -> {@@}
   PositiveRoots(R) : RootStr -> {@@}
   PositiveRoots(R) : RootSys -> {@@}

PositiveDefiniteForm

   PositiveDefiniteForm(G) : GrpMat -> AlgMatElt
   Lat_PositiveDefiniteForm (Example H66E22)

PositiveGammaOrbitsOnRoots

   PositiveGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   NegativeGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   ZeroGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]
   GammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

PositiveRelativeRoots

   PositiveRelativeRoots(R) : RootDtm -> SetIndx
   NegativeRelativeRoots(R) : RootDtm -> SetIndx
   SimpleRelativeRoots(R) : RootDtm -> SetIndx
   RelativeRoots(R) : RootDtm -> SetIndx

PositiveRoots

   PositiveCoroots(G) : GrpLie -> {@@}
   PositiveRoots(G) : GrpLie -> {@@}
   PositiveRoots(W) : GrpMat -> {@@}
   PositiveRoots(W) : GrpPermCox -> {@@}
   PositiveRoots(R) : RootStr -> {@@}
   PositiveRoots(R) : RootSys -> {@@}

PositiveRootsPerm

   PositiveRootsPerm(U) : AlgQUE -> SeqEnum

PositiveSum

   PositiveSum(m, i) : Map, RngIntElt -> FldReElt

Possible

   PossibleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
   PossibleSimpleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum

PossibleCanonicalDissidentPoints

   PossibleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum

PossibleSimpleCanonicalDissidentPoints

   PossibleSimpleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum

Power

   CartesianPower(R, k) : Str, RngIntElt -> SetCart
   ClassPowerCharacter(x, j) : AlgChtrElt, RngIntElt -> AlgChtrElt
   DecomposeExteriorPower(D, n, w) : RootDtm, RngIntElt, [ ] -> [ ModTupRngElt ], [ RngIntElt ]
   DecomposeSymmetricPower(D, n, w) : RootDtm, RngIntElt, [ ] -> [ ModTupRngElt ], [ RngIntElt ]
   ElementaryToPowerSumMatrix(n): RngIntElt -> AlgMatElt
   EvaluateByPowerSeries(m, P) : MapSch, Pt -> Pt
   ExteriorPower(a,r) : AlgMat, RngIntElt -> AlgMatElt
   ExteriorPower(V, n) : ModAlg, RngIntElt -> ModAlg, Map
   HasHomogeneousBasis(A): AlgSym -> BoolElt
   HomogeneousToPowerSumMatrix(n): RngIntElt -> AlgMatElt
   IsPower(a, n) : FldACElt, RngIntElt -> BoolElt, FldACElt
   IsPower(a, k) : FldAlgElt, RngIntElt -> BoolElt, FldAlgElt
   IsPower(a, n) : FldFinElt, RngIntElt -> BoolElt, FldFinElt
   IsPower(I, n) : RngFunOrdIdl, RngIntElt -> BoolElt, RngFunOrdIdl
   IsPower(n) : RngIntElt -> BoolElt
   IsPower(n, k) : RngIntElt -> BoolElt
   IsPower(w, n) : RngOrdElt, RngIntElt -> BoolElt, RngOrdElt
   IsPower(I, k) : RngOrdFracIdl, RngIntElt -> BoolElt, RngOrdFracIdl
   IsPower(x, n) : RngPadElt, RngIntElt -> BoolElt, RngPadElt
   IsPrimePower(n) : RngIntElt -> BoolElt, RngIntElt, RngIntElt
   KeepPrimePower(SQP, p) : SQProc, RngIntElt -> SeqEnum
   LazyPowerSeriesRing(C, n) : Rng, RngIntElt -> RngPowLaz
   MonomialToPowerSumMatrix(n): RngIntElt -> AlgMatElt
   PowerFormalSet(R) : Struct -> PowSetIndx
   PowerGroup(G) : GrpPC -> PowerGroup
   PowerIdeal(R) : Rng -> PowIdl
   PowerIndexedSet(R) : Struct -> PowSetIndx
   PowerMap(G) : GrpAb -> Map
   PowerMap(G) : GrpFin -> Map
   PowerMap(G) : GrpMat -> Map
   PowerMap(G) : GrpPC -> Map
   PowerMap(G) : GrpPerm -> Map
   PowerMultiset(R) : Struct -> PowSetMulti
   PowerPolynomial(f,n) : RngUPolElt, RngIntElt -> RngUPolElt
   PowerRelation(r, k: parameters) : FldReElt, RngIntElt -> RngUPolElt
   PowerResidueCode(K, n, p) : FldFin, RngIntElt, RngIntElt -> Code
   PowerSequence(R) : Struct -> PowSeqEnum
   PowerSeriesRing(R) : Rng -> RngSerPow
   PowerSet(R) : Struct -> PowSetEnum
   PowerSumToElementaryMatrix(n): RngIntElt -> AlgMatElt
   PowerSumToHomogeneousMatrix(n): RngIntElt -> AlgMatElt
   PowerSumToMonomialMatrix(n): RngIntElt -> AlgMatElt
   PowerSumToSchurMatrix(n): RngIntElt -> AlgMatElt
   PrimePowerRepresentation(x, k, a) : FldFunGElt, RngIntElt, FldFunGElt -> SeqEnum
   SchurToPowerSumMatrix(n): RngIntElt -> AlgMatElt
   SetPowerPrinting(F, l) : FldFin, BoolElt ->
   SymmetricFunctionAlgebraPower(R) : Rng -> AlgSym
   SymmetricPower(a,r) : AlgMatElt, RngIntElt -> AlgMatElt
   SymmetricPower(V, n) : ModAlg, RngIntElt -> ModAlg, Map
   SymmetricPower(L, m) : RngDiffOpElt, RngIntElt -> RngDiffOpElt
   TensorPower(M, n) : ModGrp, RngIntElt -> ModGrp
   f ^ n : QuadBinElt, RngIntElt -> QuadBinElt
   qEigenform(M, prec) : ModSym, RngIntElt -> RngSerPowElt
   qExpansion(f) : ModFrmElt -> RngSerPowElt


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