Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 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
Full-text PDF (134 kB)
References:
PDF
HTML
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.
Received July 11, 2006, published September 17, 2006
Bibliographic databases:
Document Type: Article
UDC: 512.5
MSC: 20F36, 20F38, 20M05
Language: English
Citation: V. Vershinin, “Braids: generalizations, presentations and algorithmic properties”, Sib. Èlektron. Mat. Izv., 3 (2006), 338–341
Citation in format AMSBIB
\Bibitem{Ver06}
\by V.~Vershinin
\paper Braids: generalizations, presentations and algorithmic properties
\jour Sib. \`Elektron. Mat. Izv.
\yr 2006
\vol 3
\pages 338--341
\mathnet{http://mi.mathnet.ru/semr209}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2276039}
\zmath{https://zbmath.org/?q=an:1118.20302}
Linking options:
  • https://www.mathnet.ru/eng/semr209
  • https://www.mathnet.ru/eng/semr/v3/p338
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025