Related papers: A new solvability criterion for finite groups

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

We call a finite group G ultrasolvable if it has a characteristic subgroup series whose factors are cyclic. It was shown by Durbin--McDonald that the automorphism group of an ultrasolvable group is supersolvable. The converse statement was…

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…

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

We introduce the notion of a powerfully solvable group. These are powerful groups possessing an abelian series of a special kind. These groups include in particular the class of powerfully nilpotent groups. We will also see that for a…

Recently, Baumslag and Wiegold proved that a finite group $G$ is nilpotent if and only if $o(xy)=o(x)o(y)$ for every $x,y\in G$ of coprime order. Motivated by this result, we study the groups with the property that $(xy)^G=x^Gy^G$ and those…

Let $G$ be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of $G$ is trivial. In 2010, Vdovin conjectured that the base size of $G$ is at most 5. Burness proved this…

In this paper, we prove that all finite solvable groups satisfy the Isaacs-Seitz conjecture namely the derived lenght of a finite solvable group G is less than or equal to the number of distinct irreducible complex character degrees of G.

Let $G$ be a finite group and $N(G)$ be the set of conjugacy class sizes of $G$. For a prime $p$, let $|G||_p$ be the highest $p$-power dividing some element of $N(G)$. and define $|G|| = {\Pi}_{p\in {\pi}(G)}|G||_p$. $G$ is said to be an…

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

Any group that has a subnormal series, in which all factors are abelian and all except the last one are $p'$-torsion-free, can be embedded into a group with a subnormal series of the same length, with the same properties and such that any…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

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…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

If G is a group with a presentation of the form < x,y|x^3=y^5=W(x,y)^2=1 >, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour of a conjecture of Rosenberger.

In 1954 B. H. Neumann discovered that if G is a group in which all conjugacy classes are finite with bounded size, then the derived group G' is finite. Later (in 1957) Wiegold found an explicit bound for the order of G'. We study groups in…

For subsets $X,Y$ of a finite group $G$, let $Pr(X,Y)$ denote the probability that two random elements $x\in X$ and $y\in Y$ commute. Obviously, a finite group $G$ is nilpotent if and only if $Pr(P,Q)=1$ whenever $P$ and $Q$ are Sylow…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

Recall that a definable group is `definably amenable' if it admits a translation-invariant Keisler measure. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the proper subgroups of $G$ and in which two vertices $H$ and $K$ are joined by an edge if and only if $G=\langle H,K\rangle.$ We prove that if there exists a…