RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive
Sib. Èlektron. Mat. Izv., 2006 Volume 3, Pages 338–341 (Mi semr209)
Short communications

Braids: generalizations, presentations and algorithmic properties

V. Vershininab

a Département des Sciences Mathématiques, Université Montpellier II, France
b Sobolev Institute of Mathematics, Novosibirsk, Russia

Abstract: 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.

UDC: 512.5

MSC: 20F36, 20F38, 20M05

Received July 11, 2006, published September 17, 2006

Language: English



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024