Related papers: On Thompson's conjecture for alternating and symme…
For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…
Let $G$ be a finite group, and let $N(G)$ be the set of sizes of its conjugacy classes. We show that if a finite group $G$ has trivial center and $N(G)$ equals to $N(Alt_n)$ or $N(Sym_n)$ for $n\geq 23$, then $G$ has a composition factor…
We construct two finite groups of size $2^{365}\cdot 3^{105}\cdot 7^{104}$: a solvable group $G$ and a non-solvable group $H$, such that for every integer $n$ the groups have the same number of elements of order $n$. This answers a question…
In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…
Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…
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.
Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…
For any group G, let C(G) denote the set of centralizers of G. We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n. In this note, we prove that every finite Cn-group with n ? 21 is soluble and this estimate is sharp.…
Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…
Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…
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…
For every non-nilpotent finite group $G$, there exists at least one proper subgroup $M$ such that $G$ is the setwise product of a finite number of conjugates of $M$. We define $\gamma_{\text{cp}}\left( G\right) $ to be the smallest number…
In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…
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 of…
Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…
The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of its elements. The following sufficient criterion of nonsolvability is proved: if among the prime divisors of the order of a group $G$, there are four different primes…
Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes. In the 1980's Thompson conjectured that the equality $N(G)=N(S)$, where $Z(G)=1$ and $S$ is simple, implies the isomorphism $G\simeq S$. In a series of papers of…
Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…
Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…
Denote by $\omega(G)$ the number of orbits of the action of $Aut(G)$ on the finite group $G$. We prove that if $G$ is a finite nonsolvable group in which $\omega(G) \leqslant 5$, then $G$ is isomorphic to one of the groups…