Groebner-Shirshov basis for the braid semigroup
L. A. Bokut, Y. Fong, W.-F. Ke, L.-S. Shiao

TL;DR
This paper introduces a Groebner-Shirshov basis for the braid semigroup, providing a new algorithm to solve the word problem for braid groups, which enhances computational approaches in algebra.
Contribution
The paper presents the first Groebner-Shirshov basis for the braid semigroup, enabling more efficient solutions to the word problem in braid theory.
Findings
Developed a Groebner-Shirshov basis for $B^+_{n+1}$
Provided a new algorithm for the word problem
Improved computational methods in braid group theory
Abstract
We found Groebner-Shirshov basis for the braid semigroup . It gives a new algorithm for the solution of the word problem for the braid semigroup and so for the braid group.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Algebraic structures and combinatorial models
