Computation of the Ordinal of Braids |
| |
| Authors: | Burckel Serge |
| |
| Institution: | (1) IREMIA, Université de la Réunion, 15 Avenue René Cassin, La Réunion, France |
| |
| Abstract: | There exists a linear ordering on braids coming from left distributivity assumptions. The restriction of this order to positive braids is a wellordering. We present here some tools and an effective algorithm for the computation of the rank of any positive braid in this wellordering. |
| |
| Keywords: | algorithm braids monoids ordinal trees wellordering |
| 本文献已被 SpringerLink 等数据库收录！ |
