Add to ORKGIn this paper, the main idea is to present the solvability of the word problem of pure virtual braid groups by using Grobner-Shirshov basis theory.Key words: Decision problems, word problem, pure virtual braid group, Grobner-Shirshov basis
Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise...
AbstractOne of the most interesting questions about a group is whether its word problem can be solve...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
AbstractA new presentation of then-string braid groupBnis studied. Using it, a new solution to the w...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise...
AbstractOne of the most interesting questions about a group is whether its word problem can be solve...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
AbstractA new presentation of then-string braid groupBnis studied. Using it, a new solution to the w...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise...
AbstractOne of the most interesting questions about a group is whether its word problem can be solve...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...