English
Related papers

Related papers: Character codegrees, kernels, and Fitting heights …

200 papers

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…

Group Theory · Mathematics 2009-09-25 I. M. Isaacs , Greg Knutson

For a group $G$ and a character $\chi$ of $G$, let $c(\chi)$ denote the set of all irreducible characters of $G$, occurring in $\chi$. We prove that whenever $q\geq 8$, all non-trivial irreducible character $\chi$ of $\mathrm{PSL}_2(q)$…

Group Theory · Mathematics 2024-02-19 Namrata Arvind , Saikat Panja

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…

Group Theory · Mathematics 2007-05-23 Edith Adan-Bante

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…

Representation Theory · Mathematics 2024-03-15 Michael Larsen , Pham Huu Tiep

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…

Group Theory · Mathematics 2024-02-21 Mark L. Lewis , Quanfu Yan

The covering number of a non-linear character $\chi$ of a finite group $G$ is the least positive integer $k$ such that every irreducible character of $G$ occurs in $\chi^k$. We determine the covering numbers of irreducible characters of the…

Representation Theory · Mathematics 2024-07-08 Rijubrata Kundu , Velmurugan S

We study the solvable groups $G$ that have an irreducible character $\chi\in \Irr(G)$ such that $\chi \bar{\chi}$ has at most two non-principal irreducible constituents.

Group Theory · Mathematics 2007-05-23 Edith Adan-Bante

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…

Group Theory · Mathematics 2025-10-20 Jiyong Chen , Ni Du , Leyi Li

Let $G$ be a finite group, and $\pi$ be a set of primes. The $\pi$-core $\mathbf{O}_\pi(G)$ is the unique maximal normal $\pi$-subgroup of $G$, and $b(G)$ is the largest irreducible character degree of $G$. In 2017, Qian and Yang proved…

Group Theory · Mathematics 2024-10-14 Zongshu Wu , Yong Yang

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…

Group Theory · Mathematics 2025-04-01 Sesuai Y. Madanha , X. Mbaale , Tendai M. Mudziiri Shumba

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…

Group Theory · Mathematics 2021-09-10 Zeinab Akhlaghi

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…

Group Theory · Mathematics 2022-11-11 Hongning Wang , Xuning Zhang , Selina Zhang , Michelle Chen

Let $B$ be a $p$-block of a finite group $G$ with defect group $D$. The more difficult direction of the recently proven height zero conjecture says that $D$ is abelian if every character in Irr$(B)$ has height zero. We consider a smaller…

Group Theory · Mathematics 2026-03-02 James P. Cossey

Let G be a finite solvable group, and let h(G) denote its Fitting height, namely the length of a shortest normal series in G with nilpotent factors. We show, that any law in G has length at least h(G). This result is then used to improve a…

Group Theory · Mathematics 2023-05-23 Felix Leinen , Orazio Puglisi

Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. This paper investigates the relationship between the nilpotence class of a group and the inclusion…

Group Theory · Mathematics 2018-11-08 Sarah Croome , Mark L. Lewis

Let $G$ be a finite nilpotent group, $\chi$ and $\psi$ be irreducible complex characters of $G$ of prime degree. Assume that $\chi(1)=p$. Then either the product $\chi\psi$ is a multiple of an irreducible character or $\chi\psi$ is the…

Group Theory · Mathematics 2008-03-25 Edith Adan-Bante

Let $G$ be a finite $p$-group and $\chi,\psi$ be irreducible characters of $G$. We study the character $\chi\psi$ when $\chi\psi$ has at most $p-1$ distinct irreducible constituents.

Group Theory · Mathematics 2007-05-23 Edith Adan-Bante

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…

Representation Theory · Mathematics 2025-07-22 Alexander R. Miller

Let $G$ be a finite group and $\mathrm{Irr}(G)$ the set of all irreducible complex characters of $G$. Define the codegree of $\chi \in \mathrm{Irr}(G)$ as $\mathrm{cod}(\chi):=\frac{|G:\mathrm{ker}(\chi) |}{\chi(1)}$ and denote by…

Group Theory · Mathematics 2023-01-11 Mallory Dolorfino , Luke Martin , Zachary Slonim , Yuxuan Sun , Yong Yang

If chi is an irreducible character of a finite group G then the support of chi is the subset of G on which chi does not vanish. In this note, we study the supports of characters of certain classes of p-groups (a p-group is a finite group of…

Representation Theory · Mathematics 2013-07-23 Tom Wilde