Related papers: On a generalization of Dehn's algorithm
Dehn fillings for relatively hyperbolic groups generalize the topological Dehn surgery on a non-compact hyperbolic $3$-manifold such as a hyperbolic knot complement. We prove a rigidity result saying that if two non-elementary relatively…
Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely…
We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…
We prove that a group has word problem that is a growing context-sensitive language precisely if its word problem can be solved using a non-deterministic Cannon's algorithm (the deterministic algorithms being defined by Goodman and…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
A group is known as `large' if some finite index subgroup admits a surjective homomorphism onto a non-abelian free group. The main theorem of the paper is as follows. Let G be a finitely generated, large group and let g_1,...,g_r be a…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the Dehn presentation of the knot group of a tame, prime, alternating knot,…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
We give a solution to Dehn's isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
We generalize one part of Thurston's hyperbolic Dehn filling theorem to arbitrary-rank semisimple Lie groups by showing that certain deformations of extended geometrically finite subgroups of a semisimple Lie group are still extended…
We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…
For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by…