AbstractWe describe a new method for comparing braid words which relies both on the automatic structure of the braid groups and on the existence of a linear ordering on braids. This syntactical algorithm is a direct generalization of the classical words reduction used in the description of free groups, and is more efficient in practice than all previously known methods
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
Abstract. We implement various computations in the braid groups via practically efficient and theore...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
AbstractWe describe a new method for comparing braid words which relies both on the automatic struct...
AbstractOne of the most interesting questions about a group is whether its word problem can be solve...
Abstract. We prove the existence of an algorithm which solves the reducibility problem in braid grou...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
AbstractWe investigate the three-strand positive braid monoid. We propose a syntactical linear time ...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
The linear ordering of braids, which was first discovered using results of self-distributive al-gebr...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
Abstract. We implement various computations in the braid groups via practically efficient and theore...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
AbstractWe describe a new method for comparing braid words which relies both on the automatic struct...
AbstractOne of the most interesting questions about a group is whether its word problem can be solve...
Abstract. We prove the existence of an algorithm which solves the reducibility problem in braid grou...
In this paper, we present Artin’s original solution to the word\ud problem. We begin with a quick re...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
AbstractWe investigate the three-strand positive braid monoid. We propose a syntactical linear time ...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
The linear ordering of braids, which was first discovered using results of self-distributive al-gebr...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
International audienceWe show a simple and easily implementable solution to the word problem for vir...
Abstract. We implement various computations in the braid groups via practically efficient and theore...
DOI
Add to ORKG