Braid Groups
- Introduction
- Constructing and Accessing Braid Groups
- Creating Elements of a Braid Group
Representative(B): GrpBrd → GrpBrdElt
Rep(B): GrpBrd → GrpBrdElt
Identity(B): GrpBrd → GrpBrdElt
Id(B): GrpBrd → GrpBrdElt
B ! 1: GrpBrd, RngIntElt → GrpBrdElt
FundamentalElement(B: parameters): GrpBrd → GrpBrdElt
Generators(B: parameters): GrpBrd → [ GrpBrd ]
B . i: GrpBrd, RngIntElt → GrpBrdElt
B . T: GrpBrd, Tup → GrpBrdElt
B ! [ i₁, ..., iₖ ]: GrpBrd, [ RngIntElt ] → GrpBrdElt
B ! [ T₁, ..., Tₖ ]: GrpBrd, [ Tup ] → GrpBrdElt
B ! p: GrpBrd, GrpPermElt → GrpBrdElt
B ! [ p₁, ...,pₖ ]: GrpBrd, [ GrpPermElt ] → GrpBrdElt
B ! T: GrpBrd, Tup → GrpBrdElt
IsProductOfParallelDescendingCycles(p): GrpPermElt → BoolElt
Random(B, r, s, m, n: parameters): GrpBrd, RngIntElt, RngIntElt, RngIntElt, RngIntElt → GrpBrdElt
RandomCFP(B, r, s, m, n: parameters): GrpBrd, RngIntElt, RngIntElt → GrpBrdElt
Random(B: parameters): GrpBrd → GrpBrdElt
RandomCFP(B: parameters): GrpBrd → GrpBrdElt
Random(B, m, n: parameters): GrpBrd, RngIntElt, RngIntElt → GrpBrdElt
RandomWord(B, m, n: parameters): GrpBrd, RngIntElt, RngIntElt → GrpBrdElt
RandomWord(B: parameters): GrpBrd → GrpBrdElt
Example: Constructor
- Working with Elements of a Braid Group
- Accessing Information
- Computing Normal Forms of Elements
- Arithmetic Operators and Functions for Elements
u * v: GrpBrdElt, GrpBrdElt → GrpBrdElt
u *:= v: GrpBrdElt, GrpBrdElt
u / v: GrpBrdElt, GrpBrdElt → GrpBrdElt
u /:= v: GrpBrdElt, GrpBrdElt
u ^ n: GrpBrdElt, RngIntElt → GrpBrdElt
u ^:= n: GrpBrdElt, RngIntElt
u ^ v: GrpBrdElt, GrpBrdElt → GrpBrdElt
u ^:= v: GrpBrdElt, GrpBrdElt
Inverse(u): GrpBrdElt → GrpBrdElt
Inverse(~u): GrpBrdElt
LeftConjugate(u, v): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftConjugate(~u, v): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftDiv(u, v): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftDiv(u, ~v): GrpBrdElt, GrpBrdElt → GrpBrdElt
Cycle(u: parameters): GrpBrdElt → GrpBrdElt
Cycle(~u: parameters): GrpBrdElt
Decycle(u: parameters): GrpBrdElt → GrpBrdElt
Decycle(~u: parameters): GrpBrdElt
Example: Arithmetic
- Boolean Predicates for Elements
u in B: GrpBrdElt, GrpBrd → BoolElt
u notin B: GrpBrdElt, GrpBrd → BoolElt
IsEmptyWord(u: parameters): GrpBrdElt → BoolElt
AreIdentical(u, v: parameters): GrpBrdElt, GrpBrdElt → BoolElt
IsSimple(u: parameters): GrpBrdElt → BoolElt
IsSuperSummitRepresentative(u: parameters): GrpBrdElt → BoolElt
IsUltraSummitRepresentative(u: parameters): GrpBrdElt → BoolElt
IsIdentity(u: parameters): GrpBrdElt → BoolElt
IsId(u: parameters): GrpBrdElt → BoolElt
u eq v: GrpBrdElt, GrpBrdElt → BoolElt
u ne v: GrpBrdElt, GrpBrdElt → BoolElt
u le v: GrpBrdElt, GrpBrdElt → BoolElt
IsLE(u, v: parameters): GrpBrdElt, GrpBrdElt → BoolElt
IsLe(u, v: parameters): GrpBrdElt, GrpBrdElt → BoolElt
u ge v: GrpBrdElt, GrpBrdElt → BoolElt
IsGE(u, v: parameters): GrpBrdElt, GrpBrdElt → BoolElt
IsGe(u, v: parameters): GrpBrdElt, GrpBrdElt → BoolElt
IsConjugate(u, v: parameters): GrpBrdElt, GrpBrdElt → BoolElt, GrpBrdElt
Example: Boolean
- Lattice Operations
LeftGCD(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftGcd(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftGreatestCommonDivisor(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
GCD(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
Gcd(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
GreatestCommonDivisor(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
RightGCD(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
RightGcd(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
RightGreatestCommonDivisor(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftGCD(S: parameters): Setq → GrpBrdElt
LeftGcd(S: parameters): Setq → GrpBrdElt
LeftGreatestCommonDivisor(S: parameters): Setq → GrpBrdElt
GCD(S: parameters): Setq → GrpBrdElt
Gcd(S: parameters): Setq → GrpBrdElt
GreatestCommonDivisor(S: parameters): Setq → GrpBrdElt
RightGCD(S: parameters): Setq → GrpBrdElt
RightGcd(S: parameters): Setq → GrpBrdElt
RightGreatestCommonDivisor(S: parameters): Setq → GrpBrdElt
LeftLCM(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftLcm(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftLeastCommonMultiple(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LCM(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
Lcm(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeastCommonMultiple(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
RightLCM(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
RightLcm(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
RightLeastCommonMultiple(u, v: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
LeftLCM(S: parameters): Setq → GrpBrdElt
LeftLcm(S: parameters): Setq → GrpBrdElt
LeftLeastCommonMultiple(S: parameters): Setq → GrpBrdElt
LCM(S: parameters): Setq → GrpBrdElt
Lcm(S: parameters): Setq → GrpBrdElt
LeastCommonMultiple(S: parameters): Setq → GrpBrdElt
RightLCM(S: parameters): Setq → GrpBrdElt
RightLcm(S: parameters): Setq → GrpBrdElt
RightLeastCommonMultiple(S: parameters): Setq → GrpBrdElt
Example: Boolean
- Invariants of Conjugacy Classes
PositiveConjugates(u: parameters): GrpBrdElt → SetIndx
SuperSummitRepresentative(u: parameters): GrpBrdElt → GrpBrdElt, GrpBrdElt
SuperSummitSet(u: parameters): GrpBrdElt → SetIndx
UltraSummitRepresentative(u: parameters): GrpBrdElt → GrpBrdElt, GrpBrdElt
UltraSummitSet(u: parameters): GrpBrdElt → SetIndx
Example: Conjugates
- Computing Class Invariants Interactively
- Computing Minimal Simple Elements
MinimalElementConjugatingToPositive(x, s: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
MinimalElementConjugatingToSuperSummit(x, s: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
MinimalElementConjugatingToUltraSummit(x, s: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
Transport(x, s: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
Pullback(x, s: parameters): GrpBrdElt, GrpBrdElt → GrpBrdElt
Example: Minimal Simple Elements
- Homomorphisms