Related papers: Parabolic subgroups and word problem in virtual Ar…
We prove that, for a finitely generated group hyperbolic relative to virtually abelian subgroups, the generalised word problem for a parabolic subgroup is the language of a real-time Turing machine. Then, for a hyperbolic group, we show…
We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…
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…
Starting from the observation that the standard presentation of a virtual braid group mixes the standard presentation of the corresponding braid group with the standard presentation of the corresponding symmetric group and some mixed…
Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results, known only for parabolic subgroups of finite type Artin groups, to parabolic subgroups of FC type Artin groups. We show that the class of…
We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group…
We establish a criterion that implies the acylindrical hyperbolicity of many Artin groups admitting a visual splitting. This gives a variety of new examples of acylindrically hyperbolic Artin groups, including many Artin groups of FC-type.…
We prove that any standard parabolic subgroup of any Artin group is convex with respect to the standard generating set.
We show that the intersection of parabolic subgroups of an even finitely generated FC-type Artin group is again a parabolic subgroup.
Given an Artin group $A$ and a parabolic subgroup $P$, we study if every two elements of $P$ that are conjugate in $A$, are also conjugate in $P$. We provide an algorithm to solve this decision problem if $A$ satisfies three properties that…
Given an Artin group $A_\Gamma$, a common strategy in the study of $A_\Gamma$ is the reduction to parabolic subgroups whose defining graphs have small diameter, i.e. showing that $A_\Gamma$ has a specific property if and only if all "small"…
We describe the structure of virtually solvable normal subgroups in the automorphism group of a right-angled Artin group ${\rm Aut}(A_\Gamma)$. In particular, we prove that a finite normal subgroup in ${\rm Aut}(A_\Gamma)$ has at most order…
We prove a Tits alternative theorem for subgroups of finitely generated even Artin groups of FC type (EAFC groups), stating that there exists a finite index subgroup such that every subgroup of it is either finitely generated abelian, or…
We show that the geometric realisation of the poset of proper parabolic subgroups of a large-type Artin group has a systolic geometry. We use this geometry to show that the set of parabolic subgroups of a large-type Artin group is stable…
Abstract. We address the conjecture which states that an intersection of parabolic subgroups of an Artin-Tits group is a parabolic subgroup. We prove that the conjecture is equivalent to a, a priori, weaker conjecture. We also prove the…
We introduce the notion of a subgraph generated by an $R$-word $r$ of the Sch\"{u}tzenberger graph of a positive word $w$, $S\Gamma(w)$, where $w$ contains $r$ as its subword. We show that the word problem for a finitely presented Adian…
Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…
An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
A group is called decomposable if it can be expressed as a direct product of two proper subgroups, and indecomposable otherwise. This paper explores the decomposability of virtual Artin groups, which were introduced by Bellingeri, Paris,…