Related papers: Finite groups with some bounded codegrees
Let $F(G)$ and $b(G)$ respectively denote the Fitting subgroup and the largest degree of an irreducible complex character of a finite group $G$. A well-known conjecture of D. Gluck claims that if $G$ is solvable then $|G:F(G)|\leq…
Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\cal CD}(G)$ the Chermak-Delgado lattice of $G$. In this note, we determine the finite groups $G$ such that $|{\cal CD}(G)|=|L(G)|-k$, $k=1,2$.
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.
We show that if G is a finite group then no chain of modular elements in its subgroup lattice L(G) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L(G) has length at least two…
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 and, for a prime $p$, let $S$ be a Sylow $p$-subgroup of $G$. A character $\chi$ of $G$ is called $\Syl_p$-regular if the restriction of $\chi$ to $S$ is the character of the regular representation of $S$. If, in…
Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…
We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.
This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…
The weak commutativity group $\chi(G)$ is generated by two isomorphic groups $G$ and $G^{\varphi }$ subject to the relations $[g,g^{\varphi}]=1$ for all $g \in G$. The group $\chi(G)$ is an extension of $D(G) = [G,G^{\varphi}]$ by $G \times…
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…
Let $G$ be a finite group, $\Bbb{F}$ be one of the fields $\mathbb{Q},\mathbb{R}$ or $\mathbb{C}$, and $N$ be a non-trivial normal subgroup of $G$. Let ${\rm acd}_{\Bbb{F}}^{*}(G)$ and ${\rm acd}_{\Bbb{F},even}(G|N)$ be the average degree…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.
The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…
A finite group $G$ is $normally ~monomial$ if all its irreducible characters are induced from linear characters of normal subgroups of $G$. In this paper, we determine all possible irreducible character degree sets of normally monomial…
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 $G$ be a finite group, let $N$ be a normal subgroup of $G$ and let $\theta$ be an irreducible character of $N$. We count the real irreducible characters of $G$ lying over $\theta$
Let $G$ be a finite group and let $\pi$ be a set of primes. Write $\mathrm{Irr}_{\pi'}(G)$ for the set of irreducible characters of degree not divisible by any prime in $\pi$. We show that if $\pi$ contains at most two prime numbers and the…
The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…