Related papers: Groups Having a Character of Maximal Degree

Let $G$ be a finite group and let $ram^{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote…

Let $G$ be a finite group and let $\pi$ be a set of primes. Write $\mathrm{Irr}_{\pi'}(G)$ for the set of irreducible characters of degree not divisible by any prime in $\pi$. We show that if $\pi$ contains at most two prime numbers and the…

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…

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…

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that…

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…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

Let $(G,Z(G))$ be a Camina pair. We prove that $G$ must be a $p$-group for some prime $p$. We also prove that $|Z(G)| < |G:Z(G)|^{3/4}$. Also, we discuss how one might build examples with $|Z(G)| > |G:Z(G)|^{1/2}$, although we are not able…

We characterise finite groups such that for an odd prime $p$ all the irreducible characters in its principal $p$-block have odd degree. We show that this situation does not occur in non-abelian simple groups of order divisible by $p$ unless…

Let $p$ be a prime divisor of the order of a finite group $G$. Then $G$ has at least $2 \sqrt{p-1}$ complex irreducible characters of degrees prime to $p$. In case $p$ is a prime with $\sqrt{p-1}$ an integer this bound is sharp for…

Let $G$ be a finite group, and write ${\rm cd}(G)$ for the degree set of the complex irreducible characters of $G$. The group $G$ is said to satisfy the {\it two-prime hypothesis} if, for any distinct degrees $a, b \in {\rm cd}(G)$, the…

For a finite non-abelian group $G$ let $\rat(G)$ denote the largest ratio of degrees of two nonlinear irreducible characters of $G$. We prove that the number of non-abelian composition factors of $G$ is bounded above by…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Let $G$ be a finite group of order divisible by two distinct primes $p$ and $q$. We show that $G$ possesses a non-trivial irreducible character of degree not divisible by $p$ nor $q$ lying in both the principal $p$- and $q$-block whenever…

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…

Let $G$ be a simple graph of order $n$ with degree sequence $(d_1,d_2,\cdots,d_n)$. For an integer $p>1$, let $e_p(G)=\sum_{i=1}^n d^{p}_i$ and let $ex_p(n,H)$ be the maximum value of $e_p(G)$ among all graphs with $n$ vertices that do not…

Let $\Gamma$ be a finite simple graph. If for some integer $n\geqslant 4$, $\Gamma$ is a $K_n$-free graph whose complement has an odd cycle of length at least $2n-5$, then we say that $\Gamma$ is an $n$-exact graph. For a finite group $G$,…

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 consider problems concerning the largest degrees of irreducible characters of symmetric groups, and the multiplicities of character degrees of symmetric groups. Using evidence from computer experiments, we posit several new conjectures…

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)$,…