Related papers: Presenting parabolic subgroups

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…

We build quasi--isometry invariants of relatively hyperbolic groups which detect the hyperbolic parts of the group; these are variations of the stable dimension constructions previously introduced by the authors. We prove that, given any…

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has…

Let G be a graph of hyperbolic groups with 2-ended edge groups. We show that G is hierarchically hyperbolic if and only if G has no distorted infinite cyclic subgroup. More precisely, we show that G is hierarchically hyperbolic if and only…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

We present an algorithm which decides whether a given quasiconvex residually finite subgroup $H$ of a hyperbolic group $G$ is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered…

We give a characterization of toral relatively hyperbolic virtually special groups in terms of the profinite completion. We also prove a Tits alternative for subgroups of the profinite completion $\hat G$ of a relatively hyperbolic…

Given isometric actions by a group G on finitely many \delta-hyperbolic metric spaces, we provide a sufficient condition that guarantees the existence of a single element in G that is hyperbolic for each action. As an application we prove a…

Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

We introduce so-called cone topologies of paratopological groups, which are a wide way to construct counterexamples, especially of examples of compact-like paratopological groups with discontinuous inversion. We found a simple interplay…

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…