Topics
braid wordBand
algorithmMusic genre
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
We present an algorithm to generate positive braids of a given length as words in Artin generators w...
AbstractWe present an algorithm to generate positive braids of a given length as words in Artin gene...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
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...
In this paper, the main idea is to present the solvability of the word problem of pure virtual braid...
Abstract. We prove the existence of an algorithm which solves the reducibility problem in braid grou...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
AbstractAlgorithmic solutions to the conjugacy problem in the braid groups Bn,n =2, 3, 4, … were giv...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
AbstractWe describe a new method for comparing braid words which relies both on the automatic struct...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
We present an algorithm to generate positive braids of a given length as words in Artin generators w...
AbstractWe present an algorithm to generate positive braids of a given length as words in Artin gene...
11 pagesInternational audienceWe describe a new algorithm which for each braid returns a quasi-geode...
AbstractWe describe a new algorithm which for each braid returns a quasi-geodesic σ-definite word re...
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...
In this paper, the main idea is to present the solvability of the word problem of pure virtual braid...
Abstract. We prove the existence of an algorithm which solves the reducibility problem in braid grou...
ABSTRACT. We describe a new method for comparing braid words which relies both on the automatic stru...
AbstractAlgorithmic solutions to the conjugacy problem in the braid groups Bn,n =2, 3, 4, … were giv...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
AbstractWe describe a new method for comparing braid words which relies both on the automatic struct...
We give a simple naming argument for establishing lower bounds on the combinatorial distance between...
We present an algorithm to generate positive braids of a given length as words in Artin generators w...
AbstractWe present an algorithm to generate positive braids of a given length as words in Artin gene...
Add to ORKG