Related papers: Finite groups with few character values

We prove that if the average of the degrees of the irreducible characters of a finite group $G$ is less than 16/5, then $G$ is solvable. This solves a conjecture of I.M. Isaacs, M. Loukaki, and the first author. We discuss related…

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

There has been some interest on how the average character degree affects the structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, the average number of zeros of characters of a finite group $ G $ as the number of zeros…

A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

Let $ G $ be a finite group and $ \chi \in \mathrm{Irr}(G) $. Define $ \mathrm{cv}(G)=\{\chi(g)\mid \chi \in \mathrm{Irr}(G), g\in G \} $, $ \mathrm{cv}(\chi)=\{\chi(g)\mid g\in G \} $ and denote $ \mathrm{dl}(G) $ by the derived length of…

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

Let p be a prime larger than 3 and let G be a finite group. We prove that G is p-solvable of p-length at most 2 if there are at most two distinct character degrees relatively prime to p in the principal p-block of G. This generalizes a…

Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…

We prove that there exists an integer-valued function f on positive integers such that if a finite group G has at most k real-valued irreducible characters, then |G/Sol(G)| is at most f(k), where Sol(G) denotes the largest solvable normal…

It is known that, if all the real-valued irreducible characters of a finite group have odd degree, then the group has normal Sylow $2$-subgroup. We generalize this result for Sylow $p$-subgroups, for any prime number $p$, while assuming the…

We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: PR-groups, IPR-groups and weak IPR-groups. We show that IPR-groups and weak…

Let $G$ be a finite group and $d$ the degree of a complex irreducible character of $G$, then write $|G|=d(d+e)$ where $e$ is a nonnegative integer. We prove that $|G|\leq e^4-e^3$ whenever $e>1$. This bound is best possible and improves on…

For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…

we obtain a necessary condition for the character degree graph with all of its vertices are odd degree of a finite solvable group G.

We describe an easy way how to find supercharacter theories for a finite group, if its character table is known. Namely, we show how an arbitrary partition of the conjugacy classes or of the irreducible characters can be refined to the…

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…

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.