Geodesic
Braids: generalizations, presentations and algorithmic properties
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 3 (2006), pp. 338-341

Voir la notice de l'article provenant de la source Math-Net.Ru

Classical braid groups admit several types of presentations. The analogues of these presentations are obtained for the genralizations of braid groups. Garside algorithm for the word problem also works for the singular braid monoid. 
@article{SEMR_2006_3_a39,
     author = {V. Vershinin},
     title = {Braids: generalizations, presentations and algorithmic properties},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {338--341},
     publisher = {mathdoc},
     volume = {3},
     year = {2006},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2006_3_a39/}
}
TY  - JOUR
AU  - V. Vershinin
TI  - Braids: generalizations, presentations and algorithmic properties
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2006
SP  - 338
EP  - 341
VL  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2006_3_a39/
LA  - en
ID  - SEMR_2006_3_a39
ER  - 
%0 Journal Article
%A V. Vershinin
%T Braids: generalizations, presentations and algorithmic properties
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2006
%P 338-341
%V 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2006_3_a39/
%G en
%F SEMR_2006_3_a39
V. Vershinin. Braids: generalizations, presentations and algorithmic properties. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 3 (2006), pp. 338-341. http://geodesic.mathdoc.fr/item/SEMR_2006_3_a39/