Related papers: Solving the Braid Word Problem Via the Fundamental…
In this article we provide a new perspective on the word problem of a group by using languages of nested words. These were introduced by Alur and Madhusudan as a way to model programming languages such as HTML. We demonstrate how a class of…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…
Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first group signature schemes based on the conjugacy problem, decomposition problem and root problem in the braid…
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…
We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
Automatic Word problem solving has always posed a great challenge for the NLP community. Usually a word problem is a narrative comprising of a few sentences and a question is asked about a quantity referred in the sentences. Solving word…
We construct a homomorphism $f$ from the braid group $B_{2n+2}$ on $2n+2$ strands to the Steinberg group associated with the Lie type $C_n$ and with integer coefficients. This homomorphism lifts the well-known symplectic representation of…
In this paper we introduce distinct approaches to loop braid groups, a generalisation of braid groups, and unify all the definitions that have appeared so far in literature, with a complete proof of the equivalence of these definitions.…