Related papers: Groups with few $p'$-character degrees

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

Let $p$ be a prime. In this paper we classify the $p$-structure of those finite $p$-separable groups such that, given any three non-central conjugacy classes of $p$-regular elements, two of them necessarily have coprime lengths.

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

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 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 $p$ be a prime. We prove that if $G$ has three codegrees, then $G$ is an $M$-group. We prove for some prime $p$ that if every irreducible Brauer character of $G$ is a prime, then for every normal subgroup $N$…

If $G$ be a finite $p$-group and $\chi$ is a non-linear irreducible character of $G$, then $\chi(1)\leq |G/Z(G)|^{\frac{1}{2}}$. In \cite{fernandez2001groups}, Fern\'{a}ndez-Alcober and Moret\'{o} obtained the relation between the character…

In 2005 Wolfgang Willems put forward a conjecture proposing a lower bound for the sum of squares of the degrees of the irreducible $p$-Brauer characters of a finite group $G$. We prove this conjecture for the prime $p=2$. For this we rely…

The paper studies the minimum polynomial degrees of $p$-elements in cross-characteristic representations of simple groups of exceptional Lie type whose BN-pair rank is at most 2. Specifically, we prove that the degree in question equals the…

This article is concerned with the relative McKay conjecture for finite reductive groups. Let G be a connected reductive group defined over the finite field F_q of characteristic p>0 with corresponding Frobenius map F. We prove that if the…

A complex irreducible character of a finite group G is said to be p-constant, for some prime p dividing the order of G, if it takes constant value at the set of p-singular elements of G. In this paper we classify irreducible p-constant…

Let $\mathcal{G}$ be a finite group scheme over an algebraically closed field $k$ of characteristic ${\rm char}(k)=p\geq 3$. In generalization of the familiar notion from the modular representation theory of finite groups, we define the…

A finite group of order divisible by 3 in which centralizers of 3-elements are 3-subgroups will be called a C{\theta}{\theta}-group. The prime graph (or Gruenberg-Kegel graph) of a finite group G is denoted by {\Gamma}(G) (or GK(G)) and its…

In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $k\in \mathbb{N}$ such that any $g\in G$…

The character table of a finite group G determines whether |P:P'|=p^2 and whether |P:Z(P)|=p^2, where P is a Sylow p-subgroup of G. To prove the latter, we give a detailed classification of those groups in terms of the generalized Fitting…

Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…

In the theory of unitary group representations, a group is called type I if all factor representations are of type I, and by a celebrated theorem of James Glimm [Gli61b], the type I groups are precisely those groups for which 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…