[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: braid-groups-arithmetic .. Bruhat
Arithmetic Operators and Functions for Elements (BRAID GROUPS)
Boolean Predicates for Elements (BRAID GROUPS)
Ngens(B) : GrpBrd -> RngIntElt
Constructing and Accessing Braid Groups (BRAID GROUPS)
Creating Elements of a Braid Group (BRAID GROUPS)
Working with Elements of a Braid Group (BRAID GROUPS)
Accessing Information (BRAID GROUPS)
Introduction (BRAID GROUPS)
Conjugacy Testing and Conjugacy Search (BRAID GROUPS)
Computing the Class Invariants (BRAID GROUPS)
Conjugacy Testing and Conjugacy Search (BRAID GROUPS)
Definition of the Class Invariants (BRAID GROUPS)
Representing Elements of a Braid Group (BRAID GROUPS)
Representation Used for Group Operations (BRAID GROUPS)
Automatic Conversions (BRAID GROUPS)
Default Presentations (BRAID GROUPS)
Printing of Elements (BRAID GROUPS)
Lattice Structure and Simple Elements (BRAID GROUPS)
Mixed Canonical Form and Lattice Operations (BRAID GROUPS)
Normal Form for Elements of a Braid Group (BRAID GROUPS)
Lattice Operations (BRAID GROUPS)
Computing Minimal Simple Elements (BRAID GROUPS)
Computing Normal Forms of Elements (BRAID GROUPS)
Invariants of Conjugacy Classes (BRAID GROUPS)
Computing Class Invariants Interactively (BRAID GROUPS)
BraidGroup(GrpFP, n) : Cat, RngIntElt -> GrpFP
BraidGroup(W) : GrpFPCox -> GrpFP, Map
BraidGroup(n: parameters) : RngIntElt -> GrpBrd
GrpCox_BraidGroups (Example H98E31)
Branch(ToGrp, D, M) : RootDtm, LieRepDec, AlgMatElt -> LieRepDec
Branch(FromGrp, ToGrp, v, M) : RootDtm, RootDtm, ModTupRngElt, AlgMatElt -> LieRepDec
BranchVertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
LieReps_BranchCollect (Example H104E11)
LieReps_BranchCollect (Example H104E8)
BranchVertexPath(u,v) : GrphVert,GrphVert -> SeqEnum
BrandtModule(A) : AlgQuatOrd -> ModBrdt
BrandtModule(M, N) : AlgQuatOrd, RngElt -> ModBrdt
BrandtModule(M) : ModSS -> ModBrdt
BrandtModule(D) : RngIntElt -> ModBrdt
BrandtModuleDimension(D, N) : RngElt, RngElt -> RngIntElt
BrandtModuleDimension(D, N) : RngIntElt, RngIntElt -> RngIntElt
UsesBrandt(M) : ModSS -> BoolElt
BRANDT MODULES
BRANDT MODULES
BrandtModule(A) : AlgQuatOrd -> ModBrdt
BrandtModule(M, N) : AlgQuatOrd, RngElt -> ModBrdt
BrandtModule(M) : ModSS -> ModBrdt
BrandtModule(D) : RngIntElt -> ModBrdt
BrandtModuleDimension(D, N) : RngElt, RngElt -> RngIntElt
BrandtModuleDimensionOfNewSubspace(D, N) : RngElt, RngElt -> RngIntElt
BrandtModule(M, N) : AlgQuatOrd, RngElt -> ModBrdt
BrandtModuleDimension(D, N) : RngElt, RngElt -> RngIntElt
BrandtModuleDimension(D, N) : RngIntElt, RngIntElt -> RngIntElt
BrandtModuleDimensionOfNewSubspace(D, N) : RngElt, RngElt -> RngIntElt
BrandtModule(M, N) : AlgQuatOrd, RngElt -> ModBrdt
BrandtModuleDimension(D, N) : RngElt, RngElt -> RngIntElt
BrauerCharacter(x, p) : AlgChtrElt, RngIntElt -> AlgChtrElt
BrauerClass(M) : ModSym -> SeqEnum
Brauer Characters (CHARACTERS OF FINITE GROUPS)
Chtr_brauer (Example H91E6)
Brauer Characters (CHARACTERS OF FINITE GROUPS)
BrauerCharacter(x, p) : AlgChtrElt, RngIntElt -> AlgChtrElt
BrauerClass(M) : ModSym -> SeqEnum
BravaisGroup(G) : GrpMat[RngInt] -> GrpMat
IsBravaisEquivalent(G, H) : GrpMat[RngInt], GrpMat[RngInt] -> BoolElt, GrpMatElt
BravaisGroup(G) : GrpMat[RngInt] -> GrpMat
BFSTree(u) : GrphVert -> Grph
BreadthFirstSearchTree(u) : GrphVert -> Grph, GrphVertSet, GrphEdgeSet
BreadthFirstSearchTree(u) : GrphVert -> GrphMult, GrphVertSet, GrphEdgeSet
BFSTree(u) : GrphVert -> Grph
BreadthFirstSearchTree(u) : GrphVert -> Grph, GrphVertSet, GrphEdgeSet
BreadthFirstSearchTree(u) : GrphVert -> GrphMult, GrphVertSet, GrphEdgeSet
Early Exit from Iterative Statements (STATEMENTS AND EXPRESSIONS)
State_break (Example H1E16)
LeeBrickellsAttack(C, v, e, p) : Code, ModTupFldElt, RngIntElt, RngIntElt -> ModTupFldElt
GetHelpExternalBrowser() : -> MonStgElt, MonStgElt
SetHelpExternalBrowser(S, T) : MonStgElt, MonStgElt ->
SetHelpUseExternalBrowser(b) : BoolElt ->
Internal Help Browser (ENVIRONMENT AND OPTIONS)
Bruhat(g) : GrpLieElt -> GrpLieElt, GrpLieElt, GrpLieElt, GrpLieElt
BruhatDescendants(x) : GrpPermElt -> SetEnum
BruhatDescendants(X) : SetEnum -> SetEnum
BruhatLessOrEqual(x, y) : GrpPermElt, GrpPermElt -> BoolElt
GrpLie_Bruhat (Example H103E11)
[____] [____] [_____] [____] [__] [Index] [Root]
Version: V2.19 of
Wed Apr 24 15:09:57 EST 2013