Related papers: Character codegrees of maximal class p-groups

An irreducible character of a finite group $G$ is called quasi $p$-Steinberg character for a prime $p$ if it takes a nonzero value on every $p$-regular element of $G$. In this article, we classify the quasi $p$-Steinberg characters of…

Assume G is a nilpotent group of class > 3 in which every proper subgroup has class at most 3. In this note, we give the exact upper bound of class of G.

Let $\chi$ be a complex irreducible character of a finite group $G$. The conductor of $\chi$, denoted $c(\chi)$, is the smallest positive integer $n$ such that $\chi(x)\in \mathbb{Q}(\exp({2\pi i/n}))$ for all $x\in G$. We show that for…

In this paper we classify all capable finite $p$-groups with derived subgroup of order $p$ and $G/G'$ of rank $n-1$.

Extending the idea from the recent paper by Carbonero, Hompe, Moore, and Spirkl, for every function $f\colon\mathbb{N}\to\mathbb{N}\cup\{\infty\}$ with $f(1)=1$ and $f(n)\geq\binom{3n+1}{3}$, we construct a hereditary class of graphs…

Let $G$ be a finite $p$-group of order $p^n$ and $M(G)$ be its Schur multiplier. It is well known result by Green that $|M(G)|= p^{\frac{1}{2}n(n-1)-t(G)}$ for some $t(G) \geq 0$. In this article we classify non-abelian $p$-groups $G$ of…

Let k(B_0) and l(B_0) respectively denote the number of ordinary and p-Brauer irreducible characters in the principal block B_0 of a finite group G. We prove that, if k(B_0)-l(B_0)=1, then l(B_0)\geq p-1 or else p=11 and l(B_0)=9. This…

An element $g$ of a finite group $G$ is said to be vanishing in $G$ if there exists an irreducible character $\chi$ of $G$ such that $\chi(g)=0$; in this case, $g$ is also called a zero of $G$. The aim of this paper is to obtain structural…

Let $p$ be a prime and $G$ a finite group. We propose a strong bound for the number of $p'$-degree irreducible characters of $G$ in terms of the commutator factor group of a Sylow $p$-subgroup of $G$. The bound arises from a recent…

Let $U(q)$ be a Sylow $p$-subgroup of the Chevalley groups $D_4(q)$ where $q$ is a power of a prime $p$. We describe a construction of all complex irreducible characters of $U(q)$ and obtain a classification of these irreducible characters…

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 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…

Let F be a finite field with q elements, let A be a finite dimensional F-algebra and let J=J(A) be the Jacobson radical of A. Then G=1+J is a p-group, where p is the characteristic of F. We refer to G as an F-algebra group. A subgroup H of…

Let $G$ be a $p$-group for some prime $p$. Let $n$ be the positive integer so that $|G:Z(G)| = p^n$. Suppose $A$ is a maximal abelian subgroup of $G$. Let $$p^l = {\rm max} \{|Z(C_G (g)):Z(G)| : g \in G \setminus Z(G)\},$$ $$p^b = {\rm max}…

Let $G=(V,E)$ be a graph and $p$ a positive integer. The $p$-domination number $\g_p(G)$ is the minimum cardinality of a set $D\subseteq V$ with $|N_G(x)\cap D|\geq p$ for all $x\in V\setminus D$. The $p$-reinforcement number $r_p(G)$ is…

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…

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. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

We prove that if $\mathcal{C}$ is a hereditary class of graphs that is polynomially $\chi$-bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also polynomially…

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…