[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: bound .. braid-groups-introduction
Asymptotic Bounds on the Information Rate (LINEAR CODES OVER FINITE FIELDS)
Bounds (LINEAR CODES OVER FINITE FIELDS)
Bounds on the Minimum Distance (LINEAR CODES OVER FINITE FIELDS)
BoundaryMap(C, n) : ModCpx, RngIntElt -> ModMatFldElt
BoundaryMap(M) : ModSym -> ModMatFldElt
BoundaryMaps(C) : ModCpx -> List
IsBoundary(N, p) : NwtnPgon,Tup -> BoolElt
LayerBoundary(G,i,j,k) : GrpPC, RngIntElt, RngIntElt, RngIntElt -> RngIntElt
MinorBoundary(G,i,j) : GrpPC, RngIntElt, RngIntElt -> RngIntElt
NilpotentBoundary(G,i) : GrpPC, RngIntElt -> RngIntElt
BoundaryMap(C, n) : ModCpx, RngIntElt -> ModMatFldElt
BoundaryMap(M) : ModSym -> ModMatFldElt
ModSym_BoundaryMap (Example H94E13)
BoundaryMaps(C) : ModCpx -> List
OrbitActionBounded(G, T, b) : GrpMat, Elt, RngIntElt -> BoolElt, Hom(Grp), GrpPerm, GrpMat
OrbitBounded(G, y, b) : GrpMat, Elt, RngIntElt -> BoolElt, SetEnum
OrbitImageBounded(G, T, b) : GrpMat, Set, RngIntElt -> BoolElt, GrpPerm
OrbitKernelBounded(G, T, b) : GrpMat, Set, RngIntElt -> BoolElt, GrpMat
WordsOfBoundedLeeWeight(C, l, u) : Code, RngIntElt, RngIntElt -> eset
WordsOfBoundedWeight(C, l, u: parameters) : Code, RngIntElt, RngIntElt -> { ModTupFldElt }
MinimumWeightBounds(C) : Code -> RngIntElt, RngIntElt
RankBounds(H: parameters) : SetPtEll -> RngIntElt, RngIntElt
ResetMinimumWeightBounds(C) : Code ->
UnsetBounds(L) : LP ->
CrvEll_Bounds (Example H91E24)
Best Known Bounds for Linear Codes (LINEAR CODES OVER FINITE FIELDS)
Sets (OVERVIEW)
{* e_1, e_2, ..., e_n *} : Elt, ..., Elt -> SetMulti
{* *} : Null -> SetMulti
{* U | *} : Struct -> SetMulti
{* U | e_1, e_2, ..., e_m *} : Struct, Elt, ..., Elt -> SetMulti
{* e(x) : x in E | P(x) *}
{* U | e(x) : x in E | P(x) *}
{* e(x_1,...,x_k) : x_1 in E_1, ..., x_kin E_k | P(x_1, ..., x_k) *}
{* U | e(x_1,...,x_k) : x_1 in E_1, ...,x_k in E_k | P(x_1, ..., x_k) *}
(a, b) : AlgAssElt, AlgAssElt -> AlgAssElt
LieBracket(a, b) : AlgAssElt, AlgAssElt -> AlgAssElt
Expression (OVERVIEW)
Generator Assignment (OVERVIEW)
Sequences (OVERVIEW)
Sets (OVERVIEW)
BraidGroup(GrpFP, n) : Cat, RngIntElt -> GrpFP
BraidGroup( W ) : GrpFPCox -> GrpFP, Map
BraidGroup(n: parameters) : RngIntElt -> GrpBrd
PureBraidGroup( W ) : GrpFPCox -> GrpFP, Map
Accessing Information (BRAID GROUPS)
Arithmetic Operators and Functions for Elements (BRAID GROUPS)
Automatic Conversions (BRAID GROUPS)
Boolean Predicates for Elements (BRAID GROUPS)
BRAID GROUPS
Braid Groups (COXETER GROUPS)
Computing Normal Forms of Elements (BRAID GROUPS)
Computing Positive Conjugates and Super Summit Sets Interactively (BRAID GROUPS)
Computing Super Summit Sets (BRAID GROUPS)
Constructing and Accessing Braid Groups (BRAID GROUPS)
Creating Elements of a Braid Group (BRAID GROUPS)
Default Presentations (BRAID GROUPS)
Introduction (BRAID GROUPS)
Lattice Operations (BRAID GROUPS)
Lattice Structure and Canonical Factors (BRAID GROUPS)
Mixed Canonical Form and Lattice Operations (BRAID GROUPS)
Normal Form for Elements of a Braid Group (BRAID GROUPS)
Positive Conjugates and Super Summit Sets (BRAID GROUPS)
Positive Conjugates, Super Summit Sets and Conjugacy Testing (BRAID GROUPS)
Printing of Elements (BRAID GROUPS)
Representation Used for Group Operations (BRAID GROUPS)
Representing Elements of a Braid Group (BRAID GROUPS)
Testing Conjugacy of Elements (BRAID GROUPS)
Working with Elements of a Braid Group (BRAID GROUPS)
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)
[____] [____] [_____] [____] [__] [Index] [Root]