相关论文: The influence of the nilpotentlizers on group stru…

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.

Let $G$ be a finite group, and let $x$ be an element of $G$. Denote by $\Sol_G(x)$ the set of all $y \in G$ such that the group generated by $x$ and $y$ is soluble. We investigate the influence of $\Sol_G(x)$ on the structure of $G$.

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…

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 admitting a coprime automorphism $\alpha$. Let $J_G(\alpha)$ denote the set of all commutators $[x,\alpha]$, where $x$ belongs to an $\alpha$-invariant Sylow subgroup of $G$. We show that $[G,\alpha]$ is soluble or…

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…

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

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…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

For a group G and an element a in G let |a|_k denote the cardinality of the set of commutators [a,x_1,...,x_k], where x_1,...,x_k range over G. The main result of the paper states that a group G is finite-by-nilpotent if and only if there…

For any group G, let C(G) denote the intersection of the normal- izers of centralizers of all elements of G. Set C0 = 1. Define Ci+1(G)=Ci(G) = C(G=Ci(G)) for i ? 0. By C1(G) denote the terminal term of the ascending series. In this paper,…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set $\Bbb{P}$ of all primes and $G$ a finite group. A chief factor $H/K$ of $G$ is said to be $\sigma$-central if the semidirect product $(H/K)\rtimes (G/C_{G}(H/K))$ is a…

For a finite group $G$, let $LC(G)$ be the subgroup generated by elements $x$ such that, for all $y \in G$ and all integers $n$, the order of $x^n y$ divides the least common multiple of the orders of $x$ and $y$. This subgroup is a…

In this paper, we provide some conditions of (super)-solvability and nilpotency of a finite group $G$ based on its number of subgroups $Sub(G)$. Our results generalize the classification of finite groups with less than $20$ subgroups by…

Let $G$ be a finite soluble group and $G^{(k)}$ the $k$th term of the derived series of $G$. We prove that $G^{(k)}$ is nilpotent if and only if $|ab|=|a||b|$ for any $\delta_k$-values $a,b\in G$ of coprime orders. In the course of the…

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…

In this Note we study the groups $G$ satisfying condition $(\mathcal{N},n)$, that is, every subset of $G$ with $n+1$ elements contains a pair $\{x,y\}$ such that the subgroup $<x,y>$ is nilpotent.

Let G be a profinite group. The following results are proved. The commutator subgroup G' is finite if and only if G is covered by countably many abelian subgroups. The group G is finite-by-nilpotent if and only if G is covered by countably…