Subindex: <B><B>shortest</B> .. Simple</B>

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

Subindex: shortest .. Simple

shortest

Distances, Shortest Paths and Minimum Weight Trees (MULTIGRAPHS)
Shortest and Closest Vectors (LATTICES)

shortest-closest

Shortest and Closest Vectors (LATTICES)

shortest-paths

Distances, Shortest Paths and Minimum Weight Trees (MULTIGRAPHS)

ShortestPath

ShortestPath(u, v : parameters) : GrphVert, GrphVert -> Eseq
Path(u, v : parameters) : GrphVert, GrphVert -> Eseq

ShortestPaths

ShortestPaths(u : parameters) : GrphVert -> Eseq
Paths(u : parameters) : GrphVert -> Eseq

ShortestVectors

ShortestVectors(L) : Lat -> [ LatElt ], RngElt

ShortestVectorsMatrix

ShortestVectorsMatrix(L) : Lat -> ModMatRngElt

ShortVectors

ShortVectors(L, u) : Lat, RngElt -> [ <LatElt, RngElt> ]

ShortVectorsMatrix

ShortVectorsMatrix(L, u) : Lat, RngElt -> ModMatRngElt

ShortVectorsProcess

ShortVectorsProcess(L, u) : Lat, RngElt -> LatEnumProc

Show

   ShowIdentifiers() : ->
   ShowMemoryUsage() : ->
   ShowOptions(~P : parameters) : Process(Tietze) ->
   ShowPrevious() : ->
   ShowPrevious(i) : RngIntElt ->
   ShowValues() : ->

ShowIdentifiers

ShowIdentifiers() : ->

ShowMemoryUsage

ShowMemoryUsage() : ->

ShowOptions

ShowOptions(~P : parameters) : Process(Tietze) ->

ShowPrevious

ShowPrevious() : ->
ShowPrevious(i) : RngIntElt ->

ShowValues

ShowValues() : ->

Shrikhande

   ShrikhandeGraph() : -> GrphUnd
   GewirtzGraph() : -> GrphUnd
   ClebschGraph() : -> GrphUnd

ShrikhandeGraph

   ShrikhandeGraph() : -> GrphUnd
   GewirtzGraph() : -> GrphUnd
   ClebschGraph() : -> GrphUnd

Shrinking

ShrinkingGenerator(C1, S1, C2, S2, t) : RngUPolElt, SeqEnum, RngUPolElt,SeqEnum, RngIntElt -> SeqEnum

ShrinkingGenerator

ShrinkingGenerator(C1, S1, C2, S2, t) : RngUPolElt, SeqEnum, RngUPolElt,SeqEnum, RngIntElt -> SeqEnum

Shub

   BlumBlumShubModulus(b) : RngIntElt -> RngIntElt
   BBSModulus(b) : RngIntElt -> RngIntElt
   RandomSequenceBlumBlumShub(b, t) : RngIntElt, RngIntElt -> SeqEnum
   RandomSequenceBlumBlumShub(n, s, t) : RngIntElt, RngIntElt, RngIntElt -> SeqEnum

Side

RootSide(v) : GrphVert -> GrphVert

Sided

   IsRightIdeal(I) : AlgAssVOrdIdl -> BoolElt
   IsTwoSidedIdeal(I) : AlgAssVOrdIdl -> BoolElt
   IsLeftIdeal(I) : AlgAssVOrdIdl -> BoolElt
   TwoSidedIdealClasses(S) : AlgQuatOrd -> [AlgQuatOrdIdl]

Sieve

   NFS(n, F, m1, m2) : RngIntElt, RngMPolElt, RngIntElt, RngIntElt -> RngIntElt
   NumberFieldSieve(n, F, m1, m2) : RngIntElt, RngMPolElt, RngIntElt, RngIntElt -> RngIntElt
   PolynomialSieve(F, m, J0, J1,MaxAlpha) : RngMPolElt, RngIntElt, RngIntElt, RngIntElt, FldPrElt -> List
   Sieve(K) : FldFin ->

sieving

The Sieving stage (RING OF INTEGERS)

Sigma

   ASigmaL(arguments)
   AffineSigmaLinearGroup(arguments)
   DivisorSigma(i, n) : RngIntElt, RngIntElt -> RngIntElt
   ProjectiveSigmaLinearGroup(arguments)
   ProjectiveSigmaSymplecticGroup(arguments)
   ProjectiveSigmaUnitaryGroup(arguments)

Sign

   Sign(q) : FldRatElt -> RngIntElt
   Sign(r) : FldReElt -> RngIntElt
   Sign(g) : GrpPermElt -> RngIntElt
   Sign(x) : Infty -> RngIntElt
   Sign(A) : ModAbVar -> RngIntElt
   Sign(n) : RngIntElt -> RngIntElt
   Sign(f) : RngMPolElt -> RngIntElt
   Sign(p) : RngUPolElt -> RngIntElt
   SignDecomposition(D) : DivCrvElt -> DivElt,DivElt

sign

Absolute Value and Sign (RATIONAL FIELD)

Signature

   Signature(Q) : FldRat -> RngIntElt, RngIntElt
   Signature(Z) : RngInt -> RngIntElt, RngIntElt
   Signature(O) : RngOrd -> RngIntElt, RngIntElt

