Related papers: Progress around the Boone-Higman Conjecture

The Hanna Neumann conjecture states that if F is a free group, then for all finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [ rank(H)-1 ] [ rank(K)-1 ] In this paper, we show that if one of the subgroups, say H, has a…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

The study of associativity of the commutator operation in groups goes back to some work of Levi in 1942. In the 1960's Richard J. Thompson created a group F whose elements are representatives of the generalized associative law for an…

Let f: G=* G(i) -> B=* B(i) be a group homomorphism between free products of groups. Suppose that G(i)f=B(i) of all i. Let H be a subgroup of G such that Hf=B. Then H decomposes into a free product H=*H(i) with H(i)f=B(i). Furthermore, H(i)…

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

The solubilizer of an element $x$ of a profinite group $G$ is the set of the elements $y$ of $G$ such that the subgroup of $G$ generated by $x$ and $y$ is prosoluble. We propose the following conjecture: the solubilizer of $x$ in $G$ has…

Let $G$ be a group, and let $S$ be a finite subset of $G$ that generates $G$ as a monoid. The co-word problem is the collection of words in the free monoid $S^{\ast}$ that represent non-trivial elements of $G$. A current conjecture, based…

Given a group $G$, we write $x^G$ for the conjugacy class of $G$ containing the element $x$. A famous theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the derived group…

Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…

The Levin conjecture was proposed by Levin in 1962 which conjectures the solvability of any group equation with coefficients in a torsion free group. The Levin conjecture is recently shown to hold for group equations of length seven by…

Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

Given a group $G$ acting faithfully on a set $S$, we characterize precisely when the twisted Brin-Thompson group $SV_G$ is finitely presented. The answer is that $SV_G$ is finitely presented if and only if we have the following: $G$ is…

Given a group word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. In the present paper we consider profinite groups admitting a word $w$ such that the…

Let $G$ be a finite group, $N(G)$ be the set of conjugacy classes of the group $G$. In the present paper it is proved $G\simeq L$ if $N(G)=N(L)$, where $G$ is a finite group with trivial center and $L$ is a finite simple group.

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

We give a direct proof that all Higman-Thompson groups of the form $G_{k,1}$ (for $k \ge 2$) are embedded in one another, which is a recent result of N. Matte Bon. This extends the embeddings given by Higman in 1974.

The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…