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

Subindex: ShimuraConjugates  ..  ShortVectors


ShimuraConjugates

   ShimuraConjugates(mu) : AlgAssVOrdElt -> SeqEnum

ShimuraReduceUnit

   ShimuraReduceUnit(delta, gammagens, G, D) : AlgAssVOrdElt, SeqEnum[AlgAssVOrdElt], GrpPSL2, SpcHyd -> SeqEnum

Shioda

   DiscriminantFromShiodaInvariants(JI) : SeqEnum -> RngElt
   GeometricAutomorphismGroupFromShiodaInvariants(JI) : SeqEnum -> GrpPerm
   HyperellipticCurveFromShiodaInvariants(JI) : SeqEnum[FldFin] -> CrvHyp, GrpPerm
   HyperellipticPolynomialsFromShiodaInvariants(JI) : SeqEnum -> SeqEnum, GrpPerm
   ShiodaAlgebraicInvariants(FJI) : SeqEnum -> SeqEnum
   ShiodaInvariants(C) : CrvHyp -> SeqEnum, SeqEnum
   ShiodaInvariantsEqual(V1,V2) : SeqEnum, SeqEnum -> BoolElt

shioda-inv-ex

   CrvHyp_shioda-inv-ex (Example H125E6)

shioda_invariants

   Shioda Invariants (HYPERELLIPTIC CURVES)

ShiodaAlgebraicInvariants

   ShiodaAlgebraicInvariants(FJI) : SeqEnum -> SeqEnum

ShiodaInvariants

   ShiodaInvariants(C) : CrvHyp -> SeqEnum, SeqEnum

ShiodaInvariantsEqual

   ShiodaInvariantsEqual(V1,V2) : SeqEnum, SeqEnum -> BoolElt

Shor

   CalderbankShorSteaneCode(C1, C2) : Code, Code -> CodeQuantum
   CSSCode(C1, C2) : Code, Code -> CodeQuantum

Short

   HighestShortRoot(G) : GrpLie -> LatElt
   HighestShortRoot(W) : GrpPermCox -> .
   HighestShortRoot(R) : RootStr -> .
   HighestShortRoot(R) : RootSys -> .
   IsShortExactSequence(f, g) : MapChn, MapChn -> BoolElt
   IsShortExactSequence(C) : ModCpx -> BoolElt, RngIntElt
   IsShortRoot(G, r) : GrpLie, RngIntElt -> BoolElt
   IsShortRoot(W, r) : GrpPermCox, RngIntElt -> BoolElt
   IsShortRoot(R, r) : RootStr, RngIntElt -> BoolElt
   IsShortRoot(R, r) : RootSys, RngIntElt -> BoolElt
   ShortBasis(D) : DivCrvElt -> SeqEnum
   ShortBasis(D : parameters) : DivFunElt -> [RngElt], [RngIntElt]
   ShortCosets(p, H, G) : GrpPCElt, GrpPC, GrpPC -> [GrpPCElt]
   ShortCosets(p, H, G) : GrpPermElt, GrpPerm, GrpPerm -> [GrpPermElt]
   ShortVectors(L, u) : Lat, RngElt -> [ <LatElt, RngElt> ]
   ShortVectors(G, B) : Mtrx[RngUPol], RngIntElt -> SeqEnum
   ShortVectorsMatrix(L, u) : Lat, RngElt -> ModMatRngElt
   ShortVectorsProcess(L, u) : Lat, RngElt -> LatEnumProc

short

   Short and Close Vectors (LATTICES)

short-close

   Short and Close Vectors (LATTICES)

ShortBasis

   ShortBasis(D) : DivCrvElt -> SeqEnum
   ShortBasis(D : parameters) : DivFunElt -> [RngElt], [RngIntElt]

ShortCosets

   ShortCosets(p, H, G) : GrpPCElt, GrpPC, GrpPC -> [GrpPCElt]
   ShortCosets(p, H, G) : GrpPermElt, GrpPerm, GrpPerm -> [GrpPermElt]

ShortCuts

   Mat_ShortCuts (Example H26E2)

Shortcuts

   Mat_Shortcuts (Example H26E3)

shortcuts

   Shortcuts (MATRICES)

Shorten

   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(Q, i) : CodeQuantum, RngIntElt -> CodeQuantum
   ShortenCode(Q, I) : CodeQuantum, SetEnum -> CodeQuantum

ShortenCode

   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, i) : Code, RngIntElt -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(C, S) : Code, { RngIntElt } -> Code
   ShortenCode(Q, i) : CodeQuantum, RngIntElt -> CodeQuantum
   ShortenCode(Q, I) : CodeQuantum, SetEnum -> CodeQuantum

Shortest

   AllPairsShortestPaths(G : parameters) : Grph -> SeqEnum, SeqEnum
   Path(u, v : parameters) : GrphVert, GrphVert -> Eseq
   Paths(u : parameters) : GrphVert -> Eseq
   ShortestVectors(L) : Lat -> [ LatElt ]
   ShortestVectors(G) : Mtrx[RngUPol] -> SeqEnum
   ShortestVectorsMatrix(L) : Lat -> ModMatRngElt

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 ]
   ShortestVectors(G) : Mtrx[RngUPol] -> SeqEnum

ShortestVectorsMatrix

   ShortestVectorsMatrix(L) : Lat -> ModMatRngElt

ShortVectors

   ShortVectors(L, u) : Lat, RngElt -> [ <LatElt, RngElt> ]
   ShortVectors(G, B) : Mtrx[RngUPol], RngIntElt -> SeqEnum

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

Version: V2.19 of Wed Apr 24 15:09:57 EST 2013