Related papers: Group Embeddings with Algorithmic Properties

The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

This paper investigates complexity of the uniform membership problem for hyperedge replacement grammars in comparison with other mildly context-sensitive grammar formalisms. It turns out that the complexity of this problem depends on how…

We study soluble groups G in which each subnormal subgroup H with infinite rank is commensurable with a normal subgroup, i.e. there exists a normal subgroup N such that the intersection of H and N has finite index in both H and N. We show…

The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurring presentations of groups are recursive, their word problems…

We consider membership problems for rational subsets of the semigroup of $2\times 2$ matrices over $\mathbb{Q}$. For a semigroup $M$, the rational subsets $\mathrm{Rat}(M)$ are defined as the sets accepted by NFAs whose transitions are…

We show that if $H \leq G$ is a closed amenable and cocompact subgroup of a unimodular locally compact group, then the reduced group C*-algebra of $G$ is not simple. Equivalently, there are unitary representations of $G$ that are weakly…

A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible $A_1$ subgroups of exceptional algebraic groups $G$. Consequences are given…

Previously, the authors proved that the presentation complex of a one-relator group $G$ satisfies a geometric condition called negative immersions if every two-generator, one-relator subgroup of $G$ is free. Here, we prove that one-relator…

We prove that every virtually free group $G$ has property (LR) of Long and Reid: each finitely generated subgroup of $G$ is a retract of a finite index subgroup. The main ingredient in the proof is a new embedding result stating that every…

We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $\Pi$ a non-empty subset of the set $\sigma$. A set ${\cal H}$ of subgroups of a finite group $G$ is said to be a \emph{ complete Hall $\Pi…

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…

A normal subgroup $E$ of a group $G$ is said to be hypercyclically embedded in $G$ if either $E=1$ or $E\neq 1$ and every chief factor of $G$ below $E$ is cyclic. In this article, we present some new characterizations of a normal subgroup…

Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…

Let $G$ be a finite group and $p^k$ be a prime power dividing $|G|$. A subgroup $H$ of $G$ is called to be $\mathcal{M}$-supplemented in $G$ if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H_iK<G$ for every maximal subgroup…

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…

We prove that every finitely generated group $G$ discriminated by a locally quasi-convex torsion-free hyperbolic group $\Gamma$ is effectively coherent: that is, presentations for finitely generated subgroups can be computed from the…

We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$^0$: (1)…