Related papers: Artin groups of type (2,3,n)

We prove that the word problem in an Artin group G based on a diagram without A_3 or B_3 subdiagrams can be solved using a system of length preserving rewrite rules which, together with free reduction, can be used to reduce any word over…

We give a quadratic-time explicit and computable algorithm to solve the word problem for Artin groups that do not contain any relations of length 3. Furthermore, we prove that, given two geodesic words representing the same element, one can…

We find a polynomial (n^6) isoperimetric function for Artin groups, the defining graph of which contains no edges labelled by 3. This in particular shows that even Artin groups have solvable word problem. We use small cancellation theory of…

We prove several results on the model theory of Artin groups, focusing on Artin groups which are ``far from right-angled Artin groups''. The first result is that if $\mathcal{C}$ is a class of Artin groups whose irreducible components are…

A conjecture of Dehornoy claims that, given a presentation of an Artin-Tits group, every word that represents the identity can be transformed into the trivial word using the braid relations, together with certain rules (between pairs of…

This paper is a short survey on four basic questions on Artin-Tits groups: the torsion, the center, the word problem, and the cohomology ($K(\pi,1)$ problem). It is also an opportunity to prove three new results concerning these questions:…

This article resolves several long-standing conjectures about Artin groups of euclidean type. In particular, we prove that every irreducible euclidean Artin group is a torsion-free centerless group with a decidable word problem and a…

We describe a constructive, cubic time solution to the conjugacy problem in Artin groups of extra-large type, which was proved solvable in those groups by Appel and Schupp. We use results from two of our previous papers that characterise…

In this paper we solve the isomorphism problem for all large-type Artin groups. Our strategy involves reconstructing the Coxeter groups associated with large-type Artin groups in a purely algebraic way. This answers several questions raised…

One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…

We prove that triangle Artin groups of the type $A_{2,3,2n}$ are residually finite for all $n\geq4$. This requires splitting these triangle Artin groups as graphs of groups and then proving that each of these graphs of groups has finite…

Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

In this second paper we solve the twisted conjugacy problem for even dihedral Artin groups, that is, groups with presentation $G(m) = \langle a,b \mid {}_{m}(a,b) = {}_{m}(b,a) \rangle$, where $m \geq 2$ is even, and $_{m}(a,b)$ is the word…

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

We describe a new approach to the Word Problem for Artin-Tits groups and, more generally, for the enveloping group U(M) of a monoid M in which any two elements admit a greatest common divisor. The method relies on a rewrite system R(M) that…

The result of this paper is the determination of the cohomology of Artin groups of type A_n, B_n and \tilde{A}_{n} with non-trivial local coefficients. The main result is an explicit computation of the cohomology of the Artin group of type…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…

The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…