Related papers: Another criterion for supersolvability of finite g…

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

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 >…

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

Let N be a normal subgroup of a finite group G and consider the set cd(G|N) of degrees of irreducible characters of G whose kernels do not contain N. A number of theorems are proved relating the set cd(G|N) to the structure of N. For…

The prime graph of a finite group $G$ is denoted by $\ga(G)$. Also $G$ is called recognizable by prime graph if and only if each finite group $H$ with $\ga(H)=\ga(G)$, is isomorphic to $G$. In this paper, we classify all finite groups with…

Let $\pi$ be a set of primes containing $2$ and an odd prime $p$. It is proved that if a finite group $G$ has a Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The…

Let $G$ be a group. The orbits of the natural action of $\mbox{Aut}(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. In this paper the finite nonsolvable groups $G$…

In this paper we prove that a finite group of order $r$ has at most $$ 7.3722\cdot r^{\frac{\log_2r}{4}+1.5315}$$ subgroups.

We prove that if a solvable group A acts coprimely on a solvable group G, then A has a "large" orbit in its corresponding action on the set of ordinary complex irreducible characters of G. This extends (at the cost of a weaker bound) a 2005…

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

Let G be a finite solvable group, and let h(G) denote its Fitting height, namely the length of a shortest normal series in G with nilpotent factors. We show, that any law in G has length at least h(G). This result is then used to improve a…

A subgroup $H$ of a group $G$ is said to be {pronormal} in $G$ if $H$ and $H^g$ are conjugate in $\langle H, H^g \rangle$ for every $g \in G$. Some problems in finite group theory, combinatorics, and permutation group theory were solved in…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

Baer characterized capable finite abelian groups (a group is capable if it is isomorphic to the quotient of some group by its center) by a condition on the size of the factors in the invariant factor decomposition (the group must be…

For a finite group $G$, we denote by $\omega(G)$ the number of $\operatorname{Aut}(G)$-orbits on $G$, and by $\operatorname{o}(G)$ the number of distinct element orders in $G$. In this paper, we are primarily concerned with the two…

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.