Related papers: Group Embeddings with Algorithmic Properties

Let $\mathfrak F$ be a formation and let $G$ be a group. A subgroup $H$ of $G$ is $\mathrm{K}\mathfrak F$-subnormal (submodular) in $G$ if there is a subgroup chain $H=H_0\le \ H_1 \le \ \ldots \le H_i \leq H_{i+1}\le \ldots \le \ H_n=G$…

We prove that an arbitrary countable dimensional Lie algebra over a field of characteristic $\neq 2$ that is locally of subexponential growth is embeddable in a finitely generated Lie algebra of subexponential growth.

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

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…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

The Connes Embedding Problem (CEP) asks whether every separable II_1 factor embeds into an ultrapower of the hyperfinite II_1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II_1 von…

In this paper we investigate the following general problem. Let $G$ be a group and let $i(G)$ be a property of $G$. Is there an integer $d$ such that $G$ contains a $d$-generated subgroup $H$ with $i(H)=i(G)$? Here we consider the case…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

Let $G$ be a connected reductive group. We find a necessary and sufficient condition for a quasiaffine homogeneous space of $G$ to be embeddable into an irreducible $G$-module. In addition, for an affine homogeneous space we find a…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Let $K$ be an algebraically closed field of characteristic zero, and let $G$ be a connected reductive algebraic group over $K$. We address the problem of classifying triples $(G,H,V)$, where $H$ is a proper connected subgroup of $G$, and…

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…

Let $G=NH$ be a Lie group where $N,H$ are closed connected subgroups of $G,$ and $N$ is an exponential solvable Lie group which is normal in $G.$ Suppose furthermore that $N$ admits a unitary character $\chi_{\lambda}$ corresponding to a…

Let $G$ be an amenable group. We define and study an algebra $\mathcal{A}_{sn}(G)$, which is related to invariant means on the subnormal subgroups of $G$. For a just infinite amenable group $G$, we show that $\mathcal{A}_{sn}(G)$ is…

We prove that a countable dimensional associative algebra (resp. a countable semigroup) of locally subexponential growth is $M_\infty$-embeddable as a left ideal in a finitely generated algebra (resp. semigroup) of subexponential growth.…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result used the newly developed…

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 subgroups of exceptional algebraic groups $G$ which are connected, closed and…