Related papers: Finite groups with few character values
The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…
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…
We classify the finite groups $G$ which satisfies the condition that every complex irreducible character,whose degree's square doesn't divide the index of its kernel in $G$, lies in the same Galois conjugacy class.
A new conjecture on characters of finite groups, related to the McKay conjecture, was proposed recently by the first and third authors. In this paper, we prove it for $p$-solvable groups when $p$ is odd.
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…
We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…
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$,…
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…
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…
The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…
The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…
We prove that the order of a finite group $G$ with trivial solvable radical is bounded above in terms of ${\rm acd}(G)$, the average degree of the irreducible characters. It is not true that the index of the Fitting subgroup is bounded…
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…
We provide an example of a finite group with a conjugacy class of average size on which fewer than half of the irreducible characters are either zero or a root of unity.
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.
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 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum…
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…
Several recent problems in the representation theory of finite groups require determining whether certain characters of almost simple groups belong to the principal block. Since the values of these characters are not yet known, we employ…