相关论文: Explicit construction of benign subgroup for Higma…

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…

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

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…

An auxiliary free construction $*_{i=1}^{r}(K_i, L_i, t_i)_M$ based on HNN-extensions and on generalized free product of groups with amalgamated subgroups is suggested, and some of its basic properties are displayed. The proposed…

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…

We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…

We investigate groups that act amenably on their Higson corona (also known as bi-exact groups) and we provide reformulations of this in relation to the stable Higson corona, nuclearity of crossed products and to positive type kernels. We…

In $2019$ Hyde and the second author constructed the first family of finitely generated, simple, left orderable groups. We prove that these groups are not finitely presentable, non-inner amenable, don't have Kazhdan's property $(T)$ (yet…

We prove that if $\rho$ is an adapted positive definite function in the Fourier--Stieltjes algebra $B(G)$ of a locally compact group $G$ with $\|\rho\|_{B(G)}=1$, then the iterated powers $(\rho^n)$ converge to zero in the weak* topology…

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

We construct easy embeddings of relatively free groups (say the free Burnside group, the free solvable group) into finitely presented groups. We introduce a concept of verbal isoperimetric function of a group variety. We prove that if the…

We study two extension problems, and their interconnections: (i) extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; and (ii) (in case of Lie groups $G$) representations of the…

Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…

We prove that if a subgroup $H$ of the automorphism group $\mathrm{Aut}(\Sigma^{\mathbb{Z}})$ of a non-trivial full shift acts on points of finite support with a free orbit, then for every finitely-generated abelian group $A$, the abstract…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…