The relaxation normal form of braids is regular - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Algebra and Computation Année : 2017

The relaxation normal form of braids is regular

Résumé

Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm. We study here this relaxation algorithm and the associated normal form. We prove that this normal form is regular and prefix-closed. We provide an effective construction of a deterministic automaton that recognizes this normal form.
Fichier principal
Vignette du fichier
1507.03248.pdf (677.47 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04323355 , version 1 (15-03-2024)

Identifiants

Citer

Vincent Jugé. The relaxation normal form of braids is regular. International Journal of Algebra and Computation, 2017, 27 (01), pp.61-105. ⟨10.1142/S0218196717500059⟩. ⟨hal-04323355⟩
5 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More