Related papers: Parabolic subgroups and word problem in virtual Ar…

Our main theorem is that the word problem in the Artin group G = <a,b,c | aba=bab, ac=ca, {}_{n}(b,c) = {}_{n}(c,b) > for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

Let $\Gamma$ be a discrete subgroup of a simply connected, solvable Lie group~$G$, such that $\Ad_G\Gamma$ has the same Zariski closure as $\Ad G$. If $\alpha \colon \Gamma \to \GL_n(\real)$ is any finite-dimensional representation…

This paper considers the question of relative hyperbolicity of an Artin group with regard to the geometry of its associated Deligne complex. We prove that an Artin group is weakly hyperbolic relative to its finite (or spherical) type…

Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…

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 study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

We investigate criteria ensuring that a one-relator group $G$ contains a right-angled Artin subgroup $A(\Gamma)$, corresponding to a finite graph $\Gamma$. In particular, we prove that if $\Gamma$ is a forest with at least one edge and the…

In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…

A companion result of the the Tits alternative for $Out(F_n)$ is proved: Every solvable subgroup of $Out(F_n)$ is finitely generated and virtually abelian.

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…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

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…

Let Gamma be a torsion-free group which is hyperbolic relative to a collection of free abelian subgroups. We construct Makanin-Razborov diagrams for Gamma. We also prove that every system of equations over Gamma is equivalent to a finite…

We prove three results about the graph product $G=\G(\Gamma;G_v, v \in V(\Gamma))$ of groups $G_v$ over a graph $\Gamma$. The first result generalises a result of Servatius, Droms and Servatius, proved by them for right-angled Artin groups;…

Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…

We prove that the finitely presentable subgroups of residually free groups are separable and that the subgroups of type $\mathrm{FP}_\infty$ are virtual retracts. We describe a uniform solution to the membership problem for finitely…

We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first…

In this paper we introduce a class of `parabolic' subgroups for the generalized braid group associated to an arbitrary irreducible complex reflection group, which maps onto the collection of parabolic subgroups of the reflection group.…