Search arXivSearch

arXiv · math/0101232

Solving the Braid Word Problem Via the Fundamental Group

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

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

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

Finiteness conditions on skew braces and solutions of the Yang-Baxter equation

A finite non-degenerate set-theoretic solution $(X,r)$ of the Yang-Baxter equation gives rise to a structure skew brace $B(X,r)$ that is a $λ_f$-skew brace, i.e. every element has finitely many $λ$-images, and whose additive group is $FC$. This motivates the study of finiteness conditions on skew braces. We first study the general class of $λ_f$ skew braces and the subclass where the additive group is $FC$, showing that these properties share a resemblance to finite conjugacy, having an analog of the $FC$-center and several analogous structural results. Furthermore, by passing through the structure skew brace of a solution, this property measures whether elements are contained in a finite decomposition factor, identifying a class of infinite solutions that may exhibit similar properties to finite ones. Finally, we show that for a sub skew brace where both groups have finite index, both indices need to coincide and that such a sub skew brace contains a strong left ideal of finite index.

math.GR

Non-uniform exponential growth and the decay of growth rates in growing dimensions

We provide the first example of a finitely presented, and the first example of a simple, group of non-uniform exponential growth. The example is given by Thompson's group $V$. Our methods also show that the infimal exponential growth rates of $\mathrm{Aut}(F_{2^{n+2}})$ and of $\mathrm{EL}_{2^{n+2}}(R)$, for every finitely generated ring $R$, tend to $1$. As an application, we obtain the first example of an acylindrically hyperbolic group, and the first example of a Kazhdan group, of non-uniform exponential growth.

math.GR

Solvable Supplements to Normalizers of Cyclic 2-Subgroups

Amberg and Kazarin proved that a finite group is solvable if the normalizer of every cyclic subgroup of prime power order has a solvable supplement. We substantially relax this hypothesis by requiring it only for cyclic $2$-subgroups. This condition, denoted by $\mathrm{SSN}_2$, sharply restricts the nonabelian composition factors of the group to the family $\PSL_2(q)$, where $q\geq7$ is a prime power satisfying $q\equiv3\pmod4$. Conversely, this family is precisely the nonabelian finite simple groups that satisfy $\mathrm{SSN}_2$. Consequently, a finite group satisfying $\mathrm{SSN}_2$ is solvable if and only if it has no section isomorphic to one of these groups.

math.GR