Related papers: Nonsolvable groups with three nonlinear irreducibl…
In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…
The aim of this paper is to classify the finite nonsolvable groups in which every irreducible character of even degree vanishes on at most two conjugacy classes. As a corollary, it is shown that $L_2(2^f)$ are the only nonsolvable groups in…
Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…
Berkovich, Chillag and Herzog characterized all finite groups $G$ in which all the nonlinear irreducible characters of $G$ have distinct degrees. In this paper we extend this result showing that a similar characterization holds for all…
In this note, we determine the irreducible characters for the simple algebraic groups of type $A_5$ over an algebraically closed field $K$ of characteristic 3, by using a theorem of Xi Nanhua and the Matlab software. In order to obtain…
For any irreducible character $\chi$ of a finite group $G$, let $\theta(\chi)$ denote the proportion of elements $g\in G$ for which $\chi(g)$ is either zero or a root of unity. Then for any $L\in[1/2,1]$ and any $\epsilon>0$, there exists…
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 solvable group and $\chi\in \Irr(G)$ be a faithful character. We show that the derived length of G is bounded by a linear function of the number of distinct irreducible constituents of $\chi\bar{\chi}$. We also discuss…
We present a description of non-solvable groups in which all real irreducible character degrees are prime-power numbers.
Let $G$ be a finite group and ${\rm cd}(G)$ will be the set of the degrees of the complex irreducible characters of $G$. Also let ${\rm cod}(G)$ be the set of codegrees of the irreducible characters of $G$. The Taketa problem conjectures if…
Let p be a prime number. Let G be a finite p-group and $\chi \in Irr(G)$. Denote by $\bar{\chi} \in Irr(G)$ the complex conjugate of $\chi$. Assume that $\chi(1)=p^n$. We show that the number of distinct irreducible constituents of the…
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. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…
Given a prime number $p$, every irreducible character $\chi$ of a finite group $G$ determines a unique conjugacy class of $p$-subgroups of $G$ which we will call the anchors of $\chi$. This invariant has been considered by L. Barker in the…
Let $G$ be a finite group and $p$ be a prime number dividing the order of $G$. An irreducible character $\chi$ of $G$ is called a quasi $p$-Steinberg character if $\chi(g)$ is nonzero for every $p$-regular element $g$ in $G$. In this paper,…
Let $G = {\rm U}(2m, {\mathbb F}_{q^2})$ be the finite unitary group, with $q$ the power of an odd prime $p$. We prove that the number of irreducible complex characters of $G$ with degree not divisible by $p$ and with Frobenius-Schur…
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…
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…
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…
Let $G$ be a finite group and $\chi\in \irr(G)$. The codegree of $\chi$ is defined as $\cod(\chi)=\frac{|G:\ker(\chi)|}{\chi(1)}$ and $\cod(G)=\{\cod(\chi) \ |\ \chi\in \irr(G)\}$ is called the set of codegrees of $G$. In this paper, we…