Related papers: Conjugacy languages in groups

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

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 any word hyperbolic group which is virtually compact special (in the sense of Haglund and Wise) is conjugacy separable. As a consequence we deduce that all word hyperbolic Coxeter groups and many classical small cancellation…

We investigate the conjugacy growth of finitely generated linear groups. We show that finitely generated non-virtually-solvable subgroups of GL_d have uniform exponential conjugacy growth and in fact that the number of distinct polynomials…

We prove that the conjugacy problem in right-angled Artin groups (RAAGs), as well as in a large and natural class of subgroups of RAAGs, can be solved in linear-time. This class of subgroups contains, for instance, all graph braid groups…

Consider an element~$x$ of a Garside group which is rigid in the sense of Garside-theory. Let $SC(x)$ be the set of rigid conjugates of~$x$ -- this is a well-known characteristic subset of the conjugacy class of~$x$. We present…

We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…

We characterize the group property of being with infinite conjugacy classes (or icc, in which all conjugacy classes beside 1 are infinite) for extensions of some specific groups ; namely extensions of abelian, centerless, icc, or word…

This article is dedicated to the characterisation of the relative hyperbolicity of Haglund and Wise's special groups. More precise, we introduce a new combinatorial formalism to study (virtually) special groups, and we prove that, given a…

Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\mathbb{Z}$ into…

Let N be a finitely generated normal subgroup of a Gromov hyperbolic group G. We establish criteria for N to have solvable conjugacy problem and be conjugacy separable in terms of the corresponding properties of G/N. We show that the…

We study the conjugacy class growth function in finitely generated virtually abelian groups. That is, the number of elements in the ball of radius $n$ in the Cayley graph which intersect a fixed conjugacy class. In the class of virtually…

A new class of groups $\mathcal{C}$, containing all coherent RAAGs and all toral relatively hyperbolic groups, is defined. It is shown that, for a group $G$ in the class $\mathcal{C}$, the $\mathbb{Z}[t]$-exponential group…

In his earlier work, the author introduced a group theory question that arises in the study of iterated Galois groups of post-critically finite quadratic polynomials. In this paper, we prove the first non-trivial results on this question.

We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…

We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Let $n\geq 3$. In this paper we deal with the conjugacy problem in the Artin braid group quotient $B_n/[P_n,P_n]$. To solve it we use systems of equations over the integers arising from the action of $B_n/[P_n,P_n]$ over the abelianization…

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…