Related papers: On the multiplicities of the character codegrees

For any finite group $G$, Thompson proved that, for each $\chi\in {\rm Irr}(G)$, $\chi(g)$ is a root of unity or zero for more than a third of the elements $g\in G$, and Gallagher proved that, for each larger than average class $g^G$,…

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

Let $G$ be a finite $p$-group, where $p$ is an odd prime number, $H$ be a subgroup of $G$ and $\theta\in \Irr(H)$ be an irreducible character of $H$. Assume also that $|G:H|=p^2$. Then the character $\theta^G$ of $ G$ induced by $\theta$ is…

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.

Much work has been done to study groups with few rational conjugacy classes or few rational irreducible characters. In this paper we look at the opposite extreme. Let $G$ be a finite group. Given a conjugacy class $K$ of $G$, we say it is…

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…

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Let $d$ be a positive integer. We study the proportion of irreducible characters of infinite families of irreducible Coxeter groups whose values evaluated on a fixed element $g$ are divisible by $d$. For Coxeter groups of types $A_n, B_n$…

For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we determine the structure of all finite groups $G$ with $K_4$-free character graph…

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…

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…

Answering a question of J. Rosenberg, we construct the first examples of infinite characters on $GL_n(\mathbf{K})$ for a global field $\mathbf{K}$ and $n\geq 2.$ The case $n=2$ is deduced from the following more general result. Let $G$ a…

Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity…

If a group $G$ is $\pi$-separable, where $\pi$ is a set of primes, the set of irreducible characters $\operatorname{B}_{\pi}(G) \cup \operatorname{B}_{\pi'}(G)$ can be defined. In this paper, we prove that there are variants of some…

An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is…

A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…

We restrict the possibilities for the character degrees of $p$-groups $G$ satisfying $|G:G'| = p^2$. E.g. if $G$ is of maximal class and has an irreducible character of degree $> p$, then it has such a character of degree at most…

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 call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In graph theory, a perfect graph is a graph $\Gamma$ in which the chromatic number of every induced…