Related papers: Engel-like Identities Characterizing Finite Solvab…

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…

A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for…

We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

We prove the following results. Let w be a multilinear commutator word. If G is a profinite group in which all w-values are contained in a union of countably many periodic subgroups, then the verbal subgroup w(G) is locally finite. If G is…

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…

A subgroup $H$ of a finite group $G$ is said to be an NC-subgroup of $G$, if $ H^G N_G (H) =G$, where $H^G$ denotes the normal closure of $H$ in $G$. A finite group $G$ is called a PNC-group, if any subgroup of $G$ is an NC-subgroup of $G$,…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Let $w \in F_2$ be a word and let $m$ and $n$ be two positive integers. We say that a finite group $G$ has the $w_{m,n}$-property if however a set $M$ of $m$ elements and a set $N$ of $n$ elements of the group is chosen, there exist at…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are…

Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…

Surface groups are known to be the Poincar\'e Duality groups of dimension two since the work of Eckmann, Linnell and M\"uller. We prove a prosolvable analogue of this result that allows us to show that surface groups are profinitely (and…

An element $g$ of a group $G$ is said to be right Engel if for every $x\in G$ there is a number $n=n(g,x)$ such that $[g,{}_{n}x]=1$. We prove that if a profinite group $G$ admits a coprime automorphism $\varphi$ of prime order such that…

Let $m,n$ be positive integers and $w$ a multilinear commutator word. Assume that $G$ is a finite group having subgroups $G_1,\ldots,G_m$ whose union contains all $w$-values in $G$. Assume further that all elements of the subgroups…

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…

Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is said to be concise if w(G) is finite whenever the set of w-values in G is finite. In the sixties P. Hall asked whether…

For an element $g$ of a group $G$, an Engel sink is a subset ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$. A~finite group is nilpotent if and only if…