`Base.:==`

— MethodBraid group equivalence, i.e. true if `a`

and `b`

represent the same group element

`BraidGroup.compress`

— MethodCompress braid `a`

by iterative reduction of garside conjugate

`BraidGroup.freesimplify!`

— MethodDo an in-place free simplificaton of a, recursively cancelling out consecutive inverses

`BraidGroup.garside_conjugate!`

— MethodConjugation with the garside element Δ, equivalent to rotating the braid 180 degrees around an horizontal axis.

`BraidGroup.ishandle`

— MethodIs `i, j`

a handle for `a`

?

`BraidGroup.main_generator`

— MethodFetch the main generator of `a`

`BraidGroup.nexthandle`

— FunctionFind next *permitted* handle of `a`

, return `0,0`

`if`

a` is already reduced

`BraidGroup.permutation`

— FunctionPermutation of strands of `a`

between the two ends of the braid

`BraidGroup.powers`

— MethodProduce an expression of `a`

in powers of generators, in the form of a Vector of tuples (generator, power)

`BraidGroup.randbraid`

— MethodRandom braid with given width and length

`BraidGroup.reduced!`

— MethodIn-place Dehornoy H-step

`BraidGroup.reduced!`

— MethodIn-place Dehornoy reduction of `a`

`BraidGroup.reduced`

— MethodDehornoy reduction of `a`

`BraidGroup.reduced_slow`

— MethodOne H-step of Dehornoy reduction of `a`

on handle `i,j`