Related papers: A note about solvable and non-solvable finite grou…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

A. H. Rhemtulla proved that if a group is a residually finite p-group for infinitely many primes p, then it is two-sided orderable. In problem 10.30 of the Kourovka notebook 14th. edition, N. Ya. Medvedev asked if there is a…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…

In this paper, we prove that if two finite groups G and H have isomorphic Burnside rings, then G and H are the same order type groups, and give an example to show that the Burnside rings of the same order type groups are not necessarily…

A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

Let R be a finite unitary ring whose group of units is not solvable but all groups of units of all its proper subrings are solvable. In this paper we classify these rings and show that all finite rings of order $p^n$ for $n < 5$ and some of…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

Let $G$ be an almost simple group. We prove that if $x \in G$ has prime order $p \ge 5$, then there exists an involution $y$ such that $<x,y>$ is not solvable. Also, if $x$ is an involution then there exist three conjugates of $x$ that…

Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this…

Suppose that G is a finite group and x in G has prime order p > 3. Then x is contained in the solvable radical of G if (and only if) <x,x^g> is solvable for all g in G. If G is an almost simple group and x in G has prime order p > 3 then…

In 1962, V.A. Belonogov proved that if a finite group $G$ contains two maximal subgroups of coprime orders, then either $G$ is one of known solvable groups or $G$ is simple. In this short note based on results by M. Liebeck and J. Saxl on…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

In this paper, we investigate finite solvable tidy groups. We classify the tidy $\{ p, q \}$-groups. Combining this with a previous result, we are able to characterize the finite tidy solvable groups. Using this characterization, we bound…