Braid
A braid in Artin's presentation:
Braid(strands, word)the braidBraidPermutation(braid)the image in the symmetric group — forget which strand went overBraidWrithe(braid)the exponent sum, i.e. the abelianisation TorusBraid(p, q)Details
- Relations:
for , and - Adding
gives the symmetric group, which is why surjects onto - Two different words can name the same braid; nothing here solves the word problem, so only invariants are computed
- `BraidComponents` counts the permutation's cycles — the closure is a knot exactly when it is an
-cycle - An
word from the modular group is accepted anywhere a braid is, via its Lorenz braid
Examples
See also: AlexanderPolynomial, LorenzBraid, SeifertGenus