AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word representative, defined as a braid word in which the generator σi with maximal index i appears either only positively or only negatively
AbstractWe give a new algorithm to solve with cubic complexity the word problem in the braid group B...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
This is the author accepted manuscript. The final version is available from IOP Publishing via the D...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representa...
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representa...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
A braid is called quasipositive if it is a product of conjugates of standard generators of the braid...
Abstract. We prove the existence of an algorithm which solves the reducibility problem in braid grou...
In this paper, the main idea is to present the solvability of the word problem of pure virtual braid...
AbstractAlgorithmic solutions to the conjugacy problem in the braid groups Bn,n =2, 3, 4, … were giv...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
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...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
This is the author accepted manuscript. The final version is available from IOP Publishing via the D...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representa...
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representa...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
17 pages, 6 figuresWe suggest a new algorithm for finding a canonical representative of a given brai...
A braid is called quasipositive if it is a product of conjugates of standard generators of the braid...
Abstract. We prove the existence of an algorithm which solves the reducibility problem in braid grou...
In this paper, the main idea is to present the solvability of the word problem of pure virtual braid...
AbstractAlgorithmic solutions to the conjugacy problem in the braid groups Bn,n =2, 3, 4, … were giv...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
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...
. We exhibit a new quadratic time near-constant space algorithm for solving the word problem in the ...
This is the author accepted manuscript. The final version is available from IOP Publishing via the D...
DOI
Add to ORKG