signature

Signature (OVERVIEW)

Signatures

ListSignatures(C) : Cat ->

SignDecomposition

SignDecomposition(D) : DivCrvElt -> DivElt,DivElt

Signs

ExtraspecialSigns(R) : RootDtm -> []
SetExtraspecialSigns( R, s) : RootDtm, SeqEnum[RngIntElt] ->

Siksek

SiksekBound(H: parameters) : SetPtEll -> FldPrElt

SiksekBound

SiksekBound(H: parameters) : SetPtEll -> FldPrElt

Silverberg

RubinSilverbergPolynomials(n, J : parameters) : RngIntElt, RngElt -> RngElt, RngElt

Silverman

SilvermanBound(H) : SetPtEll -> FldPrElt

SilvermanBound

SilvermanBound(H) : SetPtEll -> FldPrElt

sim

a ~ b : AlgSymElt, AlgSymElt -> AlgSymElt

simgps

Database of Simple Groups: Permutations, Presentations, Conjugacy Classes, Maximal Subgroups and Sylow Subgroups (OVERVIEW)

Similar

IsSimilar(A, B) : AlgMatElt, AlgMatElt -> BoolElt, AlgMatElt
IsSimilar(a, b) : AlgMatElt, AlgMatElt -> BoolElt, AlgMatElt

Simple

   AlmostSimpleGroupDatabase() : -> DB
   IdentifyAlmostSimpleGroup(G) : GrpPerm -> Map, GrpPerm
   IrreducibleModule(B, i) : AlgBas, RngIntElt -> ModAlg
   IsEmptySimpleQuotientProcess(P) : Rec -> BoolElt
   IsSimple(A) : AlgGen -> BoolElt
   IsSimple(L) : AlgLie -> BoolElt
   IsSimple(F) : FldAlg -> BoolElt
   IsSimple(G) : GrpAb -> BoolElt
   IsSimple(G) : GrpFin -> BoolElt
   IsSimple(G) : GrpGPC -> BoolElt
   IsSimple(G) : GrphMult -> BoolElt
   IsSimple(G) : GrpLie -> BoolElt
   IsSimple(G) : GrpMat -> BoolElt
   IsSimple(G) : GrpPC -> BoolElt
   IsSimple(G) : GrpPerm -> BoolElt
   IsSimple(D) : Inc -> BoolElt
   IsSimple(A) : ModAbVar -> BoolElt
   IsSimple(u: parameters) : GrpBrdElt -> BoolElt
   NameSimple(G) : GrpPerm -> <RngIntElt, RngIntElt, RngIntElt>
   NextSimpleQuotient(~P) : Rec ->
   NumberOfPrimitiveGroups(d) : RngIntElt -> RngIntElt
   PossibleSimpleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
   PresentationOfSimpleGroup("Sz", q) : RngIntElt -> GrpFP, HomGrp
   RelativeRoots(R) : RootDtm -> SetIndx
   SimpleCanonicalDissidentPoints(C) : GRCrvS -> SeqEnum
   SimpleCohomologyDimensions(M) : ModAlg -> SeqEnum
   SimpleEpimorphisms(P) : Rec -> SeqEnum, Tup
   SimpleExtension(F) : FldAlg -> FldAlg
   SimpleGroupName(G : parameters): GrpMat -> BoolElt, List
   SimpleGroupOfLieType(X, n, k) : MonStgElt, RngIntElt, Rng -> GrpLie
   SimpleGroupOfLieType(X, n, q) : MonStgElt, RngIntElt, RngIntElt -> GrpLie
   SimpleHomologyDimensions(M) : ModAlg -> SeqEnum
   SimpleLieAlgebra(X, n, k) : MonStgElt, RngIntElt, Rng -> AlgLie
   SimpleOrders(W) : GrpMat -> [RngIntElt]
   SimpleQuotientAlgebras(A) : AlgMat -> Rec
   SimpleQuotientProcess(F, deg1, deg2, ord1, ord2: parameters) : GrpFP, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> Rec
   SimpleQuotients(F, deg1, deg2, ord1, ord2: parameters) : GrpFP, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> List
   SimpleReflectionMatrices(W) : GrpMat -> [AlgMatElt]
   SimpleReflectionMatrices(W) : GrpPermCox -> []
   SimpleReflectionMatrices(R) : RootDtm -> []
   SimpleReflectionMatrices(R) : RootSys -> []
   SimpleReflectionPermutations(W) : GrpMat -> []
   SimpleReflectionPermutations(R) : RootDtm -> []
   SimpleReflectionPermutations(R) : RootSys -> []
   SimpleReflections(W) : GrpPermCox -> [GrpPermElt]
   SimpleRoots(G) : GrpLie -> Mtrx
   SimpleRoots(W) : GrpMat -> Mtrx
   SimpleRoots(W) : GrpPermCox -> Mtrx
   SimpleRoots(R) : RootStr -> Mtrx
   SimpleRoots(R) : RootSys -> Mtrx
   SimpleSubgroups(G: parameters) : GrpFin -> [ rec< Grp, RngIntElt, RngIntElt, GrpFP> ]
   SimpleSubgroups(G: parameters) : GrpPerm -> [ rec< GrpPerm, RngIntElt, RngIntElt, GrpFP> ]

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