2001/01/29 by S. Kaplan, Kaplan, S., Mina Teicher +2
Computer Science · Mathematics · #Algebraic Geometry (math.AG) #Algebraic Topology (math.AT) #FOS: Mathematics #Group Theory (math.GR) #Mathematics, Computing, and Information Processing #Natural Language Processing Techniques #Semantic Web and Ontologies #math.AG #math.AT #math.GR
paper · pdf · doi:10.48550/arxiv.math/0101232
26 pages, 11 figures
arxiv created 2001/01/29 · openalex publication_date 2001/01/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological point of view, and thus using a new computerized representation of some elements of the fundamental group we gave a solution for its word problem. In this paper we will give an algorithm that will make it possible to transform the new presentation into a syntactic presentation. This will make it possible to computerize the group operation to sets of elements of the fundamental group, which are isomorphic to the braid group. More over we will show that it is sufficient enough to look at the syntactic presentation in order to solve the braid word problem, resulting with a better and faster braid word solution.