Solving the Braid Word Problem Via the Fundamental Group

S. Kaplan; M. Teicher

Home/Archive/arXiv

arXiv · math/0101232

Solving the Braid Word Problem Via the Fundamental Group

S. Kaplan·M. Teicher

View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.GR math.AG math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

S. Kaplan, M. Teicher. 2001-01-29. Solving the Braid Word Problem Via the Fundamental Group. https://arxiv.org/abs/math/0101232

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Strongly Regular Graphs of Rank Four

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

math.GR↗

arXiv2026

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR↗

arXiv2026

Assouad--Nagata dimension of systolic complexes with almost flat intervals

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad--Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad--Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad--Nagata dimension.

math.GR↗