Related papers: Solvable and non-solvable finite groups of the sam…

It is shown that for any torsion unit of augmentation one in the integral group ring $\mathbb{Z} G$ of a finite solvable group $G$, there is an element of $G$ of the same order.

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

In the paper we consider the following conjecture: if a finite group $G$ possesses a solvable $\pi$-Hall subgroup $H$, then there exist elements $x,y,z,t\in G$ such that the identity $H\cap H^x\cap H^y\cap H^z\cap H^t=O_\pi(G)$ holds. The…

Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…

An abstract group $G$ is called totally $2$-closed if $H=H^{(2),\Omega}$ for any set $\Omega$ with $G\cong H\leq{\rm Sym}(\Omega)$, where $H^{(2),\Omega}$ is the largest subgroup of ${\rm Sym}(\Omega)$ whose orbits on $\Omega\times\Omega$…

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…

In 2005, Borisov and Sapir proved that ascending HNN extensions of finitely generated linear groups are residually finite. Subsequently, Dru\c{t}u and Sapir noted the existence of finitely generated non-linear residually finite groups based…

A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…

Let $m$ be a positive integer and let $\Omega$ be a finite set. The $m$-closure of $G\leq\operatorname{Sym}(\Omega)$ is the largest permutation group on $\Omega$ having the same orbits as $G$ in its induced action on the Cartesian product…

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…

We provide a list of (mainly unsolved) problems in ordered and orderable groups. These were originally compiled 10 years ago by the last two authors. New problems have been added to the list. Progress on some of these is noted and…

Let $g$ be an element of a finite group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots,g]$ over $x\in G$, where $g$ is repeated $n$ times. By Baer's theorem, if $E_n(g)=1$,…

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

Philip Hall raised around 1965 the following question which is stated in the Kourovka Notebook: Is there a non-trivial group which is isomorphic with every proper extension of itself by itself? We will decompose the problem into two parts:…

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either…

The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…

This paper is an attempt to find out which properties of a finite group G can be expressed in terms of commutators of elements of coprime orders. A criterion of solubility of G in terms of such commutators is obtained. We also conjecture…

If $G$ is a finite group and $x\in G$ then the set of all elements of $G$ having the same order as $x$ is called {\em an order subset of $G$ determined by $x$} (see [2]). We say that $G$ is a {\em group with perfect order subsets} or…

Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…