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

Subindex: word-access  ..  WreathProduct


word-access

   Access Functions for Words (FINITELY PRESENTED GROUPS)

word-arithmetic

   Arithmetic Operators for Words (FINITELY PRESENTED GROUPS)

word-construction

   Construction of Words (FINITELY PRESENTED GROUPS)

word-group

   Permutations as Words (PERMUTATION GROUPS)

WordAcceptor

   WordAcceptor(G) : GrpAtc -> Rec

WordAcceptorSize

   WordAcceptorSize(G) : GrpAtc -> RngIntElt, RngIntElt

WordAccess

   GrpFP_1_WordAccess (Example H70E2)

WordArithmetic

   GrpCox_WordArithmetic (Example H98E13)

WordDifferenceAutomaton

   WordDifferenceAutomaton(G) : GrpAtc -> Rec

WordDifferences

   WordDifferences(G) : GrpAtc -> SeqEnum

WordDifferenceSize

   WordDifferenceSize(G) : GrpAtc -> RngIntElt, RngIntElt

WordGroup

   WordGroup(G) : GrpMat -> GrpSLP, Map
   WordGroup(G) : GrpPerm -> GrpBB, Map

WordInStrongGenerators

   WordInStrongGenerators(H, x) : GrpPerm, GrpPermElt -> GrpFPElt

WordMap

   WordMap(G) : GrpMatUnip -> Map

WordOps

   GrpFP_2_WordOps (Example H71E2)

WordProblem

   WordProblem(A, x) : AlgMat -> BoolElt, AlgFrElt

WordProblemData

   WordProblemData(A) : AlgMat -> List

Words

   ConstantWords(C, i) : Code, RngIntElt -> { ModTupFldElt }
   GeneratingWords(G, H) : GrpFP, GrpFP -> { GrpFPElt }
   MinimumWords(C) : Code -> { ModTupFldElt }
   NumberOfConstantWords(C, i) : Code, RngIntElt -> RngIntElt
   NumberOfWords(C, w) : Code, RngIntElt -> RngIntElt
   NumberOfWords(C, w) : Code, RngIntElt -> RngIntElt
   RandomProcess(G) : GrpFin -> Process
   ReflectionWords(W) : GrpMat -> []
   ReflectionWords(W) : GrpPermCox -> []
   ReflectionWords(R) : RootDtm -> []
   ReflectionWords(R) : RootSys -> []
   SubcodeWordsOfWeight(C, S) : Code, { RngIntElt } -> Code
   SubcodeWordsOfWeight(C, w) : CodeAdd, RngIntElt -> CodeAdd
   SubcodeWordsOfWeight(C, S) : CodeAdd, { RngIntElt } -> CodeAdd
   TransversalWords(W, H) : GrpPermCox, GrpPermCox -> @ @
   Words(C, w: parameters) : Code, RngIntElt -> { ModTupFldElt }
   Words(C, w: parameters) : Code, RngIntElt -> { ModTupFldElt }
   WordsOfBoundedLeeWeight(C, l, u) : Code, RngIntElt, RngIntElt -> SetEnum
   WordsOfBoundedWeight(C, l, u: parameters) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
   WordsOfBoundedWeight(C, l, u: parameters) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
   WordsOfLeeWeight(C, w) : Code, RngIntElt -> SetEnum
   CodeFld_Words (Example H152E23)
   GrpAtc_Words (Example H75E7)
   GrpFP_1_Words (Example H70E3)
   GrpRWS_Words (Example H74E7)
   MonRWS_Words (Example H78E9)

words

   Low Level Operations on Words (FINITELY PRESENTED GROUPS: ADVANCED)
   Matrices as Words (MATRIX GROUPS OVER GENERAL RINGS)
   Solving the Word Problem (MATRIX ALGEBRAS)
   Words (ADDITIVE CODES)
   Words (LINEAR CODES OVER FINITE FIELDS)
   Words (PARTITIONS, WORDS AND YOUNG TABLEAUX)

WordsOfBoundedLeeWeight

   WordsOfBoundedLeeWeight(C, l, u) : Code, RngIntElt, RngIntElt -> SetEnum

WordsOfBoundedWeight

   WordsOfBoundedWeight(C, l, u: parameters) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
   WordsOfBoundedWeight(C, l, u: parameters) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }

WordsOfLeeWeight

   WordsOfLeeWeight(C, w) : Code, RngIntElt -> SetEnum

WordStrip

   WordStrip(H, x) : GrpPerm, GrpPermElt -> BoolElt, GrpFPElt, RngIntElt

WordToSequence

   ElementToSequence(u: parameters) : GrpBrdElt -> SeqEnum
   Eltseq(u: parameters) : GrpBrdElt -> SeqEnum
   WordToSequence(u: parameters) : GrpBrdElt -> SeqEnum

WordToTableau

   WordToTableau(w) : MonOrdElt -> Tbl

workspace

   Saving and Restoring Workspaces (INPUT AND OUTPUT)

world

   The World of Rings (INTRODUCTION TO RINGS [BASIC RINGS])

WPRI

   IsWPRI(C) : CosetGeom -> BoolElt
   IsWeaklyPrimitive(C) : CosetGeom -> BoolElt

WPS

   FanOfWPS(W) : SeqEnum -> TorFan

Wreath

   IsWreathProduct(G) : GrpPerm -> BoolElt, GrpPerm, GrpPerm, GrpPerm
   PrimitiveWreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm
   PrimitiveWreathProduct(Q) : [ GrpPerm ] -> GrpPerm
   TensorWreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat
   WreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat
   WreathProduct(G, H) : GrpPC, GrpPC -> GrpPC
   WreathProduct(G, H, f) : GrpPC, GrpPC, Map -> GrpPC
   WreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm, SeqEnum[Map], Map, Map
   WreathProduct(G, B) : GrpPerm, GSet -> GrpPerm, GrpPerm, GrpPerm
   WreathProduct(B) : GSet -> GrpPerm, GrpPerm, GrpPerm
   WreathProduct(Q) : [ GrpPerm ] -> GrpPerm

WreathProduct

   WreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat
   WreathProduct(G, H) : GrpPC, GrpPC -> GrpPC
   WreathProduct(G, H, f) : GrpPC, GrpPC, Map -> GrpPC
   WreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm, SeqEnum[Map], Map, Map
   WreathProduct(G, B) : GrpPerm, GSet -> GrpPerm, GrpPerm, GrpPerm
   WreathProduct(B) : GSet -> GrpPerm, GrpPerm, GrpPerm
   WreathProduct(Q) : [ GrpPerm ] -> GrpPerm

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

Version: V2.19 of Mon Dec 17 14:40:36 EST 2012