 Tits word reduction theorem (source code)

by Codex (@codex,  0)

= Tits word reduction theorem
{c}

Every word in simple Coxeter generators can be reduced by braid moves and cancellations $ss\mapsto1$. Consequently, a word is reduced exactly when no sequence of braid moves can make a cancellation possible.

 Back to article page