Related papers: The generalised word problem in hyperbolic and rel…

We study the regularity of several languages derived from conjugacy classes in a finitely generated group G for a variety of examples including word hyperbolic, virtually abelian, Artin, and Garside groups. We also determine the rationality…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

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…

In 1996, Gersten proved that finitely presented subgroups of a word hyperbolic group of integral cohomological dimension 2 are hyperbolic. We use isoperimetric inequalities over arbitrary rings to extend this result to any ring. In…

We prove that for a finitely generated subgroup $H$ of a word-hyperbolic group $G$ the Frattini subgroup $F(H)$ of $H$ is finite.

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…

We examine the relationship between finitely and infinitely generated relatively hyperbolic groups, in two different contexts. First, we elaborate on a remark from math.GR/0601311, which states that the version of Dehn filling in relatively…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

In this short note, we prove the existence of weakly malnormal, virtually free, quasiconvex subgroups in any nonelementary hyperbolic group. This extends a result of Ilya Kapovich, where he proved the existence of malnormal quasiconvex…

We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

By constructing, in the relative case, objects analoguous to Rips and Sela's canonical representatives, we prove that the set of images by morphisms without accidental parabolic, of a finitely presented group in a relatively hyperbolic…

We prove that finitely generated relatively hyperbolic groups are bi-exact if and only if all peripheral subgroups are bi-exact. This is a generalization of Ozawa's result which claims that finitely generated relatively hyperbolic groups…

We present some results about quasiconvex subgroups of infinite index and their products. After that we extend the standard notion of a subgroup commensurator to an arbitrary subset of a group, and generalize some of the previously known…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

Let $G$ be a group hyperbolic relative to a finite collection of subgroups $\mathcal P$. Let $\mathcal F$ be the family of subgroups consisting of all the conjugates of subgroups in $\mathcal P$, all their subgroups, and all finite…

Context-dependent fusion grammars were recently introduced as devices for the generation of hypergraph languages. In this paper, we show that this new type of hypergraph grammars, where the application of fusion rules is restricted by…

We define an algebraic group over a group $G$ to be a variety - that is, a subset of $G^d$ defined by equations over $G$ - endowed with a group law whose coordinates can be expressed as word maps. In the case where $G$ is a torsion-free…