Related papers: Group Embeddings with Algorithmic Properties

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

Let $\Gamma$ be a finitely generated group which is hyperbolic relative to a finite family $\{H_1,...,H_n\}$ of subgroups. We prove that $\Gamma$ is uniformly embeddable in a Hilbert space if and only if each subgroup $H_i$ is uniformly…

We record a folklore theorem that says a partial group embeds in a group if and only if each word has at most one possible multiplication, regardless of choice of parenthesization. We further investigate the partial groups which are…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…

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…

$2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where several sheets meet. We show that the word problem for fundamental groups of $2$-stratifolds is solvable.

We suggest a modified and briefer version for the proof of Higman's embedding theorem stating that a finitely generated group can be embedded in a finitely presented group if and only if it is recursively presented. In particular, we…

We address the following natural extension problem for group actions: Given a group $G$, a subgroup $H\le G$, and an action of $H$ on a metric space, when is it possible to extend it to an action of the whole group $G$ on a (possibly…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

Let $G$ be a finite group. Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $n$ an integer. We write $\sigma (n) =\{\sigma_{i} |\sigma_{i}\cap \pi (n)\ne \emptyset \}$, $\sigma (G) =\sigma (|G|)$.…

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…