Related papers: A note on codegrees and Taketa's inequality
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…
In this paper, we prove that all finite solvable groups satisfy the Isaacs-Seitz conjecture namely the derived lenght of a finite solvable group G is less than or equal to the number of distinct irreducible complex character degrees of G.
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…
Given a finite group $G$ and an irreducible complex character $\chi$ of $G$, the codegree of $\chi$ is defined as the integer ${\rm cod}(\chi)=|G:\ker\chi|/\chi(1)$. It was conjectured by G. Qian in [13] that, for every element $g$ of $G$,…
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…
Let $\chi$ be an irreducible character of a group $G,$ and $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi)$ be the sum of the codegrees of the irreducible characters of $G.$ Write ${\rm fcod} (G)=\frac{S_c(G)}{|G|}.$ We aim to explore…
In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…
Let G be a finite group and ? be an irreducible character of G, the number cod(?) = jG : Let $ G $ be a finite group and $ \chi $ be an irreducible character of $ G $, the number $ \cod(\chi) = |G: \kernel(\chi)|/\chi(1) $ is called the…
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…
Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…
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…
The codegree of an irreducible character $\chi$ of a finite group $G$ is defined as $|G:\ker\chi|/\chi(1)$. The codegree graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertices are the prime divisors of $|G|$, where two distinct…
Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…
Let $G$ be a finite group and let $\rm{Irr}(G)$ be the set of all irreducible complex characters of $G$. For a character $\chi \in \rm{Irr}(G)$, the number $\rm{cod}(\chi):=|G:\rm{ker}\chi|/\chi(1)$ is called the co-degree of $\chi$. The…
Let $G$ be a finite group and $p$ a prime. We establish an upper bound for the derived length of a Sylow $p$-subgroup of $G$ in terms of the number of irreducible characters of $G$ whose degrees are divisible by $p$. We also prove that if…
Let $G$ be a finite group and $\mathrm{Irr}(G)$ be the set of irreducible characters of $G$. The codegree of an irreducible character $\chi$ of the group $G$ is defined as $\mathrm{cod}(\chi)=|G:\mathrm{ker}(\chi)|/\chi(1)$. In this paper,…
Let $G$ be a finite group and ${\rm cd}(G)$ denote the set of complex irreducible character degrees of $G$. In this paper, we prove that if $G$ is a finite group and $H$ is an almost simple group with socle $H_{0}= \, ^{2}{\rm G}_{2}(q)$,…
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…
Let $G$ be a finite group and $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is defined as $\chi^c(1) =\frac{|G: \ker\chi|}{\chi(1)}$. In a paper by Gao, Wang, and Chen, it was shown that $G$ cannot satisfy the condition…